0.04/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.09 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.09/0.29 % Computer : n020.cluster.edu 0.09/0.29 % Model : x86_64 x86_64 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.29 % Memory : 8042.1875MB 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.29 % CPULimit : 960 0.09/0.29 % WCLimit : 120 0.09/0.29 % DateTime : Thu Jul 2 09:01:02 EDT 2020 0.09/0.29 % CPUTime : 0.09/0.30 # Version: 2.5pre002 0.09/0.30 # No SInE strategy applied 0.09/0.30 # Trying AutoSched0 for 59 seconds 0.51/0.73 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.51/0.73 # and selection function SelectComplexExceptUniqMaxHorn. 0.51/0.73 # 0.51/0.73 # Preprocessing time : 0.030 s 0.51/0.73 # Presaturation interreduction done 0.51/0.73 0.51/0.73 # Proof found! 0.51/0.73 # SZS status Theorem 0.51/0.73 # SZS output start CNFRefutation 0.51/0.73 fof(adjunction, axiom, (adjunction<=>![X1, X2]:(is_a_theorem(and(X1,X2))<=(is_a_theorem(X2)&is_a_theorem(X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', adjunction)). 0.51/0.73 fof(op_strict_equiv, axiom, (op_strict_equiv=>![X1, X2]:and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax', op_strict_equiv)). 0.51/0.73 fof(substitution_strict_equiv, axiom, (substitution_strict_equiv<=>![X1, X2]:(X1=X2<=is_a_theorem(strict_equiv(X1,X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', substitution_strict_equiv)). 0.51/0.73 fof(s1_0_adjunction, axiom, adjunction, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_adjunction)). 0.51/0.73 fof(s1_0_op_strict_equiv, axiom, op_strict_equiv, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_op_strict_equiv)). 0.51/0.73 fof(s1_0_substitution_strict_equiv, axiom, substitution_strict_equiv, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_substitution_strict_equiv)). 0.51/0.73 fof(axiom_m1, axiom, (axiom_m1<=>![X1, X2]:is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m1)). 0.51/0.73 fof(op_implies_and, axiom, (op_implies_and=>![X1, X2]:not(and(X1,not(X2)))=implies(X1,X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_implies_and)). 0.51/0.73 fof(s1_0_axiom_m1, axiom, axiom_m1, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m1)). 0.51/0.73 fof(op_strict_implies, axiom, (op_strict_implies=>![X1, X2]:necessarily(implies(X1,X2))=strict_implies(X1,X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax', op_strict_implies)). 0.51/0.73 fof(op_or, axiom, (op_or=>![X1, X2]:or(X1,X2)=not(and(not(X1),not(X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax', op_or)). 0.51/0.73 fof(hilbert_op_implies_and, axiom, op_implies_and, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', hilbert_op_implies_and)). 0.51/0.73 fof(axiom_m4, axiom, (![X1]:is_a_theorem(strict_implies(X1,and(X1,X1)))<=>axiom_m4), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m4)). 0.51/0.73 fof(axiom_m2, axiom, (axiom_m2<=>![X1, X2]:is_a_theorem(strict_implies(and(X1,X2),X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m2)). 0.51/0.73 fof(s1_0_op_strict_implies, axiom, op_strict_implies, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_op_strict_implies)). 0.51/0.73 fof(s1_0_op_or, axiom, op_or, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_op_or)). 0.51/0.73 fof(s1_0_axiom_m4, axiom, axiom_m4, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m4)). 0.51/0.73 fof(s1_0_axiom_m2, axiom, axiom_m2, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m2)). 0.51/0.73 fof(modus_ponens_strict_implies, axiom, (modus_ponens_strict_implies<=>![X1, X2]:(is_a_theorem(X2)<=(is_a_theorem(strict_implies(X1,X2))&is_a_theorem(X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', modus_ponens_strict_implies)). 0.51/0.73 fof(axiom_m5, axiom, (axiom_m5<=>![X1, X2, X5]:is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X5)),strict_implies(X1,X5)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m5)). 0.51/0.73 fof(s1_0_modus_ponens_strict_implies, axiom, modus_ponens_strict_implies, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_modus_ponens_strict_implies)). 0.51/0.73 fof(s1_0_axiom_m5, axiom, axiom_m5, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m5)). 0.51/0.73 fof(axiom_m3, axiom, (![X1, X2, X5]:is_a_theorem(strict_implies(and(and(X1,X2),X5),and(X1,and(X2,X5))))<=>axiom_m3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m3)). 0.51/0.73 fof(s1_0_axiom_m3, axiom, axiom_m3, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+4.ax', s1_0_axiom_m3)). 0.51/0.73 fof(axiom_m10, axiom, (axiom_m10<=>![X1]:is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_m10)). 0.51/0.73 fof(km5_axiom_5, conjecture, axiom_5, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', km5_axiom_5)). 0.51/0.73 fof(s1_0_m10_axiom_m10, axiom, axiom_m10, file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+6.ax', s1_0_m10_axiom_m10)). 0.51/0.73 fof(axiom_5, axiom, (![X1]:is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))<=>axiom_5), file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax', axiom_5)). 0.51/0.73 fof(c_0_28, plain, ![X32, X33]:((~adjunction|(~is_a_theorem(X33)|~is_a_theorem(X32)|is_a_theorem(and(X32,X33))))&(((is_a_theorem(esk10_0)|adjunction)&(is_a_theorem(esk9_0)|adjunction))&(~is_a_theorem(and(esk9_0,esk10_0))|adjunction))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[adjunction])])])])])])). 0.51/0.73 fof(c_0_29, plain, ![X98, X99]:(~op_strict_equiv|and(strict_implies(X98,X99),strict_implies(X99,X98))=strict_equiv(X98,X99)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_equiv])])])). 0.51/0.73 fof(c_0_30, plain, ![X28, X29]:((~substitution_strict_equiv|(~is_a_theorem(strict_equiv(X28,X29))|X28=X29))&((is_a_theorem(strict_equiv(esk7_0,esk8_0))|substitution_strict_equiv)&(esk7_0!=esk8_0|substitution_strict_equiv))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[substitution_strict_equiv])])])])])])). 0.51/0.73 cnf(c_0_31, plain, (is_a_theorem(and(X2,X1))|~adjunction|~is_a_theorem(X1)|~is_a_theorem(X2)), inference(split_conjunct,[status(thm)],[c_0_28])). 0.51/0.73 cnf(c_0_32, plain, (adjunction), inference(split_conjunct,[status(thm)],[s1_0_adjunction])). 0.51/0.73 cnf(c_0_33, plain, (and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2)|~op_strict_equiv), inference(split_conjunct,[status(thm)],[c_0_29])). 0.51/0.73 cnf(c_0_34, plain, (op_strict_equiv), inference(split_conjunct,[status(thm)],[s1_0_op_strict_equiv])). 0.51/0.73 cnf(c_0_35, plain, (X1=X2|~substitution_strict_equiv|~is_a_theorem(strict_equiv(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_30])). 0.51/0.73 cnf(c_0_36, plain, (substitution_strict_equiv), inference(split_conjunct,[status(thm)],[s1_0_substitution_strict_equiv])). 0.51/0.73 cnf(c_0_37, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(X1)|~is_a_theorem(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32])])). 0.51/0.73 cnf(c_0_38, plain, (and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_34])])). 0.51/0.73 fof(c_0_39, plain, ![X38, X39]:((~axiom_m1|is_a_theorem(strict_implies(and(X38,X39),and(X39,X38))))&(~is_a_theorem(strict_implies(and(esk12_0,esk13_0),and(esk13_0,esk12_0)))|axiom_m1)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m1])])])])). 0.51/0.73 fof(c_0_40, plain, ![X12, X13]:(~op_implies_and|not(and(X12,not(X13)))=implies(X12,X13)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])). 0.51/0.73 cnf(c_0_41, plain, (X1=X2|~is_a_theorem(strict_equiv(X1,X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_36])])). 0.51/0.73 cnf(c_0_42, plain, (is_a_theorem(strict_equiv(X1,X2))|~is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X2,X1))), inference(spm,[status(thm)],[c_0_37, c_0_38])). 0.51/0.73 cnf(c_0_43, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))|~axiom_m1), inference(split_conjunct,[status(thm)],[c_0_39])). 0.51/0.73 cnf(c_0_44, plain, (axiom_m1), inference(split_conjunct,[status(thm)],[s1_0_axiom_m1])). 0.51/0.73 fof(c_0_45, plain, ![X95, X96]:(~op_strict_implies|necessarily(implies(X95,X96))=strict_implies(X95,X96)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_implies])])])). 0.51/0.73 fof(c_0_46, plain, ![X10, X11]:(~op_or|or(X10,X11)=not(and(not(X10),not(X11)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])). 0.51/0.73 cnf(c_0_47, plain, (not(and(X1,not(X2)))=implies(X1,X2)|~op_implies_and), inference(split_conjunct,[status(thm)],[c_0_40])). 0.51/0.73 cnf(c_0_48, plain, (op_implies_and), inference(split_conjunct,[status(thm)],[hilbert_op_implies_and])). 0.51/0.73 cnf(c_0_49, plain, (X1=X2|~is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X2,X1))), inference(spm,[status(thm)],[c_0_41, c_0_42])). 0.51/0.73 cnf(c_0_50, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43, c_0_44])])). 0.51/0.73 fof(c_0_51, plain, ![X47]:((~is_a_theorem(strict_implies(esk16_0,and(esk16_0,esk16_0)))|axiom_m4)&(~axiom_m4|is_a_theorem(strict_implies(X47,and(X47,X47))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m4])])])])). 0.51/0.73 fof(c_0_52, plain, ![X48, X49]:((~axiom_m2|is_a_theorem(strict_implies(and(X48,X49),X48)))&(~is_a_theorem(strict_implies(and(esk17_0,esk18_0),esk17_0))|axiom_m2)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m2])])])])). 0.51/0.73 cnf(c_0_53, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2)|~op_strict_implies), inference(split_conjunct,[status(thm)],[c_0_45])). 0.51/0.73 cnf(c_0_54, plain, (op_strict_implies), inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies])). 0.51/0.73 cnf(c_0_55, plain, (or(X1,X2)=not(and(not(X1),not(X2)))|~op_or), inference(split_conjunct,[status(thm)],[c_0_46])). 0.51/0.73 cnf(c_0_56, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47, c_0_48])])). 0.51/0.73 cnf(c_0_57, plain, (op_or), inference(split_conjunct,[status(thm)],[s1_0_op_or])). 0.51/0.73 cnf(c_0_58, plain, (and(X1,X2)=and(X2,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_50])])). 0.51/0.73 cnf(c_0_59, plain, (is_a_theorem(strict_implies(X1,and(X1,X1)))|~axiom_m4), inference(split_conjunct,[status(thm)],[c_0_51])). 0.51/0.73 cnf(c_0_60, plain, (axiom_m4), inference(split_conjunct,[status(thm)],[s1_0_axiom_m4])). 0.51/0.73 cnf(c_0_61, plain, (is_a_theorem(strict_implies(and(X1,X2),X1))|~axiom_m2), inference(split_conjunct,[status(thm)],[c_0_52])). 0.51/0.73 cnf(c_0_62, plain, (axiom_m2), inference(split_conjunct,[status(thm)],[s1_0_axiom_m2])). 0.51/0.73 fof(c_0_63, plain, ![X90, X91]:((~modus_ponens_strict_implies|(~is_a_theorem(strict_implies(X90,X91))|~is_a_theorem(X90)|is_a_theorem(X91)))&(((is_a_theorem(strict_implies(esk38_0,esk39_0))|modus_ponens_strict_implies)&(is_a_theorem(esk38_0)|modus_ponens_strict_implies))&(~is_a_theorem(esk39_0)|modus_ponens_strict_implies))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[modus_ponens_strict_implies])])])])])])). 0.51/0.73 fof(c_0_64, plain, ![X82, X83, X84]:((~axiom_m5|is_a_theorem(strict_implies(and(strict_implies(X82,X83),strict_implies(X83,X84)),strict_implies(X82,X84))))&(~is_a_theorem(strict_implies(and(strict_implies(esk34_0,esk35_0),strict_implies(esk35_0,esk36_0)),strict_implies(esk34_0,esk36_0)))|axiom_m5)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m5])])])])). 0.51/0.73 cnf(c_0_65, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53, c_0_54])])). 0.51/0.73 cnf(c_0_66, plain, (implies(not(X1),X2)=or(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55, c_0_56]), c_0_57])])). 0.51/0.73 cnf(c_0_67, plain, (not(and(not(X1),X2))=implies(X2,X1)), inference(spm,[status(thm)],[c_0_56, c_0_58])). 0.51/0.73 cnf(c_0_68, plain, (is_a_theorem(strict_implies(X1,and(X1,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59, c_0_60])])). 0.51/0.73 cnf(c_0_69, plain, (is_a_theorem(strict_implies(and(X1,X2),X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61, c_0_62])])). 0.51/0.73 cnf(c_0_70, plain, (is_a_theorem(X2)|~modus_ponens_strict_implies|~is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(X1)), inference(split_conjunct,[status(thm)],[c_0_63])). 0.51/0.73 cnf(c_0_71, plain, (modus_ponens_strict_implies), inference(split_conjunct,[status(thm)],[s1_0_modus_ponens_strict_implies])). 0.51/0.73 cnf(c_0_72, plain, (is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|~axiom_m5), inference(split_conjunct,[status(thm)],[c_0_64])). 0.51/0.73 cnf(c_0_73, plain, (axiom_m5), inference(split_conjunct,[status(thm)],[s1_0_axiom_m5])). 0.51/0.73 cnf(c_0_74, plain, (necessarily(or(X1,X2))=strict_implies(not(X1),X2)), inference(spm,[status(thm)],[c_0_65, c_0_66])). 0.51/0.73 cnf(c_0_75, plain, (or(X1,X2)=or(X2,X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_67]), c_0_66]), c_0_66])). 0.51/0.73 cnf(c_0_76, plain, (and(X1,X1)=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_68]), c_0_69])])). 0.51/0.73 cnf(c_0_77, plain, (is_a_theorem(X1)|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70, c_0_71])])). 0.51/0.73 cnf(c_0_78, plain, (is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72, c_0_73])])). 0.51/0.73 cnf(c_0_79, plain, (strict_implies(not(X1),X2)=strict_implies(not(X2),X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74, c_0_75]), c_0_74])). 0.51/0.73 cnf(c_0_80, plain, (not(not(X1))=or(X1,X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_76]), c_0_66])). 0.51/0.73 cnf(c_0_81, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(and(strict_implies(X1,X3),strict_implies(X3,X2)))), inference(spm,[status(thm)],[c_0_77, c_0_78])). 0.51/0.73 cnf(c_0_82, plain, (is_a_theorem(strict_implies(X1,X1))), inference(rw,[status(thm)],[c_0_68, c_0_76])). 0.51/0.73 cnf(c_0_83, plain, (strict_implies(not(X1),not(X2))=strict_implies(or(X2,X2),X1)), inference(spm,[status(thm)],[c_0_79, c_0_80])). 0.51/0.73 cnf(c_0_84, plain, (is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(strict_implies(X1,X3))|~is_a_theorem(strict_implies(X3,X2))), inference(spm,[status(thm)],[c_0_81, c_0_37])). 0.51/0.73 cnf(c_0_85, plain, (is_a_theorem(strict_implies(or(X1,X1),X1))), inference(spm,[status(thm)],[c_0_82, c_0_83])). 0.51/0.73 cnf(c_0_86, plain, (not(X1)=X2|~is_a_theorem(strict_implies(not(X2),X1))|~is_a_theorem(strict_implies(X2,not(X1)))), inference(spm,[status(thm)],[c_0_49, c_0_79])). 0.51/0.73 cnf(c_0_87, plain, (is_a_theorem(strict_implies(or(X1,X1),X2))|~is_a_theorem(strict_implies(X1,X2))), inference(spm,[status(thm)],[c_0_84, c_0_85])). 0.51/0.73 cnf(c_0_88, plain, (is_a_theorem(strict_implies(and(X1,X2),X3))|~is_a_theorem(strict_implies(X1,X3))), inference(spm,[status(thm)],[c_0_84, c_0_69])). 0.51/0.73 fof(c_0_89, plain, ![X79, X80, X81]:((~is_a_theorem(strict_implies(and(and(esk31_0,esk32_0),esk33_0),and(esk31_0,and(esk32_0,esk33_0))))|axiom_m3)&(~axiom_m3|is_a_theorem(strict_implies(and(and(X79,X80),X81),and(X79,and(X80,X81)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m3])])])])). 0.51/0.73 cnf(c_0_90, plain, (not(not(X1))=X1|~is_a_theorem(strict_implies(X1,not(not(X1))))), inference(spm,[status(thm)],[c_0_86, c_0_82])). 0.51/0.73 cnf(c_0_91, plain, (is_a_theorem(strict_implies(not(X1),not(X2)))|~is_a_theorem(strict_implies(X2,X1))), inference(spm,[status(thm)],[c_0_87, c_0_83])). 0.51/0.73 cnf(c_0_92, plain, (is_a_theorem(X1)|~is_a_theorem(and(X2,X3))|~is_a_theorem(strict_implies(X2,X1))), inference(spm,[status(thm)],[c_0_77, c_0_88])). 0.51/0.73 cnf(c_0_93, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3))))|~axiom_m3), inference(split_conjunct,[status(thm)],[c_0_89])). 0.51/0.73 cnf(c_0_94, plain, (axiom_m3), inference(split_conjunct,[status(thm)],[s1_0_axiom_m3])). 0.51/0.73 cnf(c_0_95, plain, (not(not(not(X1)))=not(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90, c_0_91]), c_0_79]), c_0_82])])). 0.51/0.73 cnf(c_0_96, plain, (is_a_theorem(X1)|~is_a_theorem(strict_implies(strict_implies(X2,X3),X1))|~is_a_theorem(strict_equiv(X2,X3))), inference(spm,[status(thm)],[c_0_92, c_0_38])). 0.51/0.73 cnf(c_0_97, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93, c_0_94])])). 0.51/0.73 cnf(c_0_98, plain, (implies(X1,not(not(X2)))=implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67, c_0_95]), c_0_67])). 0.51/0.73 cnf(c_0_99, plain, (is_a_theorem(X1)|~is_a_theorem(strict_implies(strict_implies(not(X2),X3),X1))|~is_a_theorem(strict_equiv(not(X3),X2))), inference(spm,[status(thm)],[c_0_96, c_0_79])). 0.51/0.73 cnf(c_0_100, plain, (and(and(X1,X2),X3)=and(X1,and(X2,X3))|~is_a_theorem(strict_implies(and(X1,and(X2,X3)),and(and(X1,X2),X3)))), inference(spm,[status(thm)],[c_0_49, c_0_97])). 0.51/0.73 cnf(c_0_101, plain, (is_a_theorem(strict_implies(and(X1,X2),X2))), inference(spm,[status(thm)],[c_0_69, c_0_58])). 0.51/0.73 cnf(c_0_102, plain, (strict_implies(X1,not(not(X2)))=strict_implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65, c_0_98]), c_0_65])). 0.51/0.73 cnf(c_0_103, plain, (is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(strict_equiv(not(X2),X1))), inference(spm,[status(thm)],[c_0_99, c_0_82])). 0.51/0.73 cnf(c_0_104, plain, (and(X1,and(X1,X2))=and(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100, c_0_76]), c_0_101])])). 0.51/0.73 cnf(c_0_105, plain, (not(not(X1))=X1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_90, c_0_102]), c_0_82])])). 0.51/0.73 cnf(c_0_106, plain, (is_a_theorem(strict_implies(not(X1),not(X2)))|~is_a_theorem(strict_equiv(or(X2,X2),X1))), inference(spm,[status(thm)],[c_0_103, c_0_80])). 0.51/0.73 cnf(c_0_107, plain, (strict_equiv(X1,X1)=strict_implies(X1,X1)), inference(spm,[status(thm)],[c_0_38, c_0_76])). 0.51/0.73 cnf(c_0_108, plain, (and(X1,and(X2,X1))=and(X2,X1)), inference(spm,[status(thm)],[c_0_104, c_0_58])). 0.51/0.73 cnf(c_0_109, plain, (not(implies(X1,X2))=and(not(X2),X1)), inference(spm,[status(thm)],[c_0_105, c_0_67])). 0.51/0.73 cnf(c_0_110, plain, (not(and(X1,or(X2,X2)))=implies(X1,not(X2))), inference(spm,[status(thm)],[c_0_56, c_0_80])). 0.51/0.73 cnf(c_0_111, plain, (is_a_theorem(strict_implies(not(not(X1)),or(X1,X1)))), inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106, c_0_107]), c_0_82])]), c_0_79])). 0.51/0.73 cnf(c_0_112, plain, (implies(and(X1,not(X2)),X2)=implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67, c_0_108]), c_0_56])). 0.51/0.73 cnf(c_0_113, plain, (and(not(X1),not(X2))=not(or(X2,X1))), inference(spm,[status(thm)],[c_0_109, c_0_66])). 0.51/0.73 cnf(c_0_114, plain, (or(X1,not(X2))=implies(or(X2,X2),X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67, c_0_110]), c_0_66])). 0.51/0.73 cnf(c_0_115, plain, (or(X1,X1)=X1), inference(rw,[status(thm)],[c_0_80, c_0_105])). 0.51/0.73 cnf(c_0_116, plain, (is_a_theorem(strict_implies(not(not(X1)),X2))|~is_a_theorem(strict_implies(or(X1,X1),X2))), inference(spm,[status(thm)],[c_0_84, c_0_111])). 0.51/0.73 cnf(c_0_117, plain, (necessarily(not(not(X1)))=strict_implies(not(X1),X1)), inference(spm,[status(thm)],[c_0_74, c_0_80])). 0.51/0.73 cnf(c_0_118, plain, (or(not(X1),X2)=implies(X1,X2)), inference(spm,[status(thm)],[c_0_66, c_0_105])). 0.51/0.73 cnf(c_0_119, plain, (or(X1,or(X1,X2))=or(X2,X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112, c_0_113]), c_0_66]), c_0_66]), c_0_75])). 0.51/0.73 cnf(c_0_120, plain, (or(X1,not(X2))=implies(X2,X1)), inference(rw,[status(thm)],[c_0_114, c_0_115])). 0.51/0.73 cnf(c_0_121, plain, (is_a_theorem(X1)|~is_a_theorem(strict_implies(not(X1),not(X2)))|~is_a_theorem(or(X2,X2))), inference(spm,[status(thm)],[c_0_77, c_0_83])). 0.51/0.73 cnf(c_0_122, plain, (is_a_theorem(strict_implies(not(not(X1)),X2))|~is_a_theorem(strict_implies(X1,X2))), inference(spm,[status(thm)],[c_0_116, c_0_87])). 0.51/0.73 cnf(c_0_123, plain, (is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(necessarily(not(not(X1))))|~is_a_theorem(strict_implies(X1,X2))), inference(spm,[status(thm)],[c_0_84, c_0_117])). 0.51/0.73 cnf(c_0_124, plain, (implies(X1,implies(X1,X2))=implies(X1,X2)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118, c_0_119]), c_0_120]), c_0_118])). 0.51/0.73 cnf(c_0_125, plain, (strict_implies(not(X1),not(X2))=strict_implies(X2,X1)), inference(spm,[status(thm)],[c_0_79, c_0_105])). 0.51/0.73 cnf(c_0_126, plain, (is_a_theorem(not(X1))|~is_a_theorem(strict_implies(X1,not(X2)))|~is_a_theorem(or(X2,X2))), inference(spm,[status(thm)],[c_0_121, c_0_122])). 0.51/0.73 cnf(c_0_127, plain, (is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(necessarily(X1))), inference(rw,[status(thm)],[c_0_123, c_0_105])). 0.51/0.73 cnf(c_0_128, plain, (strict_implies(X1,implies(X1,X2))=strict_implies(X1,X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65, c_0_124]), c_0_65])). 0.51/0.73 cnf(c_0_129, plain, (is_a_theorem(strict_implies(X1,or(X1,X2)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101, c_0_113]), c_0_125])). 0.51/0.73 cnf(c_0_130, plain, (is_a_theorem(not(X1))|~is_a_theorem(strict_implies(X1,not(X2)))|~is_a_theorem(X2)), inference(rw,[status(thm)],[c_0_126, c_0_115])). 0.51/0.73 cnf(c_0_131, plain, (is_a_theorem(strict_implies(not(X1),X2))|~is_a_theorem(necessarily(X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127, c_0_128]), c_0_66]), c_0_129])])). 0.51/0.73 fof(c_0_132, plain, ![X74]:((~axiom_m10|is_a_theorem(strict_implies(possibly(X74),necessarily(possibly(X74)))))&(~is_a_theorem(strict_implies(possibly(esk30_0),necessarily(possibly(esk30_0))))|axiom_m10)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m10])])])])). 0.51/0.73 fof(c_0_133, negated_conjecture, ~(axiom_5), inference(assume_negation,[status(cth)],[km5_axiom_5])). 0.51/0.73 cnf(c_0_134, plain, (is_a_theorem(X1)|~is_a_theorem(necessarily(X1))|~is_a_theorem(X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130, c_0_131]), c_0_105])). 0.51/0.73 cnf(c_0_135, plain, (is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1))))|~axiom_m10), inference(split_conjunct,[status(thm)],[c_0_132])). 0.51/0.73 cnf(c_0_136, plain, (axiom_m10), inference(split_conjunct,[status(thm)],[s1_0_m10_axiom_m10])). 0.51/0.73 fof(c_0_137, plain, ![X89]:((~is_a_theorem(implies(possibly(esk37_0),necessarily(possibly(esk37_0))))|axiom_5)&(~axiom_5|is_a_theorem(implies(possibly(X89),necessarily(possibly(X89)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])])). 0.51/0.73 fof(c_0_138, negated_conjecture, ~axiom_5, inference(fof_simplification,[status(thm)],[c_0_133])). 0.51/0.73 cnf(c_0_139, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(strict_implies(X1,X2))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_134, c_0_65])). 0.51/0.73 cnf(c_0_140, plain, (is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_135, c_0_136])])). 0.51/0.73 cnf(c_0_141, plain, (axiom_5|~is_a_theorem(implies(possibly(esk37_0),necessarily(possibly(esk37_0))))), inference(split_conjunct,[status(thm)],[c_0_137])). 0.51/0.73 cnf(c_0_142, negated_conjecture, (~axiom_5), inference(split_conjunct,[status(thm)],[c_0_138])). 0.51/0.73 cnf(c_0_143, plain, (is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_139, c_0_140])). 0.51/0.73 cnf(c_0_144, plain, (is_a_theorem(strict_implies(strict_equiv(X1,X2),strict_equiv(X2,X1)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_38]), c_0_38])). 0.51/0.73 cnf(c_0_145, plain, (~is_a_theorem(implies(possibly(esk37_0),necessarily(possibly(esk37_0))))), inference(sr,[status(thm)],[c_0_141, c_0_142])). 0.51/0.73 cnf(c_0_146, plain, (is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))), inference(spm,[status(thm)],[c_0_143, c_0_144])). 0.51/0.73 cnf(c_0_147, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_145, c_0_146])]), ['proof']). 0.51/0.73 # SZS output end CNFRefutation 0.51/0.73 # Proof object total steps : 148 0.51/0.73 # Proof object clause steps : 104 0.51/0.73 # Proof object formula steps : 44 0.51/0.73 # Proof object conjectures : 4 0.51/0.73 # Proof object clause conjectures : 1 0.51/0.73 # Proof object formula conjectures : 3 0.51/0.73 # Proof object initial clauses used : 28 0.51/0.73 # Proof object initial formulas used : 28 0.51/0.73 # Proof object generating inferences : 55 0.51/0.73 # Proof object simplifying inferences : 70 0.51/0.73 # Training examples: 0 positive, 0 negative 0.51/0.73 # Parsed axioms : 52 0.51/0.73 # Removed by relevancy pruning/SinE : 0 0.51/0.73 # Initial clauses : 81 0.51/0.73 # Removed in clause preprocessing : 0 0.51/0.73 # Initial clauses in saturation : 81 0.51/0.73 # Processed clauses : 3659 0.51/0.73 # ...of these trivial : 234 0.51/0.73 # ...subsumed : 2495 0.51/0.73 # ...remaining for further processing : 930 0.51/0.73 # Other redundant clauses eliminated : 0 0.51/0.73 # Clauses deleted for lack of memory : 0 0.51/0.73 # Backward-subsumed : 63 0.51/0.73 # Backward-rewritten : 274 0.51/0.73 # Generated clauses : 28771 0.51/0.73 # ...of the previous two non-trivial : 27093 0.51/0.73 # Contextual simplify-reflections : 0 0.51/0.73 # Paramodulations : 28771 0.51/0.73 # Factorizations : 0 0.51/0.73 # Equation resolutions : 0 0.51/0.73 # Propositional unsat checks : 0 0.51/0.73 # Propositional check models : 0 0.51/0.73 # Propositional check unsatisfiable : 0 0.51/0.73 # Propositional clauses : 0 0.51/0.73 # Propositional clauses after purity: 0 0.51/0.73 # Propositional unsat core size : 0 0.51/0.73 # Propositional preprocessing time : 0.000 0.51/0.73 # Propositional encoding time : 0.000 0.51/0.73 # Propositional solver time : 0.000 0.51/0.73 # Success case prop preproc time : 0.000 0.51/0.73 # Success case prop encoding time : 0.000 0.51/0.73 # Success case prop solver time : 0.000 0.51/0.73 # Current number of processed clauses : 529 0.51/0.73 # Positive orientable unit clauses : 150 0.51/0.73 # Positive unorientable unit clauses: 8 0.51/0.73 # Negative unit clauses : 3 0.51/0.73 # Non-unit-clauses : 368 0.51/0.73 # Current number of unprocessed clauses: 22856 0.51/0.73 # ...number of literals in the above : 47974 0.51/0.73 # Current number of archived formulas : 0 0.51/0.73 # Current number of archived clauses : 401 0.51/0.73 # Clause-clause subsumption calls (NU) : 62193 0.51/0.73 # Rec. Clause-clause subsumption calls : 54247 0.51/0.73 # Non-unit clause-clause subsumptions : 2475 0.51/0.73 # Unit Clause-clause subsumption calls : 2991 0.51/0.73 # Rewrite failures with RHS unbound : 0 0.51/0.73 # BW rewrite match attempts : 525 0.51/0.73 # BW rewrite match successes : 187 0.51/0.73 # Condensation attempts : 0 0.51/0.73 # Condensation successes : 0 0.51/0.73 # Termbank termtop insertions : 380141 0.51/0.73 0.51/0.73 # ------------------------------------------------- 0.51/0.73 # User time : 0.417 s 0.51/0.73 # System time : 0.017 s 0.51/0.73 # Total time : 0.434 s 0.51/0.73 # Maximum resident set size: 1640 pages 0.51/0.73 EOF