proposition: Lemma eval_insert_unit : forall l st (WF : wf_state st) (ES : eval_state st) (EL : Annot.lift eval_literal l), eval_state (insert_unit l st).
proof: Proof. unfold insert_unit. intros. destruct ES ; constructor ; simpl ; auto. constructor;auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause