Goal:
  
  G : t
  HI : invariants G
  HG : acyclic_no_loop G
  z : V.t
  x : V.t
  y : V.t
  z0 : V.t
  e0 : EdgeOf G x y
  p : PathOf G y z0
  e : EdgeOf G z0 z
  IHp : ~~ VSet.mem z0 (nodes G p) -> is_simple G (PathOf_add_end p e)
  nmen : ~ VSet.mem x (nodes G p)
  iss : is_true (is_simple G p)
  Hm : ~ VSet.mem z0 (VSet.add x (nodes G p))
  inn : VSet.In x (nodes G p)
  ============================
   (VSet.In x (nodes G p))


DEBUG:Going to execute:
let rec use_hyp H :=
            match type of H with
            | _ /\ _ => exact H || destruct_hyp H
            | (_ * _)%nat => exact H || destruct_hyp H
            | _ => try (solve [ inversion H ])
            end
           with do_intro := let H := fresh in
                            intro H; use_hyp H
           with destruct_hyp H := case H; clear H; do_intro; do_intro
           in
           let rec use_hyps :=
            match goal with
            | H:_ /\ _ |- _ => exact H || (destruct_hyp H; use_hyps)
            | H:(_ * _)%nat |- _ => exact H || (destruct_hyp H; use_hyps)
            | H:_ |- _ => solve [ inversion H ]
            | _ => idtac
            end
           in
           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"