proposition: Lemma eq_prover_case_split : forall P Q, eq_prover P Q -> eq_prover (prover_case_split P) (prover_case_split Q).
proof: Proof. unfold eq_prover, prover_case_split. intros. destruct (find_split (units st) (is_classic g) (clauses st)); auto. unfold case_split_ann. apply eq_prover_case_split_ann; auto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause