0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s 0.12/0.34 % Computer : n006.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 180 0.12/0.34 % DateTime : Thu Aug 29 09:05:25 EDT 2019 0.12/0.34 % CPUTime : 0.12/0.34 # Version: 2.4_pre003 0.12/0.34 # No SInE strategy applied 0.12/0.34 # Trying AutoSched0 for 90 seconds 0.12/0.37 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I 0.12/0.37 # and selection function SelectCQArEqLast. 0.12/0.37 # 0.12/0.37 # Preprocessing time : 0.026 s 0.12/0.37 # Presaturation interreduction done 0.12/0.37 0.12/0.37 # Proof found! 0.12/0.37 # SZS status Theorem 0.12/0.37 # SZS output start CNFRefutation 0.12/0.37 fof(axiom_4a, axiom, ![X41]:?[X42]:(X42=X41&?[X43]:(r3(X41,X43,X42)&r1(X43))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_4a)). 0.12/0.37 fof(axiom_1, axiom, ?[X32]:![X33]:((X32=X33&r1(X33))|(~(r1(X33))&X33!=X32)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_1)). 0.12/0.37 fof(zeroplusoneeqone, conjecture, ?[X12]:(?[X17]:(?[X5]:(r2(X5,X17)&r1(X5))&?[X3]:(r3(X3,X17,X12)&r1(X3)))&?[X19]:(X19=X12&?[X18]:(r1(X18)&r2(X18,X19)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', zeroplusoneeqone)). 0.12/0.37 fof(axiom_3, axiom, ![X24, X25]:?[X26]:![X27]:((r3(X24,X25,X27)&X26=X27)|(~(r3(X24,X25,X27))&X27!=X26)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_3)). 0.12/0.37 fof(axiom_1a, axiom, ![X1, X2]:?[X3]:(?[X4]:(r2(X4,X3)&r3(X1,X2,X4))&?[X5]:(?[X6]:(r2(X2,X6)&r3(X1,X6,X5))&X3=X5)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_1a)). 0.12/0.37 fof(c_0_5, plain, ![X84]:(esk19_1(X84)=X84&(r3(X84,esk20_1(X84),esk19_1(X84))&r1(esk20_1(X84)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])])). 0.12/0.37 fof(c_0_6, plain, ![X76]:(((~r1(X76)|esk15_0=X76)&(X76!=esk15_0|esk15_0=X76))&((~r1(X76)|r1(X76))&(X76!=esk15_0|r1(X76)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])])). 0.12/0.37 cnf(c_0_7, plain, (r3(X1,esk20_1(X1),esk19_1(X1))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.12/0.37 cnf(c_0_8, plain, (esk19_1(X1)=X1), inference(split_conjunct,[status(thm)],[c_0_5])). 0.12/0.37 cnf(c_0_9, plain, (esk15_0=X1|~r1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.12/0.37 cnf(c_0_10, plain, (r1(esk20_1(X1))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.12/0.37 fof(c_0_11, negated_conjecture, ~(?[X12]:(?[X17]:(?[X5]:(r2(X5,X17)&r1(X5))&?[X3]:(r3(X3,X17,X12)&r1(X3)))&?[X19]:(X19=X12&?[X18]:(r1(X18)&r2(X18,X19))))), inference(assume_negation,[status(cth)],[zeroplusoneeqone])). 0.12/0.37 fof(c_0_12, plain, ![X67, X68, X70]:(((~r3(X67,X68,X70)|r3(X67,X68,X70))&(X70!=esk14_2(X67,X68)|r3(X67,X68,X70)))&((~r3(X67,X68,X70)|esk14_2(X67,X68)=X70)&(X70!=esk14_2(X67,X68)|esk14_2(X67,X68)=X70))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_3])])])])). 0.12/0.37 cnf(c_0_13, plain, (r3(X1,esk20_1(X1),X1)), inference(rw,[status(thm)],[c_0_7, c_0_8])). 0.12/0.37 cnf(c_0_14, plain, (esk20_1(X1)=esk15_0), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.12/0.37 fof(c_0_15, plain, ![X44, X45]:((r2(esk2_2(X44,X45),esk1_2(X44,X45))&r3(X44,X45,esk2_2(X44,X45)))&((r2(X45,esk4_2(X44,X45))&r3(X44,esk4_2(X44,X45),esk3_2(X44,X45)))&esk1_2(X44,X45)=esk3_2(X44,X45))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])])). 0.12/0.37 fof(c_0_16, negated_conjecture, ![X87, X88, X89, X90, X91, X92]:(~r2(X89,X88)|~r1(X89)|(~r3(X90,X88,X87)|~r1(X90))|(X91!=X87|(~r1(X92)|~r2(X92,X91)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])). 0.12/0.37 cnf(c_0_17, plain, (esk14_2(X1,X2)=X3|~r3(X1,X2,X3)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.12/0.37 cnf(c_0_18, plain, (r3(X1,esk15_0,X1)), inference(rw,[status(thm)],[c_0_13, c_0_14])). 0.12/0.37 cnf(c_0_19, plain, (r3(X1,X2,esk2_2(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.12/0.37 cnf(c_0_20, negated_conjecture, (~r2(X1,X2)|~r1(X1)|~r3(X3,X2,X4)|~r1(X3)|X5!=X4|~r1(X6)|~r2(X6,X5)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.12/0.37 cnf(c_0_21, plain, (r3(X1,esk4_2(X1,X2),esk3_2(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.12/0.37 cnf(c_0_22, plain, (esk1_2(X1,X2)=esk3_2(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_15])). 0.12/0.37 cnf(c_0_23, plain, (esk14_2(X1,esk15_0)=X1), inference(spm,[status(thm)],[c_0_17, c_0_18])). 0.12/0.37 cnf(c_0_24, plain, (esk14_2(X1,X2)=esk2_2(X1,X2)), inference(spm,[status(thm)],[c_0_17, c_0_19])). 0.12/0.37 cnf(c_0_25, negated_conjecture, (~r1(X1)|~r1(X2)|~r1(X3)|~r3(X2,X4,X5)|~r2(X1,X5)|~r2(X3,X4)), inference(er,[status(thm)],[c_0_20])). 0.12/0.37 cnf(c_0_26, plain, (r3(X1,esk4_2(X1,X2),esk1_2(X1,X2))), inference(rw,[status(thm)],[c_0_21, c_0_22])). 0.12/0.37 cnf(c_0_27, plain, (r2(esk2_2(X1,X2),esk1_2(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.12/0.37 cnf(c_0_28, plain, (esk2_2(X1,esk15_0)=X1), inference(rw,[status(thm)],[c_0_23, c_0_24])). 0.12/0.37 cnf(c_0_29, negated_conjecture, (~r1(X1)|~r1(X2)|~r1(X3)|~r2(X1,esk1_2(X2,X4))|~r2(X3,esk4_2(X2,X4))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 0.12/0.37 cnf(c_0_30, plain, (r2(X1,esk1_2(X1,esk15_0))), inference(spm,[status(thm)],[c_0_27, c_0_28])). 0.12/0.37 cnf(c_0_31, plain, (r1(X1)|X1!=esk15_0), inference(split_conjunct,[status(thm)],[c_0_6])). 0.12/0.37 cnf(c_0_32, negated_conjecture, (~r1(X1)|~r1(X2)|~r2(X2,esk4_2(X1,esk15_0))), inference(spm,[status(thm)],[c_0_29, c_0_30])). 0.12/0.37 cnf(c_0_33, plain, (r2(X1,esk4_2(X2,X1))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.12/0.37 cnf(c_0_34, plain, (r1(esk15_0)), inference(er,[status(thm)],[c_0_31])). 0.12/0.37 cnf(c_0_35, negated_conjecture, (~r1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34])])). 0.12/0.37 cnf(c_0_36, plain, ($false), inference(sr,[status(thm)],[c_0_34, c_0_35]), ['proof']). 0.12/0.37 # SZS output end CNFRefutation 0.12/0.37 # Proof object total steps : 37 0.12/0.37 # Proof object clause steps : 26 0.12/0.37 # Proof object formula steps : 11 0.12/0.37 # Proof object conjectures : 8 0.12/0.37 # Proof object clause conjectures : 5 0.12/0.37 # Proof object formula conjectures : 3 0.12/0.37 # Proof object initial clauses used : 12 0.12/0.37 # Proof object initial formulas used : 5 0.12/0.37 # Proof object generating inferences : 7 0.12/0.37 # Proof object simplifying inferences : 9 0.12/0.37 # Training examples: 0 positive, 0 negative 0.12/0.37 # Parsed axioms : 12 0.12/0.37 # Removed by relevancy pruning/SinE : 0 0.12/0.37 # Initial clauses : 40 0.12/0.37 # Removed in clause preprocessing : 12 0.12/0.37 # Initial clauses in saturation : 28 0.12/0.37 # Processed clauses : 121 0.12/0.37 # ...of these trivial : 0 0.12/0.37 # ...subsumed : 17 0.12/0.37 # ...remaining for further processing : 104 0.12/0.37 # Other redundant clauses eliminated : 7 0.12/0.37 # Clauses deleted for lack of memory : 0 0.12/0.37 # Backward-subsumed : 0 0.12/0.37 # Backward-rewritten : 18 0.12/0.37 # Generated clauses : 122 0.12/0.37 # ...of the previous two non-trivial : 117 0.12/0.37 # Contextual simplify-reflections : 0 0.12/0.37 # Paramodulations : 111 0.12/0.37 # Factorizations : 0 0.12/0.37 # Equation resolutions : 7 0.12/0.37 # Propositional unsat checks : 0 0.12/0.37 # Propositional check models : 0 0.12/0.37 # Propositional check unsatisfiable : 0 0.12/0.37 # Propositional clauses : 0 0.12/0.37 # Propositional clauses after purity: 0 0.12/0.37 # Propositional unsat core size : 0 0.12/0.37 # Propositional preprocessing time : 0.000 0.12/0.37 # Propositional encoding time : 0.000 0.12/0.37 # Propositional solver time : 0.000 0.12/0.37 # Success case prop preproc time : 0.000 0.12/0.37 # Success case prop encoding time : 0.000 0.12/0.37 # Success case prop solver time : 0.000 0.12/0.37 # Current number of processed clauses : 47 0.12/0.37 # Positive orientable unit clauses : 21 0.12/0.37 # Positive unorientable unit clauses: 0 0.12/0.37 # Negative unit clauses : 4 0.12/0.37 # Non-unit-clauses : 22 0.12/0.37 # Current number of unprocessed clauses: 42 0.12/0.37 # ...number of literals in the above : 95 0.12/0.37 # Current number of archived formulas : 0 0.12/0.37 # Current number of archived clauses : 54 0.12/0.37 # Clause-clause subsumption calls (NU) : 539 0.12/0.37 # Rec. Clause-clause subsumption calls : 177 0.12/0.37 # Non-unit clause-clause subsumptions : 11 0.12/0.37 # Unit Clause-clause subsumption calls : 92 0.12/0.37 # Rewrite failures with RHS unbound : 22 0.12/0.37 # BW rewrite match attempts : 37 0.12/0.37 # BW rewrite match successes : 21 0.12/0.37 # Condensation attempts : 0 0.12/0.37 # Condensation successes : 0 0.12/0.37 # Termbank termtop insertions : 2867 0.12/0.37 0.12/0.37 # ------------------------------------------------- 0.12/0.37 # User time : 0.030 s 0.12/0.37 # System time : 0.004 s 0.12/0.37 # Total time : 0.034 s 0.12/0.37 # Maximum resident set size: 1628 pages 0.12/0.37 EOF