proposition: Lemma is_dec_correct : forall m i, eval_is_dec m i = true -> eval_prop m IsProp i \/ ~ eval_prop m IsProp i .
proof: Proof. unfold eval_is_dec, eval_prop,is_true. unfold bool_of_ptrie. intros. destruct (IntMap.get' i m);[| tauto]. destruct a. - destruct o ; simpl in H; try congruence. apply o. - rewrite i0. unfold is_true. destruct b; intuition congruence. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause