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:
solve
[ trivial
with eq_true
| reflexivity
| symmetry; trivial
| contradiction
| congruence ]