Goal:
  
  G : t
  invG : invariants G
  acG : acyclic_no_loop G
  x : V.t
  y : V.t
  hx : VSet.In x (V G)
  hy : VSet.In y (V G)
  nxy : Z
  hxy : (lsp G x y <= Some nxy)%nbar
  ============================
   (forall n : nat, 0 <= 0 -> Datatypes.S n = Pos.to_nat (Pos.of_succ_nat n))


DEBUG:Going to execute:
trivial; hnf; intros; (solve
            [ do
            ![ solve
             [ trivial | apply : eq_sym ; trivial ]
             | discriminate
             | contradiction
             | Ltac.split ]
            | case not_locked_false_eq_true; Ltac.assumption
            | match goal with
              | H:~ _ |- _ => solve [ case H; trivial ]
              end ])