Goal:
  
  G : t
  HI : invariants G
  HG : acyclic_no_loop G
  y_0 : V.t
  x_0 : V.t
  Vx : VSet.In x_0 (V G)
  Vy : VSet.In y_0 (V G)
  Hxs : lsp0 G (V G) x_0 y_0 = None
  K : Z
  x : V.t
  y : V.t
  p : PathOf G x y
  ineq : False
  ============================
   (exists n : Z, None = Some n)


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"