proposition: Lemma wf_success : forall g m u l d (AN : wf_pset m (Annot.deps l)) (WFU : wf_units_lit u m), success g u l = Some d -> wf_pset m d.
proof: Proof. unfold success. destruct g. intros. destruct (is_goalb h (Annot.elt l)). - inv H. auto. - eapply wf_unsat in H; eauto. - intros. eapply wf_unsat in H; eauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause