Goal:
  
  G : t
  to_simple : forall (x y : V.t) (p : PathOf x y),
              is_simple p = true -> SPath (nodes p) x y
  x0 : V.t
  y0 : V.t
  p : PathOf x0 y0
  Hp : is_simple p = true
  x : V.t
  y : V.t
  z : V.t
  e : EdgeOf x y
  p0 : PathOf y z
  Hp0 : ~~ VSet.mem x (nodes p0) && is_simple p0 = true
  ============================
   (DisjointAdd x (nodes p0) (VSet.add x (nodes p0)))


DEBUG:Going to execute:
match H with
           | H' => fail 2
           | _ => unify X Y; clear H' || clear H
           end
Level 4: Backtrace:

y is used in conclusion.
Level 4: Backtrace:

y is used in conclusion.
Level 4: Backtrace:

y is used in conclusion.
Level 4: Backtrace:

y is used in conclusion.
Level 4: Backtrace:

y is used in conclusion.
Level 4: Backtrace:

y is used in conclusion.
Level 4: Backtrace:

y is used in conclusion.
Level 3: Backtrace:

y is used in conclusion.