proposition: Lemma not_not_or : forall (A B: Prop), ((A -> False) -> False) \/ ((B -> False) -> False) -> (((A \/ B) -> False) -> False).
proof: Proof. tauto. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause