Goal:
  
  G : t
  HI : invariants
  HG : acyclic_no_loop
  x : V.t
  n : Z
  y : V.t
  He : EdgeSet.In (x, n, y) (E G)
  xl : Z
  eq : lsp (s G) x = Some xl
  pos : 0 <= xl
  yl : Z
  eq' : lsp (s G) y = Some yl
  ylpos : 0 <= yl
  ============================
   (xl + n <= yl -> xl + n <= yl)


DEBUG:Going to execute:
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"