proposition: Lemma never_progress_seq : forall P Q, (forall st, never_progress Q st) -> forall st, never_progress (seq_prover P Q) st.
proof: Proof. unfold never_progress, seq_prover. intros. destruct (P st g) ; try congruence. destruct f ; try congruence. eapply H ; eauto. destruct r. destruct p ; try congruence. eapply H ; eauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause