(*s If there is no circuit [(cons x l)] with negative weight [d], then [cg] is consistent: *)

(* Specifications: *)
Theorem CG_circuit_complete :
forall cg : CGraph1,
(forall (x : ad) (d : D) (l : list ad),
CG_path cg x d (x :: l) -> Dle Dz d = true) -> CGconsistent cg.
Lemma CG_translate_l :
forall (cg : CGraph1) (rho : ad -> D) (d : D),
CGsat cg rho -> CGsat cg (fun a : ad => Dplus d (rho a)).