0.00/0.05 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.05 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.03/0.33 % Computer : n031.star.cs.uiowa.edu 0.03/0.33 % Model : x86_64 x86_64 0.03/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.33 % Memory : 32218.625MB 0.03/0.33 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.33 % CPULimit : 300 0.03/0.33 % DateTime : Sat Jul 14 04:16:44 CDT 2018 0.03/0.33 % CPUTime : 0.03/0.33 # Version: 2.2pre001 0.08/0.33 # No SInE strategy applied 0.08/0.33 # Trying AutoSched0 for 151 seconds 151.02/151.35 # AutoSched0-Mode selected heuristic G_E___208_C48_F1_AE_CS_SP_PS_S0Y 151.02/151.35 # and selection function SelectMaxLComplexAvoidPosPred. 151.02/151.35 # 151.02/151.35 # Preprocessing time : 0.010 s 151.02/151.35 # Presaturation interreduction done 151.11/151.47 # No success with AutoSched0 151.11/151.47 # Trying AutoSched1 for 73 seconds 151.19/151.54 # AutoSched1-Mode selected heuristic H_____047_C45_F1_AE_R8_CS_SP_S2S 151.19/151.54 # and selection function SelectNewComplexAHP. 151.19/151.54 # 151.19/151.54 # Preprocessing time : 0.012 s 151.19/151.54 151.19/151.54 # Proof found! 151.19/151.54 # SZS status Theorem 151.19/151.54 # SZS output start CNFRefutation 151.19/151.54 fof(t5_plus_FOL, conjecture, ![X1, X5, X6, X7, X8, X9, X10, X11, X12, X2, X13, X14, X15]:(((greater(X9,X10)|X9=X10)<=X14=X2)<=((((((((((((((((((organization(X1,X13)&organization(X5,X13))&organization(X1,X15))&class(X1,X7,X13))&reorganization_type(X5,X6,X13))&reorganization_free(X1,X14,X15))&greater(X12,X11))&(X15=X2=>greater(X9,X10)))&complexity(X5,X12,X13))&complexity(X1,X11,X13))&survival_chance(X5,X10,X2))&survival_chance(X1,X9,X2))&reorganization_type(X1,X6,X13))&reorganization(X5,X13,X15))&reorganization(X1,X13,X14))&survival_chance(X5,X8,X13))&survival_chance(X1,X8,X13))&class(X5,X7,X13))&organization(X5,X15))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', t5_plus_FOL)). 151.19/151.54 fof(a10_FOL, hypothesis, ![X1, X5, X6, X7, X11, X12, X13, X14, X15]:((((((((((((organization(X1,X13)&class(X5,X7,X13))&reorganization(X1,X13,X14))&complexity(X1,X11,X13))&complexity(X5,X12,X13))&greater(X12,X11))&reorganization_type(X5,X6,X13))&reorganization_type(X1,X6,X13))&reorganization(X5,X13,X15))&class(X1,X7,X13))&organization(X5,X15))&organization(X5,X13))=>greater(X15,X14)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', a10_FOL)). 151.19/151.54 fof(mp7, axiom, ![X1, X13, X14]:(reorganization(X1,X13,X14)=>greater(X14,X13)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mp7)). 151.19/151.54 fof(mp13, axiom, ![X1, X2, X3, X4]:(organization(X1,X2)<=(((organization(X1,X4)&greater(X2,X3))&greater(X4,X2))&organization(X1,X3))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mp13)). 151.19/151.54 fof(a11_FOL, hypothesis, ![X1, X5, X6, X7, X8, X9, X10, X11, X12, X13, X14, X15]:((X10=X9|greater(X9,X10))<=((((((((((((((((organization(X1,X14)&class(X1,X7,X13))&survival_chance(X1,X8,X13))&survival_chance(X5,X8,X13))&reorganization(X5,X13,X15))&reorganization_type(X1,X6,X13))&complexity(X1,X11,X13))&complexity(X5,X12,X13))&greater(X12,X11))&survival_chance(X5,X10,X14))&survival_chance(X1,X9,X14))&reorganization_type(X5,X6,X13))&reorganization(X1,X13,X14))&class(X5,X7,X13))&organization(X5,X14))&organization(X5,X13))&organization(X1,X13))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', a11_FOL)). 151.19/151.54 fof(c_0_5, negated_conjecture, ~(![X1, X5, X6, X7, X8, X9, X10, X11, X12, X2, X13, X14, X15]:(((greater(X9,X10)|X9=X10)<=X14=X2)<=((((((((((((((((((organization(X1,X13)&organization(X5,X13))&organization(X1,X15))&class(X1,X7,X13))&reorganization_type(X5,X6,X13))&reorganization_free(X1,X14,X15))&greater(X12,X11))&(X15=X2=>greater(X9,X10)))&complexity(X5,X12,X13))&complexity(X1,X11,X13))&survival_chance(X5,X10,X2))&survival_chance(X1,X9,X2))&reorganization_type(X1,X6,X13))&reorganization(X5,X13,X15))&reorganization(X1,X13,X14))&survival_chance(X5,X8,X13))&survival_chance(X1,X8,X13))&class(X5,X7,X13))&organization(X5,X15)))), inference(assume_negation,[status(cth)],[t5_plus_FOL])). 151.19/151.54 fof(c_0_6, hypothesis, ![X86, X87, X88, X89, X90, X91, X92, X93, X94]:(~organization(X86,X92)|~class(X87,X89,X92)|~reorganization(X86,X92,X93)|~complexity(X86,X90,X92)|~complexity(X87,X91,X92)|~greater(X91,X90)|~reorganization_type(X87,X88,X92)|~reorganization_type(X86,X88,X92)|~reorganization(X87,X92,X94)|~class(X86,X89,X92)|~organization(X87,X94)|~organization(X87,X92)|greater(X94,X93)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a10_FOL])])). 151.19/151.54 fof(c_0_7, negated_conjecture, (((((((((((((((((((organization(esk5_0,esk15_0)&organization(esk6_0,esk15_0))&organization(esk5_0,esk17_0))&class(esk5_0,esk8_0,esk15_0))&reorganization_type(esk6_0,esk7_0,esk15_0))&reorganization_free(esk5_0,esk16_0,esk17_0))&greater(esk13_0,esk12_0))&(esk17_0!=esk14_0|greater(esk10_0,esk11_0)))&complexity(esk6_0,esk13_0,esk15_0))&complexity(esk5_0,esk12_0,esk15_0))&survival_chance(esk6_0,esk11_0,esk14_0))&survival_chance(esk5_0,esk10_0,esk14_0))&reorganization_type(esk5_0,esk7_0,esk15_0))&reorganization(esk6_0,esk15_0,esk17_0))&reorganization(esk5_0,esk15_0,esk16_0))&survival_chance(esk6_0,esk9_0,esk15_0))&survival_chance(esk5_0,esk9_0,esk15_0))&class(esk6_0,esk8_0,esk15_0))&organization(esk6_0,esk17_0))&(esk16_0=esk14_0&(~greater(esk10_0,esk11_0)&esk10_0!=esk11_0))), inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])])). 151.19/151.54 cnf(c_0_8, hypothesis, (greater(X9,X5)|~organization(X1,X2)|~class(X3,X4,X2)|~reorganization(X1,X2,X5)|~complexity(X1,X6,X2)|~complexity(X3,X7,X2)|~greater(X7,X6)|~reorganization_type(X3,X8,X2)|~reorganization_type(X1,X8,X2)|~reorganization(X3,X2,X9)|~class(X1,X4,X2)|~organization(X3,X9)|~organization(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_6])). 151.19/151.54 cnf(c_0_9, negated_conjecture, (complexity(esk6_0,esk13_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_10, negated_conjecture, (organization(esk6_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_11, negated_conjecture, (greater(X1,X2)|~complexity(X3,X4,esk15_0)|~reorganization_type(esk6_0,X5,esk15_0)|~reorganization_type(X3,X5,esk15_0)|~reorganization(esk6_0,esk15_0,X1)|~reorganization(X3,esk15_0,X2)|~class(esk6_0,X6,esk15_0)|~class(X3,X6,esk15_0)|~greater(esk13_0,X4)|~organization(esk6_0,X1)|~organization(X3,esk15_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])])). 151.19/151.54 cnf(c_0_12, negated_conjecture, (organization(esk6_0,esk17_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_13, negated_conjecture, (reorganization(esk6_0,esk15_0,esk17_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_14, negated_conjecture, (greater(esk17_0,X1)|~complexity(X2,X3,esk15_0)|~reorganization_type(esk6_0,X4,esk15_0)|~reorganization_type(X2,X4,esk15_0)|~reorganization(X2,esk15_0,X1)|~class(esk6_0,X5,esk15_0)|~class(X2,X5,esk15_0)|~greater(esk13_0,X3)|~organization(X2,esk15_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])])). 151.19/151.54 cnf(c_0_15, negated_conjecture, (organization(esk5_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_16, negated_conjecture, (greater(esk17_0,X1)|~complexity(esk5_0,X2,esk15_0)|~reorganization_type(esk6_0,X3,esk15_0)|~reorganization_type(esk5_0,X3,esk15_0)|~reorganization(esk5_0,esk15_0,X1)|~class(esk6_0,X4,esk15_0)|~class(esk5_0,X4,esk15_0)|~greater(esk13_0,X2)), inference(spm,[status(thm)],[c_0_14, c_0_15])). 151.19/151.54 cnf(c_0_17, negated_conjecture, (greater(esk13_0,esk12_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_18, negated_conjecture, (complexity(esk5_0,esk12_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 fof(c_0_19, plain, ![X65, X66, X67]:(~reorganization(X65,X66,X67)|greater(X67,X66)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp7])])). 151.19/151.54 cnf(c_0_20, negated_conjecture, (reorganization(esk5_0,esk15_0,esk16_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_21, negated_conjecture, (esk16_0=esk14_0), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_22, negated_conjecture, (greater(esk17_0,X1)|~reorganization_type(esk6_0,X2,esk15_0)|~reorganization_type(esk5_0,X2,esk15_0)|~reorganization(esk5_0,esk15_0,X1)|~class(esk6_0,X3,esk15_0)|~class(esk5_0,X3,esk15_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])])). 151.19/151.54 cnf(c_0_23, negated_conjecture, (reorganization_type(esk6_0,esk7_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_24, negated_conjecture, (reorganization_type(esk5_0,esk7_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 fof(c_0_25, plain, ![X24, X25, X26, X27]:(~organization(X24,X27)|~greater(X25,X26)|~greater(X27,X25)|~organization(X24,X26)|organization(X24,X25)), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[mp13])])])])])). 151.19/151.54 cnf(c_0_26, plain, (greater(X3,X2)|~reorganization(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_19])). 151.19/151.54 cnf(c_0_27, negated_conjecture, (reorganization(esk5_0,esk15_0,esk14_0)), inference(rw,[status(thm)],[c_0_20, c_0_21])). 151.19/151.54 cnf(c_0_28, negated_conjecture, (greater(esk17_0,X1)|~reorganization(esk5_0,esk15_0,X1)|~class(esk6_0,X2,esk15_0)|~class(esk5_0,X2,esk15_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])])). 151.19/151.54 cnf(c_0_29, plain, (organization(X1,X3)|~organization(X1,X2)|~greater(X3,X4)|~greater(X2,X3)|~organization(X1,X4)), inference(split_conjunct,[status(thm)],[c_0_25])). 151.19/151.54 cnf(c_0_30, negated_conjecture, (greater(esk14_0,esk15_0)), inference(spm,[status(thm)],[c_0_26, c_0_27])). 151.19/151.54 cnf(c_0_31, negated_conjecture, (greater(esk17_0,esk14_0)|~class(esk6_0,X1,esk15_0)|~class(esk5_0,X1,esk15_0)), inference(spm,[status(thm)],[c_0_28, c_0_27])). 151.19/151.54 cnf(c_0_32, negated_conjecture, (class(esk6_0,esk8_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_33, negated_conjecture, (class(esk5_0,esk8_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 fof(c_0_34, hypothesis, ![X30, X31, X32, X33, X34, X35, X36, X37, X38, X39, X40, X41]:(~organization(X30,X40)|~class(X30,X33,X39)|~survival_chance(X30,X34,X39)|~survival_chance(X31,X34,X39)|~reorganization(X31,X39,X41)|~reorganization_type(X30,X32,X39)|~complexity(X30,X37,X39)|~complexity(X31,X38,X39)|~greater(X38,X37)|~survival_chance(X31,X36,X40)|~survival_chance(X30,X35,X40)|~reorganization_type(X31,X32,X39)|~reorganization(X30,X39,X40)|~class(X31,X33,X39)|~organization(X31,X40)|~organization(X31,X39)|~organization(X30,X39)|(X36=X35|greater(X35,X36))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[a11_FOL])])])])])). 151.19/151.54 cnf(c_0_35, negated_conjecture, (organization(X1,esk14_0)|~greater(X2,esk14_0)|~organization(X1,esk15_0)|~organization(X1,X2)), inference(spm,[status(thm)],[c_0_29, c_0_30])). 151.19/151.54 cnf(c_0_36, negated_conjecture, (greater(esk17_0,esk14_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_33])])). 151.19/151.54 cnf(c_0_37, hypothesis, (X11=X12|greater(X12,X11)|~organization(X1,X2)|~class(X1,X3,X4)|~survival_chance(X1,X5,X4)|~survival_chance(X6,X5,X4)|~reorganization(X6,X4,X7)|~reorganization_type(X1,X8,X4)|~complexity(X1,X9,X4)|~complexity(X6,X10,X4)|~greater(X10,X9)|~survival_chance(X6,X11,X2)|~survival_chance(X1,X12,X2)|~reorganization_type(X6,X8,X4)|~reorganization(X1,X4,X2)|~class(X6,X3,X4)|~organization(X6,X2)|~organization(X6,X4)|~organization(X1,X4)), inference(split_conjunct,[status(thm)],[c_0_34])). 151.19/151.54 cnf(c_0_38, negated_conjecture, (organization(X1,esk14_0)|~organization(X1,esk15_0)|~organization(X1,esk17_0)), inference(spm,[status(thm)],[c_0_35, c_0_36])). 151.19/151.54 cnf(c_0_39, negated_conjecture, (X1=X2|greater(X2,X1)|~complexity(X3,X4,esk15_0)|~reorganization_type(esk6_0,X5,esk15_0)|~reorganization_type(X3,X5,esk15_0)|~reorganization(esk6_0,esk15_0,X6)|~reorganization(X3,esk15_0,X7)|~survival_chance(esk6_0,X8,esk15_0)|~survival_chance(esk6_0,X1,X7)|~survival_chance(X3,X8,esk15_0)|~survival_chance(X3,X2,X7)|~class(esk6_0,X9,esk15_0)|~class(X3,X9,esk15_0)|~greater(esk13_0,X4)|~organization(esk6_0,X7)|~organization(X3,esk15_0)|~organization(X3,X7)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_9]), c_0_10])])). 151.19/151.54 cnf(c_0_40, negated_conjecture, (organization(esk6_0,esk14_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_10]), c_0_12])])). 151.19/151.54 cnf(c_0_41, negated_conjecture, (organization(esk5_0,esk17_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_42, negated_conjecture, (X1=X2|greater(X2,X1)|~complexity(X3,X4,esk15_0)|~reorganization_type(esk6_0,X5,esk15_0)|~reorganization_type(X3,X5,esk15_0)|~reorganization(esk6_0,esk15_0,X6)|~reorganization(X3,esk15_0,esk14_0)|~survival_chance(esk6_0,X7,esk15_0)|~survival_chance(esk6_0,X1,esk14_0)|~survival_chance(X3,X7,esk15_0)|~survival_chance(X3,X2,esk14_0)|~class(esk6_0,X8,esk15_0)|~class(X3,X8,esk15_0)|~greater(esk13_0,X4)|~organization(X3,esk15_0)|~organization(X3,esk14_0)), inference(spm,[status(thm)],[c_0_39, c_0_40])). 151.19/151.54 cnf(c_0_43, negated_conjecture, (organization(esk5_0,esk14_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_15]), c_0_41])])). 151.19/151.54 cnf(c_0_44, negated_conjecture, (X1=X2|greater(X2,X1)|~complexity(esk5_0,X3,esk15_0)|~reorganization_type(esk6_0,X4,esk15_0)|~reorganization_type(esk5_0,X4,esk15_0)|~reorganization(esk6_0,esk15_0,X5)|~survival_chance(esk6_0,X6,esk15_0)|~survival_chance(esk6_0,X1,esk14_0)|~survival_chance(esk5_0,X6,esk15_0)|~survival_chance(esk5_0,X2,esk14_0)|~class(esk6_0,X7,esk15_0)|~class(esk5_0,X7,esk15_0)|~greater(esk13_0,X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_15]), c_0_27]), c_0_43])])). 151.19/151.54 cnf(c_0_45, negated_conjecture, (X1=X2|greater(X2,X1)|~reorganization_type(esk6_0,X3,esk15_0)|~reorganization_type(esk5_0,X3,esk15_0)|~reorganization(esk6_0,esk15_0,X4)|~survival_chance(esk6_0,X5,esk15_0)|~survival_chance(esk6_0,X1,esk14_0)|~survival_chance(esk5_0,X5,esk15_0)|~survival_chance(esk5_0,X2,esk14_0)|~class(esk6_0,X6,esk15_0)|~class(esk5_0,X6,esk15_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_17]), c_0_18])])). 151.19/151.54 cnf(c_0_46, negated_conjecture, (X1=X2|greater(X2,X1)|~reorganization(esk6_0,esk15_0,X3)|~survival_chance(esk6_0,X4,esk15_0)|~survival_chance(esk6_0,X1,esk14_0)|~survival_chance(esk5_0,X4,esk15_0)|~survival_chance(esk5_0,X2,esk14_0)|~class(esk6_0,X5,esk15_0)|~class(esk5_0,X5,esk15_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_23]), c_0_24])])). 151.19/151.54 cnf(c_0_47, negated_conjecture, (X1=X2|greater(X2,X1)|~survival_chance(esk6_0,X3,esk15_0)|~survival_chance(esk6_0,X1,esk14_0)|~survival_chance(esk5_0,X3,esk15_0)|~survival_chance(esk5_0,X2,esk14_0)|~class(esk6_0,X4,esk15_0)|~class(esk5_0,X4,esk15_0)), inference(spm,[status(thm)],[c_0_46, c_0_13])). 151.19/151.54 cnf(c_0_48, negated_conjecture, (survival_chance(esk6_0,esk9_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_49, negated_conjecture, (survival_chance(esk5_0,esk9_0,esk15_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_50, negated_conjecture, (X1=X2|greater(X2,X1)|~survival_chance(esk6_0,X1,esk14_0)|~survival_chance(esk5_0,X2,esk14_0)|~class(esk6_0,X3,esk15_0)|~class(esk5_0,X3,esk15_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_49])])). 151.19/151.54 cnf(c_0_51, negated_conjecture, (survival_chance(esk6_0,esk11_0,esk14_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_52, negated_conjecture, (esk11_0=X1|greater(X1,esk11_0)|~survival_chance(esk5_0,X1,esk14_0)|~class(esk6_0,X2,esk15_0)|~class(esk5_0,X2,esk15_0)), inference(spm,[status(thm)],[c_0_50, c_0_51])). 151.19/151.54 cnf(c_0_53, negated_conjecture, (survival_chance(esk5_0,esk10_0,esk14_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_54, negated_conjecture, (esk10_0!=esk11_0), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_55, negated_conjecture, (~greater(esk10_0,esk11_0)), inference(split_conjunct,[status(thm)],[c_0_7])). 151.19/151.54 cnf(c_0_56, negated_conjecture, (~class(esk6_0,X1,esk15_0)|~class(esk5_0,X1,esk15_0)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_54]), c_0_55])). 151.19/151.54 cnf(c_0_57, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_32]), c_0_33])]), ['proof']). 151.19/151.54 # SZS output end CNFRefutation 151.19/151.54 # Proof object total steps : 58 151.19/151.54 # Proof object clause steps : 47 151.19/151.54 # Proof object formula steps : 11 151.19/151.54 # Proof object conjectures : 46 151.19/151.54 # Proof object clause conjectures : 43 151.19/151.54 # Proof object formula conjectures : 3 151.19/151.54 # Proof object initial clauses used : 24 151.19/151.54 # Proof object initial formulas used : 5 151.19/151.54 # Proof object generating inferences : 22 151.19/151.54 # Proof object simplifying inferences : 30 151.19/151.54 # Training examples: 0 positive, 0 negative 151.19/151.54 # Parsed axioms : 13 151.19/151.54 # Removed by relevancy pruning/SinE : 0 151.19/151.54 # Initial clauses : 38 151.19/151.54 # Removed in clause preprocessing : 0 151.19/151.54 # Initial clauses in saturation : 38 151.19/151.54 # Processed clauses : 699 151.19/151.54 # ...of these trivial : 1 151.19/151.54 # ...subsumed : 180 151.19/151.54 # ...remaining for further processing : 518 151.19/151.54 # Other redundant clauses eliminated : 1 151.19/151.54 # Clauses deleted for lack of memory : 0 151.19/151.54 # Backward-subsumed : 14 151.19/151.54 # Backward-rewritten : 13 151.19/151.54 # Generated clauses : 977 151.19/151.54 # ...of the previous two non-trivial : 851 151.19/151.54 # Contextual simplify-reflections : 198 151.19/151.54 # Paramodulations : 976 151.19/151.54 # Factorizations : 0 151.19/151.54 # Equation resolutions : 1 151.19/151.54 # Propositional unsat checks : 0 151.19/151.54 # Propositional check models : 0 151.19/151.54 # Propositional check unsatisfiable : 0 151.19/151.54 # Propositional clauses : 0 151.19/151.54 # Propositional clauses after purity: 0 151.19/151.54 # Propositional unsat core size : 0 151.19/151.54 # Current number of processed clauses : 490 151.19/151.54 # Positive orientable unit clauses : 46 151.19/151.54 # Positive unorientable unit clauses: 0 151.19/151.54 # Negative unit clauses : 23 151.19/151.54 # Non-unit-clauses : 421 151.19/151.54 # Current number of unprocessed clauses: 178 151.19/151.54 # ...number of literals in the above : 971 151.19/151.54 # Current number of archived formulas : 0 151.19/151.54 # Current number of archived clauses : 27 151.19/151.54 # Clause-clause subsumption calls (NU) : 25782 151.19/151.54 # Rec. Clause-clause subsumption calls : 8961 151.19/151.54 # Non-unit clause-clause subsumptions : 341 151.19/151.54 # Unit Clause-clause subsumption calls : 324 151.19/151.54 # Rewrite failures with RHS unbound : 0 151.19/151.54 # BW rewrite match attempts : 2 151.19/151.54 # BW rewrite match successes : 2 151.19/151.54 # Condensation attempts : 0 151.19/151.54 # Condensation successes : 0 151.19/151.54 # Termbank termtop insertions : 33488 151.19/151.54 151.19/151.54 # ------------------------------------------------- 151.19/151.54 # User time : 149.930 s 151.19/151.54 # System time : 1.255 s 151.19/151.54 # Total time : 151.186 s 151.19/151.54 # Maximum resident set size: 1524 pages 151.19/151.54 EOF