proposition: Lemma eval_empty : forall m, eval_state (empty_state m).
proof: Proof. unfold empty_state. constructor ; simpl ; auto. - unfold eval_units. apply forall_units_empty. - constructor. - apply WMap.Forall_empty. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause