Goal:
    n1 : Z  y1 : V.t  x2 : V.t  n2 : Z  y2 : V.t  H : n1 < n2
  ============================
   (V.eq x2 x2)


DEBUG:Going to execute:
match reverse goal with
           | id:(?X1 -> ?X2) -> ?X3
             |- _ =>
                 Ltac.cut X3;
                  [ intro; clear id; t_tauto_intuit
                  | Ltac.cut (X1 -> X2);
                     [ exact
                     id
                     | generalize (fun y : X2 => id (fun x : X1 => y)); intro;
                        clear id; (solve [ t_tauto_intuit ]) ] ]
           | id:~ ?X1 -> ?X3
             |- _ =>
                 Ltac.cut X3;
                  [ intro; clear id; t_tauto_intuit
                  | Ltac.cut (~ X1);
                     [ exact
                     id
                     | clear id; intro; (solve [ t_tauto_intuit ]) ] ]
           | |- ?X1 =>
                 <Coq.Init.Tauto.is_disj> flags X1; (solve
                  [ Ltac.left; t_tauto_intuit | Ltac.right; t_tauto_intuit ])
           end ||
             match goal with
             | |- _ -> _ => intro; t_tauto_intuit
             | |- _ => t_reduce; t_solver
             end || t_solver
Level 5: Backtrace:

No such assumption.
Level 4: Backtrace:

No such assumption.
Level 3: Backtrace:

No such assumption.
Level 3: evaluation raised the exception
Backtrace:

No such assumption.

Level 3: Backtrace:

No such assumption.
Level 2: Backtrace:

No such assumption.