0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.10 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.10/0.31 % Computer : n016.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Thu Jul 2 08:24:12 EDT 2020 0.10/0.31 % CPUTime : 0.10/0.31 # Version: 2.5pre002 0.10/0.31 # No SInE strategy applied 0.10/0.31 # Trying AutoSched0 for 59 seconds 0.35/0.53 # AutoSched0-Mode selected heuristic G_E___110_C45_F1_PI_SE_CS_SP_PS_S4S 0.35/0.53 # and selection function SelectNewComplexAHPNS. 0.35/0.53 # 0.35/0.53 # Preprocessing time : 0.028 s 0.35/0.53 # Presaturation interreduction done 0.35/0.53 0.35/0.53 # Proof found! 0.35/0.53 # SZS status Theorem 0.35/0.53 # SZS output start CNFRefutation 0.35/0.53 fof(def_false2, axiom, ?[X2]:(~(?[X8]:forallprefers(f7(X8),f7(X2)))&false2=phi(f7(X2))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_false2)). 0.35/0.53 fof(def_f7, axiom, ![X2]:lazy_impl(prop(X2),X2)=f7(X2), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_f7)). 0.35/0.53 fof(prop_true, axiom, ![X7]:(bool(X7)<=>true=prop(X7)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', prop_true)). 0.35/0.53 fof(def_phi, axiom, ![X7]:((phi(X7)=err&~(d(X7)))|(d(X7)&phi(X7)=X7)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_phi)). 0.35/0.53 fof(lazy_impl_axiom3, axiom, ![X1]:phi(X1)=lazy_impl(true,X1), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', lazy_impl_axiom3)). 0.35/0.53 fof(prop_false, axiom, ![X7]:(~(bool(X7))<=>prop(X7)=false), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', prop_false)). 0.35/0.53 fof(lazy_impl_axiom2, axiom, ![X1]:true=lazy_impl(false,X1), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', lazy_impl_axiom2)). 0.35/0.53 fof(def_forallprefers, axiom, ![X7, X9]:(forallprefers(X7,X9)<=>((~(d(X7))&d(X9))|(X9=true&X7=false)|(((d(X9)&d(X7))&~(bool(X7)))&bool(X9)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_forallprefers)). 0.35/0.53 fof(def_bool, axiom, ![X7]:((false=X7|X7=true)<=>bool(X7)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_bool)). 0.35/0.53 fof(false_true_err_in_d, axiom, ((d(true)&d(false))&d(err)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', false_true_err_in_d)). 0.35/0.53 fof(lazy_impl_axiom1, axiom, ![X4, X1]:(lazy_impl(X4,X1)=phi(X4)<=~(bool(X4))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', lazy_impl_axiom1)). 0.35/0.53 fof(not1_not2, conjecture, ![X2]:not2(X2)=not1(X2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', not1_not2)). 0.35/0.53 fof(def_not2, axiom, ![X2]:impl(X2,false2)=not2(X2), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', def_not2)). 0.35/0.53 fof(not1_axiom1, axiom, ![X4]:(~(bool(X4))=>not1(X4)=phi(X4)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', not1_axiom1)). 0.35/0.53 fof(impl_axiom1, axiom, ![X4, X1]:(phi(X4)=impl(X4,X1)<=~(bool(X4))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', impl_axiom1)). 0.35/0.53 fof(impl_axiom2, axiom, ![X4, X1]:((~(bool(X1))&bool(X4))=>impl(X4,X1)=phi(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', impl_axiom2)). 0.35/0.53 fof(distinct_false_true_err, axiom, ((false!=true&err!=true)&false!=err), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', distinct_false_true_err)). 0.35/0.53 fof(not1_axiom3, axiom, false=not1(true), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', not1_axiom3)). 0.35/0.53 fof(impl_axiom4, axiom, ![X1]:(bool(X1)=>impl(true,X1)=X1), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', impl_axiom4)). 0.35/0.53 fof(not1_axiom2, axiom, not1(false)=true, file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', not1_axiom2)). 0.35/0.53 fof(impl_axiom3, axiom, ![X1]:(bool(X1)=>true=impl(false,X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV012+0.ax', impl_axiom3)). 0.35/0.53 fof(c_0_21, plain, ![X37]:(~forallprefers(f7(X37),f7(esk2_0))&false2=phi(f7(esk2_0))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_false2])])])])). 0.35/0.53 fof(c_0_22, plain, ![X61]:lazy_impl(prop(X61),X61)=f7(X61), inference(variable_rename,[status(thm)],[def_f7])). 0.35/0.53 cnf(c_0_23, plain, (~forallprefers(f7(X1),f7(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.35/0.53 cnf(c_0_24, plain, (lazy_impl(prop(X1),X1)=f7(X1)), inference(split_conjunct,[status(thm)],[c_0_22])). 0.35/0.53 fof(c_0_25, plain, ![X85]:((~bool(X85)|true=prop(X85))&(true!=prop(X85)|bool(X85))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[prop_true])])). 0.35/0.53 fof(c_0_26, plain, ![X48]:(((d(X48)|phi(X48)=err)&(phi(X48)=X48|phi(X48)=err))&((d(X48)|~d(X48))&(phi(X48)=X48|~d(X48)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[def_phi])])])). 0.35/0.53 fof(c_0_27, plain, ![X12]:phi(X12)=lazy_impl(true,X12), inference(variable_rename,[status(thm)],[lazy_impl_axiom3])). 0.35/0.53 cnf(c_0_28, plain, (~forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(esk2_0),esk2_0))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_24]), c_0_24])). 0.35/0.53 cnf(c_0_29, plain, (true=prop(X1)|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_25])). 0.35/0.53 cnf(c_0_30, plain, (phi(X1)=X1|~d(X1)), inference(split_conjunct,[status(thm)],[c_0_26])). 0.35/0.53 cnf(c_0_31, plain, (phi(X1)=lazy_impl(true,X1)), inference(split_conjunct,[status(thm)],[c_0_27])). 0.35/0.53 cnf(c_0_32, plain, (false2=phi(f7(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.35/0.53 cnf(c_0_33, plain, (~forallprefers(lazy_impl(true,X1),lazy_impl(prop(esk2_0),esk2_0))|~bool(X1)), inference(spm,[status(thm)],[c_0_28, c_0_29])). 0.35/0.53 cnf(c_0_34, plain, (lazy_impl(true,X1)=X1|~d(X1)), inference(rw,[status(thm)],[c_0_30, c_0_31])). 0.35/0.53 fof(c_0_35, plain, ![X29]:((bool(X29)|prop(X29)=false)&(prop(X29)!=false|~bool(X29))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[prop_false])])])). 0.35/0.53 fof(c_0_36, plain, ![X49]:true=lazy_impl(false,X49), inference(variable_rename,[status(thm)],[lazy_impl_axiom2])). 0.35/0.53 fof(c_0_37, plain, ![X46, X47]:(((((((d(X47)|(X47=true|~d(X46))|~forallprefers(X46,X47))&(d(X46)|(X47=true|~d(X46))|~forallprefers(X46,X47)))&(~bool(X46)|(X47=true|~d(X46))|~forallprefers(X46,X47)))&(bool(X47)|(X47=true|~d(X46))|~forallprefers(X46,X47)))&((((d(X47)|(X46=false|~d(X46))|~forallprefers(X46,X47))&(d(X46)|(X46=false|~d(X46))|~forallprefers(X46,X47)))&(~bool(X46)|(X46=false|~d(X46))|~forallprefers(X46,X47)))&(bool(X47)|(X46=false|~d(X46))|~forallprefers(X46,X47))))&(((((d(X47)|(X47=true|d(X47))|~forallprefers(X46,X47))&(d(X46)|(X47=true|d(X47))|~forallprefers(X46,X47)))&(~bool(X46)|(X47=true|d(X47))|~forallprefers(X46,X47)))&(bool(X47)|(X47=true|d(X47))|~forallprefers(X46,X47)))&((((d(X47)|(X46=false|d(X47))|~forallprefers(X46,X47))&(d(X46)|(X46=false|d(X47))|~forallprefers(X46,X47)))&(~bool(X46)|(X46=false|d(X47))|~forallprefers(X46,X47)))&(bool(X47)|(X46=false|d(X47))|~forallprefers(X46,X47)))))&(((d(X46)|~d(X47)|forallprefers(X46,X47))&(X47!=true|X46!=false|forallprefers(X46,X47)))&(~d(X47)|~d(X46)|bool(X46)|~bool(X47)|forallprefers(X46,X47)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[def_forallprefers])])])])). 0.35/0.53 fof(c_0_38, plain, ![X78]:(((false!=X78|bool(X78))&(X78!=true|bool(X78)))&(~bool(X78)|(false=X78|X78=true))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[def_bool])])])). 0.35/0.53 cnf(c_0_39, plain, (false2=lazy_impl(true,lazy_impl(prop(esk2_0),esk2_0))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32, c_0_31]), c_0_24])). 0.35/0.53 cnf(c_0_40, plain, (~d(X1)|~forallprefers(X1,lazy_impl(prop(esk2_0),esk2_0))|~bool(X1)), inference(spm,[status(thm)],[c_0_33, c_0_34])). 0.35/0.53 cnf(c_0_41, plain, (bool(X1)|prop(X1)=false), inference(split_conjunct,[status(thm)],[c_0_35])). 0.35/0.53 cnf(c_0_42, plain, (true=lazy_impl(false,X1)), inference(split_conjunct,[status(thm)],[c_0_36])). 0.35/0.53 cnf(c_0_43, plain, (forallprefers(X2,X1)|X1!=true|X2!=false), inference(split_conjunct,[status(thm)],[c_0_37])). 0.35/0.53 cnf(c_0_44, plain, (bool(X1)|false!=X1), inference(split_conjunct,[status(thm)],[c_0_38])). 0.35/0.53 cnf(c_0_45, plain, (~forallprefers(false2,lazy_impl(prop(esk2_0),esk2_0))|~bool(lazy_impl(prop(esk2_0),esk2_0))), inference(spm,[status(thm)],[c_0_33, c_0_39])). 0.35/0.53 cnf(c_0_46, plain, (bool(esk2_0)|~d(X1)|~forallprefers(X1,true)|~bool(X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42])). 0.35/0.53 cnf(c_0_47, plain, (forallprefers(false,true)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_43])])). 0.35/0.53 cnf(c_0_48, plain, (d(false)), inference(split_conjunct,[status(thm)],[false_true_err_in_d])). 0.35/0.53 cnf(c_0_49, plain, (bool(false)), inference(er,[status(thm)],[c_0_44])). 0.35/0.53 fof(c_0_50, plain, ![X21, X22]:(bool(X21)|lazy_impl(X21,X22)=phi(X21)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[lazy_impl_axiom1])])])). 0.35/0.53 cnf(c_0_51, plain, (~forallprefers(false2,lazy_impl(true,esk2_0))|~bool(lazy_impl(true,esk2_0))|~bool(esk2_0)), inference(spm,[status(thm)],[c_0_45, c_0_29])). 0.35/0.53 cnf(c_0_52, plain, (bool(esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_47]), c_0_48]), c_0_49])])). 0.35/0.53 cnf(c_0_53, plain, (bool(X1)|lazy_impl(X1,X2)=phi(X1)), inference(split_conjunct,[status(thm)],[c_0_50])). 0.35/0.53 cnf(c_0_54, plain, (~forallprefers(false2,lazy_impl(true,esk2_0))|~bool(lazy_impl(true,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51, c_0_52])])). 0.35/0.53 cnf(c_0_55, plain, (false=X1|X1=true|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_38])). 0.35/0.53 cnf(c_0_56, plain, (lazy_impl(X1,X2)=lazy_impl(true,X1)|bool(X1)), inference(rw,[status(thm)],[c_0_53, c_0_31])). 0.35/0.53 cnf(c_0_57, plain, (phi(X1)=X1|phi(X1)=err), inference(split_conjunct,[status(thm)],[c_0_26])). 0.35/0.53 cnf(c_0_58, plain, (~d(esk2_0)|~forallprefers(false2,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_34]), c_0_52])])). 0.35/0.53 cnf(c_0_59, plain, (esk2_0=false|esk2_0=true), inference(spm,[status(thm)],[c_0_55, c_0_52])). 0.35/0.53 cnf(c_0_60, plain, (d(true)), inference(split_conjunct,[status(thm)],[false_true_err_in_d])). 0.35/0.53 cnf(c_0_61, plain, (bool(X2)|forallprefers(X2,X1)|~d(X1)|~d(X2)|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_37])). 0.35/0.53 cnf(c_0_62, plain, (d(X1)|forallprefers(X1,X2)|~d(X2)), inference(split_conjunct,[status(thm)],[c_0_37])). 0.35/0.53 cnf(c_0_63, plain, (bool(X1)|X1!=true), inference(split_conjunct,[status(thm)],[c_0_38])). 0.35/0.53 fof(c_0_64, negated_conjecture, ~(![X2]:not2(X2)=not1(X2)), inference(assume_negation,[status(cth)],[not1_not2])). 0.35/0.53 cnf(c_0_65, plain, (~forallprefers(lazy_impl(true,prop(X1)),lazy_impl(prop(esk2_0),esk2_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_56]), c_0_33])). 0.35/0.53 cnf(c_0_66, plain, (lazy_impl(true,X1)=X1|lazy_impl(true,X1)=err), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57, c_0_31]), c_0_31])). 0.35/0.53 cnf(c_0_67, plain, (esk2_0=false|~forallprefers(false2,true)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_59]), c_0_60])])). 0.35/0.53 cnf(c_0_68, plain, (forallprefers(X1,X2)|bool(X1)|~d(X2)|~bool(X2)), inference(csr,[status(thm)],[c_0_61, c_0_62])). 0.35/0.53 cnf(c_0_69, plain, (bool(true)), inference(er,[status(thm)],[c_0_63])). 0.35/0.53 fof(c_0_70, negated_conjecture, not2(esk8_0)!=not1(esk8_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])])])). 0.35/0.53 fof(c_0_71, plain, ![X77]:impl(X77,false2)=not2(X77), inference(variable_rename,[status(thm)],[def_not2])). 0.35/0.53 fof(c_0_72, plain, ![X17]:(bool(X17)|not1(X17)=phi(X17)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[not1_axiom1])])])). 0.35/0.53 fof(c_0_73, plain, ![X62, X63]:(bool(X62)|phi(X62)=impl(X62,X63)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[impl_axiom1])])])). 0.35/0.53 cnf(c_0_74, plain, (~forallprefers(lazy_impl(true,prop(X1)),lazy_impl(true,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65, c_0_29]), c_0_52])])). 0.35/0.53 cnf(c_0_75, plain, (lazy_impl(prop(esk2_0),esk2_0)=false2|false2=err), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_66]), c_0_39])). 0.35/0.53 cnf(c_0_76, plain, (esk2_0=false|bool(false2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67, c_0_68]), c_0_60]), c_0_69])])). 0.35/0.53 cnf(c_0_77, negated_conjecture, (not2(esk8_0)!=not1(esk8_0)), inference(split_conjunct,[status(thm)],[c_0_70])). 0.35/0.53 cnf(c_0_78, plain, (impl(X1,false2)=not2(X1)), inference(split_conjunct,[status(thm)],[c_0_71])). 0.35/0.53 cnf(c_0_79, plain, (bool(X1)|not1(X1)=phi(X1)), inference(split_conjunct,[status(thm)],[c_0_72])). 0.35/0.53 cnf(c_0_80, plain, (bool(X1)|phi(X1)=impl(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_73])). 0.35/0.53 cnf(c_0_81, plain, (~d(prop(X1))|~forallprefers(prop(X1),lazy_impl(true,esk2_0))), inference(spm,[status(thm)],[c_0_74, c_0_34])). 0.35/0.53 cnf(c_0_82, plain, (lazy_impl(true,esk2_0)=false2|false2=err|~bool(esk2_0)), inference(spm,[status(thm)],[c_0_75, c_0_29])). 0.35/0.53 cnf(c_0_83, plain, (esk2_0=false|false2=false|false2=true), inference(spm,[status(thm)],[c_0_55, c_0_76])). 0.35/0.53 cnf(c_0_84, negated_conjecture, (impl(esk8_0,false2)!=not1(esk8_0)), inference(rw,[status(thm)],[c_0_77, c_0_78])). 0.35/0.53 cnf(c_0_85, plain, (not1(X1)=lazy_impl(true,X1)|bool(X1)), inference(rw,[status(thm)],[c_0_79, c_0_31])). 0.35/0.53 cnf(c_0_86, plain, (lazy_impl(true,X1)=impl(X1,X2)|bool(X1)), inference(rw,[status(thm)],[c_0_80, c_0_31])). 0.35/0.53 cnf(c_0_87, plain, (bool(X1)|~forallprefers(false,lazy_impl(true,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81, c_0_41]), c_0_48])])). 0.35/0.53 cnf(c_0_88, plain, (lazy_impl(true,esk2_0)=false2|false2=err), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82, c_0_52])])). 0.35/0.53 cnf(c_0_89, plain, (false2=true|false2=false|~forallprefers(false2,false)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_83]), c_0_48])])). 0.35/0.53 fof(c_0_90, plain, ![X34, X35]:(bool(X35)|~bool(X34)|impl(X34,X35)=phi(X35)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[impl_axiom2])])])). 0.35/0.53 cnf(c_0_91, negated_conjecture, (bool(esk8_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84, c_0_85]), c_0_86])). 0.35/0.53 cnf(c_0_92, plain, (false2=err|bool(X1)|~forallprefers(false,false2)), inference(spm,[status(thm)],[c_0_87, c_0_88])). 0.35/0.53 cnf(c_0_93, plain, (false2=false|false2=true), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89, c_0_68]), c_0_48]), c_0_49])]), c_0_55])). 0.35/0.53 cnf(c_0_94, plain, (err!=true), inference(split_conjunct,[status(thm)],[distinct_false_true_err])). 0.35/0.53 cnf(c_0_95, plain, (bool(X1)|impl(X2,X1)=phi(X1)|~bool(X2)), inference(split_conjunct,[status(thm)],[c_0_90])). 0.35/0.53 cnf(c_0_96, negated_conjecture, (esk8_0=false|esk8_0=true), inference(spm,[status(thm)],[c_0_55, c_0_91])). 0.35/0.53 cnf(c_0_97, plain, (false=not1(true)), inference(split_conjunct,[status(thm)],[not1_axiom3])). 0.35/0.53 fof(c_0_98, plain, ![X16]:(~bool(X16)|impl(true,X16)=X16), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom4])])). 0.35/0.53 cnf(c_0_99, plain, (false2=false|bool(X1)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92, c_0_93]), c_0_47])]), c_0_94])). 0.35/0.53 cnf(c_0_100, plain, (impl(X2,X1)=lazy_impl(true,X1)|bool(X1)|~bool(X2)), inference(rw,[status(thm)],[c_0_95, c_0_31])). 0.35/0.53 cnf(c_0_101, negated_conjecture, (esk8_0=false|impl(true,false2)!=false), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84, c_0_96]), c_0_97])). 0.35/0.53 cnf(c_0_102, plain, (impl(true,X1)=X1|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_98])). 0.35/0.53 cnf(c_0_103, plain, (lazy_impl(true,err)=err), inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_66])])). 0.35/0.53 cnf(c_0_104, plain, (false2=false|false=X1|X1=true), inference(spm,[status(thm)],[c_0_55, c_0_99])). 0.35/0.53 cnf(c_0_105, plain, (false!=err), inference(split_conjunct,[status(thm)],[distinct_false_true_err])). 0.35/0.53 cnf(c_0_106, plain, (impl(X1,X2)=X2|bool(X2)|~d(X2)|~bool(X1)), inference(spm,[status(thm)],[c_0_34, c_0_100])). 0.35/0.53 cnf(c_0_107, negated_conjecture, (esk8_0=false|false2!=false|~bool(false2)), inference(spm,[status(thm)],[c_0_101, c_0_102])). 0.35/0.53 cnf(c_0_108, plain, (false2=false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103, c_0_104]), c_0_103]), c_0_94]), c_0_105])). 0.35/0.53 cnf(c_0_109, negated_conjecture, (esk8_0=false|false2!=false|~d(false2)), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101, c_0_106]), c_0_69])]), c_0_107])). 0.35/0.53 cnf(c_0_110, negated_conjecture, (not1(esk8_0)!=impl(esk8_0,false)), inference(rw,[status(thm)],[c_0_84, c_0_108])). 0.35/0.53 cnf(c_0_111, negated_conjecture, (esk8_0=false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_109, c_0_108]), c_0_108]), c_0_48])])). 0.35/0.53 cnf(c_0_112, plain, (not1(false)=true), inference(split_conjunct,[status(thm)],[not1_axiom2])). 0.35/0.53 fof(c_0_113, plain, ![X30]:(~bool(X30)|true=impl(false,X30)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[impl_axiom3])])). 0.35/0.53 cnf(c_0_114, negated_conjecture, (impl(false,false)!=true), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_110, c_0_111]), c_0_112]), c_0_111])). 0.35/0.53 cnf(c_0_115, plain, (true=impl(false,X1)|~bool(X1)), inference(split_conjunct,[status(thm)],[c_0_113])). 0.35/0.53 cnf(c_0_116, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114, c_0_115]), c_0_49])]), ['proof']). 0.35/0.53 # SZS output end CNFRefutation 0.35/0.53 # Proof object total steps : 117 0.35/0.53 # Proof object clause steps : 78 0.35/0.53 # Proof object formula steps : 39 0.35/0.53 # Proof object conjectures : 14 0.35/0.53 # Proof object clause conjectures : 11 0.35/0.53 # Proof object formula conjectures : 3 0.35/0.53 # Proof object initial clauses used : 29 0.35/0.53 # Proof object initial formulas used : 21 0.35/0.53 # Proof object generating inferences : 31 0.35/0.53 # Proof object simplifying inferences : 66 0.35/0.53 # Training examples: 0 positive, 0 negative 0.35/0.53 # Parsed axioms : 45 0.35/0.53 # Removed by relevancy pruning/SinE : 0 0.35/0.53 # Initial clauses : 99 0.35/0.53 # Removed in clause preprocessing : 19 0.35/0.53 # Initial clauses in saturation : 80 0.35/0.53 # Processed clauses : 910 0.35/0.53 # ...of these trivial : 3 0.35/0.53 # ...subsumed : 284 0.35/0.53 # ...remaining for further processing : 623 0.35/0.53 # Other redundant clauses eliminated : 8 0.35/0.53 # Clauses deleted for lack of memory : 0 0.35/0.53 # Backward-subsumed : 38 0.35/0.53 # Backward-rewritten : 105 0.35/0.53 # Generated clauses : 12871 0.35/0.53 # ...of the previous two non-trivial : 10088 0.35/0.53 # Contextual simplify-reflections : 10 0.35/0.53 # Paramodulations : 12854 0.35/0.53 # Factorizations : 11 0.35/0.53 # Equation resolutions : 8 0.35/0.53 # Propositional unsat checks : 0 0.35/0.53 # Propositional check models : 0 0.35/0.53 # Propositional check unsatisfiable : 0 0.35/0.53 # Propositional clauses : 0 0.35/0.53 # Propositional clauses after purity: 0 0.35/0.53 # Propositional unsat core size : 0 0.35/0.53 # Propositional preprocessing time : 0.000 0.35/0.53 # Propositional encoding time : 0.000 0.35/0.53 # Propositional solver time : 0.000 0.35/0.53 # Success case prop preproc time : 0.000 0.35/0.53 # Success case prop encoding time : 0.000 0.35/0.53 # Success case prop solver time : 0.000 0.35/0.53 # Current number of processed clauses : 412 0.35/0.53 # Positive orientable unit clauses : 18 0.35/0.53 # Positive unorientable unit clauses: 0 0.35/0.53 # Negative unit clauses : 27 0.35/0.53 # Non-unit-clauses : 367 0.35/0.53 # Current number of unprocessed clauses: 9310 0.35/0.53 # ...number of literals in the above : 32536 0.35/0.53 # Current number of archived formulas : 0 0.35/0.53 # Current number of archived clauses : 221 0.35/0.53 # Clause-clause subsumption calls (NU) : 11329 0.35/0.53 # Rec. Clause-clause subsumption calls : 7559 0.35/0.53 # Non-unit clause-clause subsumptions : 288 0.35/0.53 # Unit Clause-clause subsumption calls : 627 0.35/0.53 # Rewrite failures with RHS unbound : 0 0.35/0.53 # BW rewrite match attempts : 5 0.35/0.53 # BW rewrite match successes : 5 0.35/0.53 # Condensation attempts : 0 0.35/0.53 # Condensation successes : 0 0.35/0.53 # Termbank termtop insertions : 263059 0.35/0.53 0.35/0.53 # ------------------------------------------------- 0.35/0.53 # User time : 0.210 s 0.35/0.53 # System time : 0.010 s 0.35/0.53 # Total time : 0.220 s 0.35/0.53 # Maximum resident set size: 1632 pages 0.35/0.53 EOF