proposition: Lemma insert_normalised_clause_not_OutOfFuel : forall i cl st, ~is_fail (insert_normalised_clause i cl st).
proof: Proof. unfold insert_normalised_clause. intros. destruct (Annot.elt cl) ; simpl; try congruence. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause