proposition: Lemma eval_clause_wf : forall env l1 l2, eval_clause env (map NEG l1 ++ l2) <-> (eval_and env l1 -> eval_clause env l2).
proof: Proof. induction l1. - simpl. intros. tauto. - simpl. intros. rewrite IHl1. unfold eval_lit. simpl. tauto. Qed.
imports: ZArith List Bool Lia Morphisms Cdcl.Syntax Cdcl.Lib Cdcl.Lit Cdcl.Clause