0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % 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.26 % Computer : n068.star.cs.uiowa.edu 0.03/0.26 % Model : x86_64 x86_64 0.03/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.26 % Memory : 32218.625MB 0.03/0.26 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.26 % CPULimit : 300 0.03/0.26 % DateTime : Fri Jul 13 14:52:40 CDT 2018 0.03/0.26 % CPUTime : 0.03/0.26 # Version: 2.2pre001 0.03/0.26 # No SInE strategy applied 0.03/0.26 # Trying AutoSched0 for 151 seconds 0.03/0.29 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S4S 0.03/0.29 # and selection function SelectNewComplexAHPNS. 0.03/0.29 # 0.03/0.29 # Preprocessing time : 0.013 s 0.03/0.29 0.03/0.29 # Proof found! 0.03/0.29 # SZS status Theorem 0.03/0.29 # SZS output start CNFRefutation 0.03/0.29 fof(something_not_n12, conjecture, ?[X1]:X1!=n12, file('/export/starexec/sandbox/benchmark/theBenchmark.p', something_not_n12)). 0.03/0.29 fof(less_entry_point_neg_pos, axiom, ![X1, X2, X3, X4]:((rdn_translate(X1,rdn_neg(X3))&rdn_translate(X2,rdn_pos(X4)))=>less(X1,X2)), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', less_entry_point_neg_pos)). 0.03/0.29 fof(rdnn28, axiom, rdn_translate(nn28,rdn_neg(rdn(rdnn(n8),rdnn(n2)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax', rdnn28)). 0.03/0.29 fof(less_property, axiom, ![X1, X2]:(less(X1,X2)<=>(X1!=X2&~(less(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax', less_property)). 0.03/0.29 fof(c_0_4, negated_conjecture, ~(?[X1]:X1!=n12), inference(assume_negation,[status(cth)],[something_not_n12])). 0.03/0.29 fof(c_0_5, negated_conjecture, ![X154]:X154=n12, inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])). 0.03/0.29 fof(c_0_6, plain, ![X33, X34, X35, X36]:(~rdn_translate(X33,rdn_neg(X35))|~rdn_translate(X34,rdn_pos(X36))|less(X33,X34)), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_neg_pos])])])])). 0.03/0.29 cnf(c_0_7, plain, (rdn_translate(nn28,rdn_neg(rdn(rdnn(n8),rdnn(n2))))), inference(split_conjunct,[status(thm)],[rdnn28])). 0.03/0.29 cnf(c_0_8, negated_conjecture, (X1=n12), inference(split_conjunct,[status(thm)],[c_0_5])). 0.03/0.29 fof(c_0_9, plain, ![X53, X54, X53, X54]:(((X53!=X54|~less(X53,X54))&(~less(X54,X53)|~less(X53,X54)))&(X53=X54|less(X54,X53)|less(X53,X54))), inference(distribute,[status(thm)],[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)],[less_property])])])])])])). 0.03/0.29 cnf(c_0_10, plain, (less(X1,X3)|~rdn_translate(X1,rdn_neg(X2))|~rdn_translate(X3,rdn_pos(X4))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.03/0.29 cnf(c_0_11, plain, (rdn_translate(nn28,n12)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8]), c_0_8]), c_0_8]), c_0_8])). 0.03/0.29 cnf(c_0_12, negated_conjecture, (X1=X2), inference(spm,[status(thm)],[c_0_8, c_0_8])). 0.03/0.29 cnf(c_0_13, plain, (X1!=X2|~less(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.03/0.29 cnf(c_0_14, plain, (less(X1,X2)|~rdn_translate(X2,n12)|~rdn_translate(X1,n12)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_8]), c_0_8])). 0.03/0.29 cnf(c_0_15, negated_conjecture, (rdn_translate(X1,n12)), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.03/0.29 cnf(c_0_16, plain, (~less(X1,X1)), inference(er,[status(thm)],[c_0_13])). 0.03/0.29 cnf(c_0_17, plain, (less(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15]), c_0_15])])). 0.03/0.29 cnf(c_0_18, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])]), ['proof']). 0.03/0.29 # SZS output end CNFRefutation 0.03/0.29 # Proof object total steps : 19 0.03/0.29 # Proof object clause steps : 11 0.03/0.29 # Proof object formula steps : 8 0.03/0.29 # Proof object conjectures : 6 0.03/0.29 # Proof object clause conjectures : 3 0.03/0.29 # Proof object formula conjectures : 3 0.03/0.29 # Proof object initial clauses used : 4 0.03/0.29 # Proof object initial formulas used : 4 0.03/0.29 # Proof object generating inferences : 2 0.03/0.29 # Proof object simplifying inferences : 12 0.03/0.29 # Training examples: 0 positive, 0 negative 0.03/0.29 # Parsed axioms : 402 0.03/0.29 # Removed by relevancy pruning/SinE : 0 0.03/0.29 # Initial clauses : 407 0.03/0.29 # Removed in clause preprocessing : 0 0.03/0.29 # Initial clauses in saturation : 407 0.03/0.29 # Processed clauses : 416 0.03/0.29 # ...of these trivial : 124 0.03/0.29 # ...subsumed : 6 0.03/0.29 # ...remaining for further processing : 286 0.03/0.29 # Other redundant clauses eliminated : 2 0.03/0.29 # Clauses deleted for lack of memory : 0 0.03/0.29 # Backward-subsumed : 6 0.03/0.29 # Backward-rewritten : 267 0.03/0.29 # Generated clauses : 2624 0.03/0.29 # ...of the previous two non-trivial : 2355 0.03/0.29 # Contextual simplify-reflections : 4 0.03/0.29 # Paramodulations : 2620 0.03/0.29 # Factorizations : 2 0.03/0.29 # Equation resolutions : 2 0.03/0.29 # Propositional unsat checks : 0 0.03/0.29 # Propositional check models : 0 0.03/0.29 # Propositional check unsatisfiable : 0 0.03/0.29 # Propositional clauses : 0 0.03/0.29 # Propositional clauses after purity: 0 0.03/0.29 # Propositional unsat core size : 0 0.03/0.29 # Current number of processed clauses : 11 0.03/0.29 # Positive orientable unit clauses : 8 0.03/0.29 # Positive unorientable unit clauses: 1 0.03/0.29 # Negative unit clauses : 0 0.03/0.29 # Non-unit-clauses : 2 0.03/0.29 # Current number of unprocessed clauses: 9 0.03/0.29 # ...number of literals in the above : 11 0.03/0.29 # Current number of archived formulas : 0 0.03/0.29 # Current number of archived clauses : 273 0.03/0.29 # Clause-clause subsumption calls (NU) : 285 0.03/0.29 # Rec. Clause-clause subsumption calls : 145 0.03/0.29 # Non-unit clause-clause subsumptions : 9 0.03/0.29 # Unit Clause-clause subsumption calls : 300 0.03/0.29 # Rewrite failures with RHS unbound : 517 0.03/0.29 # BW rewrite match attempts : 779 0.03/0.29 # BW rewrite match successes : 778 0.03/0.29 # Condensation attempts : 0 0.03/0.29 # Condensation successes : 0 0.03/0.29 # Termbank termtop insertions : 35121 0.03/0.29 0.03/0.29 # ------------------------------------------------- 0.03/0.29 # User time : 0.026 s 0.03/0.29 # System time : 0.006 s 0.03/0.29 # Total time : 0.032 s 0.03/0.29 # Maximum resident set size: 1928 pages 0.03/0.30 EOF