proposition: Lemma eval_opp_literal : forall (m:hmap) l l' (HL : has_literal m l) (HL' : has_literal m l') (OPP : opp_literal l l' = true), eval_literal l -> eval_literal (neg_literal l').
proof: Proof. unfold opp_literal. destruct l,l'; try discriminate. - simpl. intros. apply eqb_correct in OPP. eapply has_form_eq in OPP; eauto. subst;auto. - simpl. intros. apply eqb_correct in OPP. eapply has_form_eq in OPP; eauto. subst;auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause