0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/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.02/0.23 % Computer : n183.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:34:55 CDT 2018 0.02/0.23 % CPUTime : 0.02/0.24 # Version: 2.2pre001 0.02/0.24 # No SInE strategy applied 0.02/0.24 # Trying AutoSched0 for 151 seconds 0.06/0.26 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.06/0.26 # and selection function SelectMaxLComplexAvoidPosPred. 0.06/0.26 # 0.06/0.26 # Preprocessing time : 0.011 s 0.06/0.26 # Presaturation interreduction done 0.06/0.26 0.06/0.26 # Proof found! 0.06/0.26 # SZS status Theorem 0.06/0.26 # SZS output start CNFRefutation 0.06/0.26 fof(unordered_pair_defn, axiom, ![X4, X1, X2]:((member(X4,universal_class)&(X1=X4|X4=X2))<=>member(X4,unordered_pair(X1,X2))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', unordered_pair_defn)). 0.06/0.26 fof(left_cancellation, conjecture, ![X1, X2, X3]:(X2=X3<=((member(X2,universal_class)&member(X3,universal_class))&unordered_pair(X1,X3)=unordered_pair(X1,X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', left_cancellation)). 0.06/0.26 fof(c_0_2, plain, ![X15, X16, X17, X15, X16, X17]:(((X16!=X15|~member(X15,universal_class)|member(X15,unordered_pair(X16,X17)))&(X15!=X17|~member(X15,universal_class)|member(X15,unordered_pair(X16,X17))))&((member(X15,universal_class)|~member(X15,unordered_pair(X16,X17)))&(X16=X15|X15=X17|~member(X15,unordered_pair(X16,X17))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])])). 0.06/0.26 fof(c_0_3, negated_conjecture, ~(![X1, X2, X3]:(X2=X3<=((member(X2,universal_class)&member(X3,universal_class))&unordered_pair(X1,X3)=unordered_pair(X1,X2)))), inference(assume_negation,[status(cth)],[left_cancellation])). 0.06/0.26 cnf(c_0_4, plain, (member(X1,unordered_pair(X3,X2))|X1!=X2|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.06/0.26 fof(c_0_5, negated_conjecture, (((member(esk9_0,universal_class)&member(esk10_0,universal_class))&unordered_pair(esk8_0,esk10_0)=unordered_pair(esk8_0,esk9_0))&esk9_0!=esk10_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3])])])])). 0.06/0.26 cnf(c_0_6, plain, (member(X1,unordered_pair(X2,X1))|~member(X1,universal_class)), inference(er,[status(thm)],[c_0_4])). 0.06/0.26 cnf(c_0_7, negated_conjecture, (member(esk10_0,universal_class)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.06/0.26 cnf(c_0_8, negated_conjecture, (member(esk10_0,unordered_pair(X1,esk10_0))), inference(spm,[status(thm)],[c_0_6, c_0_7])). 0.06/0.26 cnf(c_0_9, negated_conjecture, (unordered_pair(esk8_0,esk10_0)=unordered_pair(esk8_0,esk9_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.06/0.26 cnf(c_0_10, plain, (X1=X2|X2=X3|~member(X2,unordered_pair(X1,X3))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.06/0.26 cnf(c_0_11, negated_conjecture, (member(esk10_0,unordered_pair(esk8_0,esk9_0))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 0.06/0.26 cnf(c_0_12, negated_conjecture, (esk9_0!=esk10_0), inference(split_conjunct,[status(thm)],[c_0_5])). 0.06/0.26 cnf(c_0_13, negated_conjecture, (esk8_0=esk10_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])). 0.06/0.26 cnf(c_0_14, negated_conjecture, (unordered_pair(esk10_0,esk10_0)=unordered_pair(esk10_0,esk9_0)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_13]), c_0_13])). 0.06/0.26 cnf(c_0_15, negated_conjecture, (member(esk9_0,universal_class)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.06/0.26 cnf(c_0_16, negated_conjecture, (X1=esk10_0|~member(X1,unordered_pair(esk10_0,esk9_0))), inference(spm,[status(thm)],[c_0_10, c_0_14])). 0.06/0.26 cnf(c_0_17, negated_conjecture, (member(esk9_0,unordered_pair(X1,esk9_0))), inference(spm,[status(thm)],[c_0_6, c_0_15])). 0.06/0.26 cnf(c_0_18, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_12]), ['proof']). 0.06/0.26 # SZS output end CNFRefutation 0.06/0.26 # Proof object total steps : 19 0.06/0.26 # Proof object clause steps : 14 0.06/0.26 # Proof object formula steps : 5 0.06/0.26 # Proof object conjectures : 14 0.06/0.26 # Proof object clause conjectures : 11 0.06/0.26 # Proof object formula conjectures : 3 0.06/0.26 # Proof object initial clauses used : 6 0.06/0.26 # Proof object initial formulas used : 2 0.06/0.26 # Proof object generating inferences : 6 0.06/0.26 # Proof object simplifying inferences : 5 0.06/0.26 # Training examples: 0 positive, 0 negative 0.06/0.26 # Parsed axioms : 44 0.06/0.26 # Removed by relevancy pruning/SinE : 0 0.06/0.26 # Initial clauses : 93 0.06/0.26 # Removed in clause preprocessing : 8 0.06/0.26 # Initial clauses in saturation : 85 0.06/0.26 # Processed clauses : 194 0.06/0.26 # ...of these trivial : 1 0.06/0.26 # ...subsumed : 3 0.06/0.26 # ...remaining for further processing : 190 0.06/0.26 # Other redundant clauses eliminated : 4 0.06/0.26 # Clauses deleted for lack of memory : 0 0.06/0.26 # Backward-subsumed : 0 0.06/0.26 # Backward-rewritten : 3 0.06/0.26 # Generated clauses : 391 0.06/0.26 # ...of the previous two non-trivial : 369 0.06/0.26 # Contextual simplify-reflections : 0 0.06/0.26 # Paramodulations : 386 0.06/0.26 # Factorizations : 0 0.06/0.26 # Equation resolutions : 5 0.06/0.26 # Propositional unsat checks : 0 0.06/0.26 # Propositional check models : 0 0.06/0.26 # Propositional check unsatisfiable : 0 0.06/0.26 # Propositional clauses : 0 0.06/0.26 # Propositional clauses after purity: 0 0.06/0.26 # Propositional unsat core size : 0 0.06/0.26 # Current number of processed clauses : 99 0.06/0.26 # Positive orientable unit clauses : 24 0.06/0.26 # Positive unorientable unit clauses: 0 0.06/0.26 # Negative unit clauses : 3 0.06/0.26 # Non-unit-clauses : 72 0.06/0.26 # Current number of unprocessed clauses: 334 0.06/0.26 # ...number of literals in the above : 849 0.06/0.26 # Current number of archived formulas : 0 0.06/0.26 # Current number of archived clauses : 95 0.06/0.26 # Clause-clause subsumption calls (NU) : 2065 0.06/0.26 # Rec. Clause-clause subsumption calls : 1853 0.06/0.26 # Non-unit clause-clause subsumptions : 0 0.06/0.26 # Unit Clause-clause subsumption calls : 385 0.06/0.26 # Rewrite failures with RHS unbound : 0 0.06/0.26 # BW rewrite match attempts : 16 0.06/0.26 # BW rewrite match successes : 2 0.06/0.26 # Condensation attempts : 0 0.06/0.26 # Condensation successes : 0 0.06/0.26 # Termbank termtop insertions : 14638 0.06/0.26 0.06/0.26 # ------------------------------------------------- 0.06/0.26 # User time : 0.020 s 0.06/0.26 # System time : 0.002 s 0.06/0.26 # Total time : 0.022 s 0.06/0.26 # Maximum resident set size: 1580 pages 0.06/0.26 EOF