Goal:
  
  G : t
  z : V.t
  x : V.t
  y : V.t
  z0 : V.t
  p : PathOf G y z0
  e : EdgeOf G z0 z
  i : V.t
  H : VSet.In i (nodes G (PathOf_add_end p e))
  source_vertex0 : VSet.In (s G) (V G)
  H0 : i = z0
  ============================
   ((x = i \/ VSet.In i (nodes G p)) \/ i = z0)


DEBUG:Going to execute:
<coq-core.plugins.tauto::is_conj@0>

Goals:
  
  G : t
  z : V.t
  x : V.t
  y : V.t
  z0 : V.t
  p : PathOf G y z0
  e : EdgeOf G z0 z
  i : V.t
  H : VSet.In i (nodes G (PathOf_add_end p e))
  source_vertex0 : VSet.In (s G) (V G)
  H0 : VSet.In i (nodes G p)
  ============================
   ((x = i \/ VSet.In i (nodes G p)) \/ i = z0)

  
  G : t
  z : V.t
  x : V.t
  y : V.t
  z0 : V.t
  p : PathOf G y z0
  e : EdgeOf G z0 z
  i : V.t
  H : VSet.In i (nodes G (PathOf_add_end p e))
  source_vertex0 : VSet.In (s G) (V G)
  H0 : i = z0
  ============================
   ((x = i \/ VSet.In i (nodes G p)) \/ i = z0)


DEBUG:Going to execute:
<Coq.Init.Tauto.axioms> flags ||
             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 3: evaluation returns
<coq-core.plugins.tauto::is_conj@0>
where
tauto_flags := 
of type
tauto_flags
X1 := (x = i \/ VSet.In i (nodes G p)) \/ i = z0
of type
constr of type tacvalue

Level 3: Backtrace:

Tactic failure.
Level 3: Backtrace:

Tactic failure.
Level 2: Backtrace:

Tactic failure.
Level 2: Backtrace:

Tactic failure.
Level 1: Backtrace:

No matching clauses for match.
Level 1: Backtrace:

No matching clauses for match.