Goal:
  
  m : t
  a : t
  l : list t
  IHl : forall n : t, fold_left max l n = m -> n = m \/ In m l
  n : t
  H : max n a = m
  ============================
   (max n a = m)


DEBUG:Going to execute:
let do_atom := solve
           [ trivial
           with eq_true
           | reflexivity
           | symmetry; trivial
           | contradiction
           | congruence ]
           in
           let rec do_ccl :=
            try do_atom; repeat (do_intro; try do_atom); try arith_congr;
             (solve [ split; do_ccl ])
           in
           (solve [ do_atom | use_hyps; do_ccl ]) ||
             fail "Cannot solve this goal"