0.08/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.11 % 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.31 % Computer : n003.cluster.edu 0.09/0.31 % Model : x86_64 x86_64 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.31 % Memory : 8042.1875MB 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.31 % CPULimit : 960 0.09/0.31 % WCLimit : 120 0.09/0.31 % DateTime : Thu Jul 2 07:21:41 EDT 2020 0.14/0.31 % CPUTime : 0.14/0.31 # Version: 2.5pre002 0.14/0.31 # No SInE strategy applied 0.14/0.31 # Trying AutoSched0 for 59 seconds 0.14/0.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b 0.14/0.35 # and selection function SelectCQIPrecW. 0.14/0.35 # 0.14/0.35 # Preprocessing time : 0.026 s 0.14/0.35 # Presaturation interreduction done 0.14/0.35 0.14/0.35 # Proof found! 0.14/0.35 # SZS status Theorem 0.14/0.35 # SZS output start CNFRefutation 0.14/0.35 fof(nonzerosnononesexist, conjecture, ?[X7]:(![X14]:(![X16]:(~(r2(X16,X14))|~(r1(X16)))|X7!=X14)&![X33]:(~(r1(X33))|X7!=X33)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', nonzerosnononesexist)). 0.14/0.35 fof(axiom_1, axiom, ?[X18]:![X19]:((r1(X19)&X18=X19)|(X18!=X19&~(r1(X19)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_1)). 0.14/0.35 fof(axiom_3a, axiom, ![X37, X38]:(X38=X37|![X39]:(~(r2(X38,X39))|![X40]:(~(r2(X37,X40))|X40!=X39))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_3a)). 0.14/0.35 fof(axiom_2, axiom, ![X9]:?[X10]:![X11]:((X11=X10&r2(X9,X11))|(~(r2(X9,X11))&X11!=X10)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_2)). 0.14/0.35 fof(axiom_7a, axiom, ![X28, X29]:(~(r2(X28,X29))|![X30]:(X29!=X30|~(r1(X30)))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax', axiom_7a)). 0.14/0.35 fof(c_0_5, negated_conjecture, ~(?[X7]:(![X14]:(![X16]:(~(r2(X16,X14))|~(r1(X16)))|X7!=X14)&![X33]:(~(r1(X33))|X7!=X33))), inference(assume_negation,[status(cth)],[nonzerosnononesexist])). 0.14/0.35 fof(c_0_6, negated_conjecture, ![X87]:((((r1(esk23_1(X87))|r2(esk22_1(X87),esk21_1(X87)))&(X87=esk23_1(X87)|r2(esk22_1(X87),esk21_1(X87))))&((r1(esk23_1(X87))|r1(esk22_1(X87)))&(X87=esk23_1(X87)|r1(esk22_1(X87)))))&((r1(esk23_1(X87))|X87=esk21_1(X87))&(X87=esk23_1(X87)|X87=esk21_1(X87)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])])). 0.14/0.35 fof(c_0_7, plain, ![X62]:(((esk10_0!=X62|r1(X62))&(~r1(X62)|r1(X62)))&((esk10_0!=X62|esk10_0=X62)&(~r1(X62)|esk10_0=X62))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])])). 0.14/0.35 fof(c_0_8, plain, ![X80, X81, X82, X83]:(X81=X80|(~r2(X81,X82)|(~r2(X80,X83)|X83!=X82))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_3a])])])). 0.14/0.35 fof(c_0_9, plain, ![X52, X54]:(((~r2(X52,X54)|X54=esk5_1(X52))&(X54!=esk5_1(X52)|X54=esk5_1(X52)))&((~r2(X52,X54)|r2(X52,X54))&(X54!=esk5_1(X52)|r2(X52,X54)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_2])])])])). 0.14/0.35 cnf(c_0_10, negated_conjecture, (r1(esk23_1(X1))|r2(esk22_1(X1),esk21_1(X1))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.35 cnf(c_0_11, negated_conjecture, (r1(esk23_1(X1))|X1=esk21_1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.35 cnf(c_0_12, plain, (esk10_0=X1|~r1(X1)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.14/0.35 cnf(c_0_13, negated_conjecture, (r1(esk23_1(X1))|r1(esk22_1(X1))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.35 cnf(c_0_14, negated_conjecture, (X1=esk23_1(X1)|r2(esk22_1(X1),esk21_1(X1))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.35 cnf(c_0_15, negated_conjecture, (X1=esk23_1(X1)|X1=esk21_1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.35 cnf(c_0_16, negated_conjecture, (X1=esk23_1(X1)|r1(esk22_1(X1))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.14/0.35 fof(c_0_17, plain, ![X71, X72, X73]:(~r2(X71,X72)|(X72!=X73|~r1(X73))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_7a])])])). 0.14/0.35 cnf(c_0_18, plain, (X1=X2|~r2(X1,X3)|~r2(X2,X4)|X4!=X3), inference(split_conjunct,[status(thm)],[c_0_8])). 0.14/0.35 cnf(c_0_19, plain, (r2(X2,X1)|X1!=esk5_1(X2)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.14/0.35 cnf(c_0_20, negated_conjecture, (r2(esk22_1(X1),X1)|r1(esk23_1(X1))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.14/0.35 cnf(c_0_21, negated_conjecture, (esk22_1(X1)=esk10_0|r1(esk23_1(X1))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 0.14/0.35 cnf(c_0_22, negated_conjecture, (esk23_1(X1)=X1|r2(esk22_1(X1),X1)), inference(spm,[status(thm)],[c_0_14, c_0_15])). 0.14/0.35 cnf(c_0_23, negated_conjecture, (esk22_1(X1)=esk10_0|esk23_1(X1)=X1), inference(spm,[status(thm)],[c_0_12, c_0_16])). 0.14/0.35 cnf(c_0_24, plain, (~r2(X1,X2)|X2!=X3|~r1(X3)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.14/0.35 cnf(c_0_25, plain, (X1=X2|~r2(X2,X3)|~r2(X1,X3)), inference(er,[status(thm)],[c_0_18])). 0.14/0.35 cnf(c_0_26, plain, (r2(X1,esk5_1(X1))), inference(er,[status(thm)],[c_0_19])). 0.14/0.35 cnf(c_0_27, negated_conjecture, (r2(esk10_0,X1)|r1(esk23_1(X1))), inference(spm,[status(thm)],[c_0_20, c_0_21])). 0.14/0.35 cnf(c_0_28, negated_conjecture, (esk23_1(X1)=X1|r2(esk10_0,X1)), inference(spm,[status(thm)],[c_0_22, c_0_23])). 0.14/0.35 cnf(c_0_29, plain, (~r2(X1,X2)|~r1(X2)), inference(er,[status(thm)],[c_0_24])). 0.14/0.35 cnf(c_0_30, plain, (X1=X2|~r2(X1,esk5_1(X2))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 0.14/0.35 cnf(c_0_31, negated_conjecture, (r2(esk10_0,X1)|r1(X1)), inference(spm,[status(thm)],[c_0_27, c_0_28])). 0.14/0.35 cnf(c_0_32, plain, (~r1(esk5_1(X1))), inference(spm,[status(thm)],[c_0_29, c_0_26])). 0.14/0.35 cnf(c_0_33, plain, (r1(X1)|esk10_0!=X1), inference(split_conjunct,[status(thm)],[c_0_7])). 0.14/0.35 cnf(c_0_34, negated_conjecture, (esk10_0=X1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32])). 0.14/0.35 cnf(c_0_35, plain, (r1(esk10_0)), inference(er,[status(thm)],[c_0_33])). 0.14/0.35 cnf(c_0_36, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32, c_0_34]), c_0_35])]), ['proof']). 0.14/0.35 # SZS output end CNFRefutation 0.14/0.35 # Proof object total steps : 37 0.14/0.35 # Proof object clause steps : 26 0.14/0.35 # Proof object formula steps : 11 0.14/0.35 # Proof object conjectures : 17 0.14/0.35 # Proof object clause conjectures : 14 0.14/0.35 # Proof object formula conjectures : 3 0.14/0.35 # Proof object initial clauses used : 11 0.14/0.35 # Proof object initial formulas used : 5 0.14/0.35 # Proof object generating inferences : 10 0.14/0.35 # Proof object simplifying inferences : 8 0.14/0.35 # Training examples: 0 positive, 0 negative 0.14/0.35 # Parsed axioms : 12 0.14/0.35 # Removed by relevancy pruning/SinE : 0 0.14/0.35 # Initial clauses : 45 0.14/0.35 # Removed in clause preprocessing : 12 0.14/0.35 # Initial clauses in saturation : 33 0.14/0.35 # Processed clauses : 235 0.14/0.35 # ...of these trivial : 0 0.14/0.35 # ...subsumed : 77 0.14/0.35 # ...remaining for further processing : 158 0.14/0.35 # Other redundant clauses eliminated : 6 0.14/0.35 # Clauses deleted for lack of memory : 0 0.14/0.35 # Backward-subsumed : 3 0.14/0.35 # Backward-rewritten : 109 0.14/0.35 # Generated clauses : 1012 0.14/0.35 # ...of the previous two non-trivial : 518 0.14/0.35 # Contextual simplify-reflections : 1 0.14/0.35 # Paramodulations : 1006 0.14/0.35 # Factorizations : 0 0.14/0.35 # Equation resolutions : 6 0.14/0.35 # Propositional unsat checks : 0 0.14/0.35 # Propositional check models : 0 0.14/0.35 # Propositional check unsatisfiable : 0 0.14/0.35 # Propositional clauses : 0 0.14/0.35 # Propositional clauses after purity: 0 0.14/0.35 # Propositional unsat core size : 0 0.14/0.35 # Propositional preprocessing time : 0.000 0.14/0.35 # Propositional encoding time : 0.000 0.14/0.35 # Propositional solver time : 0.000 0.14/0.35 # Success case prop preproc time : 0.000 0.14/0.35 # Success case prop encoding time : 0.000 0.14/0.35 # Success case prop solver time : 0.000 0.14/0.35 # Current number of processed clauses : 7 0.14/0.35 # Positive orientable unit clauses : 3 0.14/0.35 # Positive unorientable unit clauses: 1 0.14/0.35 # Negative unit clauses : 0 0.14/0.35 # Non-unit-clauses : 3 0.14/0.35 # Current number of unprocessed clauses: 341 0.14/0.35 # ...number of literals in the above : 919 0.14/0.35 # Current number of archived formulas : 0 0.14/0.35 # Current number of archived clauses : 149 0.14/0.35 # Clause-clause subsumption calls (NU) : 1245 0.14/0.35 # Rec. Clause-clause subsumption calls : 1211 0.14/0.35 # Non-unit clause-clause subsumptions : 77 0.14/0.35 # Unit Clause-clause subsumption calls : 44 0.14/0.35 # Rewrite failures with RHS unbound : 3 0.14/0.35 # BW rewrite match attempts : 64 0.14/0.35 # BW rewrite match successes : 52 0.14/0.35 # Condensation attempts : 0 0.14/0.35 # Condensation successes : 0 0.14/0.35 # Termbank termtop insertions : 13026 0.14/0.35 0.14/0.35 # ------------------------------------------------- 0.14/0.35 # User time : 0.037 s 0.14/0.35 # System time : 0.003 s 0.14/0.35 # Total time : 0.040 s 0.14/0.35 # Maximum resident set size: 1624 pages 0.14/0.35 EOF