0.00/0.03 % 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.02/0.25 % Computer : n150.star.cs.uiowa.edu 0.02/0.25 % Model : x86_64 x86_64 0.02/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.25 % Memory : 32218.625MB 0.02/0.25 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.25 % CPULimit : 300 0.02/0.25 % DateTime : Sat Jul 14 04:21:55 CDT 2018 0.02/0.25 % CPUTime : 0.02/0.26 # Version: 2.2pre001 0.02/0.26 # No SInE strategy applied 0.02/0.26 # Trying AutoSched0 for 151 seconds 0.02/0.28 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y 0.02/0.28 # and selection function SelectMaxLComplexAvoidPosPred. 0.02/0.28 # 0.02/0.28 # Preprocessing time : 0.011 s 0.02/0.28 # Presaturation interreduction done 0.02/0.28 0.02/0.28 # Proof found! 0.02/0.28 # SZS status Theorem 0.02/0.28 # SZS output start CNFRefutation 0.02/0.28 fof(unique_1st_and_2nd_in_pair_of_sets1, conjecture, ![X4, X5, X1]:(((member(X5,universal_class)&ordered_pair(X4,X5)=X1)&member(X4,universal_class))=>(X5=second(X1)&first(X1)=X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', unique_1st_and_2nd_in_pair_of_sets1)). 0.02/0.28 fof(ordered_pair_defn, axiom, ![X1, X2]:ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', ordered_pair_defn)). 0.02/0.28 fof(singleton_set_defn, axiom, ![X1]:singleton(X1)=unordered_pair(X1,X1), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', singleton_set_defn)). 0.02/0.28 fof(first_second, axiom, ![X1, X2]:((member(X2,universal_class)&member(X1,universal_class))=>(first(ordered_pair(X1,X2))=X1&X2=second(ordered_pair(X1,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax', first_second)). 0.02/0.28 fof(c_0_4, negated_conjecture, ~(![X4, X5, X1]:(((member(X5,universal_class)&ordered_pair(X4,X5)=X1)&member(X4,universal_class))=>(X5=second(X1)&first(X1)=X4))), inference(assume_negation,[status(cth)],[unique_1st_and_2nd_in_pair_of_sets1])). 0.02/0.28 fof(c_0_5, plain, ![X18, X19]:ordered_pair(X18,X19)=unordered_pair(singleton(X18),unordered_pair(X18,singleton(X19))), inference(variable_rename,[status(thm)],[ordered_pair_defn])). 0.02/0.28 fof(c_0_6, plain, ![X36]:singleton(X36)=unordered_pair(X36,X36), inference(variable_rename,[status(thm)],[singleton_set_defn])). 0.02/0.28 fof(c_0_7, negated_conjecture, (((member(esk9_0,universal_class)&ordered_pair(esk8_0,esk9_0)=esk10_0)&member(esk8_0,universal_class))&(esk9_0!=second(esk10_0)|first(esk10_0)!=esk8_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])). 0.02/0.28 cnf(c_0_8, plain, (ordered_pair(X1,X2)=unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2)))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.02/0.28 cnf(c_0_9, plain, (singleton(X1)=unordered_pair(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.02/0.28 cnf(c_0_10, negated_conjecture, (ordered_pair(esk8_0,esk9_0)=esk10_0), inference(split_conjunct,[status(thm)],[c_0_7])). 0.02/0.28 cnf(c_0_11, plain, (ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_9]), c_0_9])). 0.02/0.28 fof(c_0_12, plain, ![X64, X65]:((first(ordered_pair(X64,X65))=X64|(~member(X65,universal_class)|~member(X64,universal_class)))&(X65=second(ordered_pair(X64,X65))|(~member(X65,universal_class)|~member(X64,universal_class)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[first_second])])])). 0.02/0.28 cnf(c_0_13, negated_conjecture, (esk9_0!=second(esk10_0)|first(esk10_0)!=esk8_0), inference(split_conjunct,[status(thm)],[c_0_7])). 0.02/0.28 cnf(c_0_14, negated_conjecture, (unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0)))=esk10_0), inference(rw,[status(thm)],[c_0_10, c_0_11])). 0.02/0.28 cnf(c_0_15, plain, (X1=second(ordered_pair(X2,X1))|~member(X1,universal_class)|~member(X2,universal_class)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.02/0.28 cnf(c_0_16, negated_conjecture, (second(unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))))!=esk9_0|first(unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))))!=esk8_0), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14]), c_0_14])). 0.02/0.28 cnf(c_0_17, plain, (X1=second(unordered_pair(unordered_pair(X2,X2),unordered_pair(X2,unordered_pair(X1,X1))))|~member(X2,universal_class)|~member(X1,universal_class)), inference(rw,[status(thm)],[c_0_15, c_0_11])). 0.02/0.28 cnf(c_0_18, negated_conjecture, (member(esk8_0,universal_class)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.02/0.28 cnf(c_0_19, negated_conjecture, (member(esk9_0,universal_class)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.02/0.28 cnf(c_0_20, plain, (first(ordered_pair(X1,X2))=X1|~member(X2,universal_class)|~member(X1,universal_class)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.02/0.28 cnf(c_0_21, negated_conjecture, (first(unordered_pair(unordered_pair(esk8_0,esk8_0),unordered_pair(esk8_0,unordered_pair(esk9_0,esk9_0))))!=esk8_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_19])])). 0.02/0.28 cnf(c_0_22, plain, (first(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))))=X1|~member(X2,universal_class)|~member(X1,universal_class)), inference(rw,[status(thm)],[c_0_20, c_0_11])). 0.02/0.28 cnf(c_0_23, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_19]), c_0_18])]), ['proof']). 0.02/0.28 # SZS output end CNFRefutation 0.02/0.28 # Proof object total steps : 24 0.02/0.28 # Proof object clause steps : 15 0.02/0.28 # Proof object formula steps : 9 0.02/0.28 # Proof object conjectures : 11 0.02/0.28 # Proof object clause conjectures : 8 0.02/0.28 # Proof object formula conjectures : 3 0.02/0.28 # Proof object initial clauses used : 8 0.02/0.28 # Proof object initial formulas used : 4 0.02/0.28 # Proof object generating inferences : 2 0.02/0.28 # Proof object simplifying inferences : 13 0.02/0.28 # Training examples: 0 positive, 0 negative 0.02/0.28 # Parsed axioms : 44 0.02/0.28 # Removed by relevancy pruning/SinE : 0 0.02/0.28 # Initial clauses : 93 0.02/0.28 # Removed in clause preprocessing : 8 0.02/0.28 # Initial clauses in saturation : 85 0.02/0.28 # Processed clauses : 200 0.02/0.28 # ...of these trivial : 1 0.02/0.28 # ...subsumed : 6 0.02/0.28 # ...remaining for further processing : 193 0.02/0.28 # Other redundant clauses eliminated : 6 0.02/0.28 # Clauses deleted for lack of memory : 0 0.02/0.28 # Backward-subsumed : 4 0.02/0.28 # Backward-rewritten : 2 0.02/0.28 # Generated clauses : 337 0.02/0.28 # ...of the previous two non-trivial : 311 0.02/0.28 # Contextual simplify-reflections : 0 0.02/0.28 # Paramodulations : 328 0.02/0.28 # Factorizations : 2 0.02/0.28 # Equation resolutions : 7 0.02/0.28 # Propositional unsat checks : 0 0.02/0.28 # Propositional check models : 0 0.02/0.28 # Propositional check unsatisfiable : 0 0.02/0.28 # Propositional clauses : 0 0.02/0.28 # Propositional clauses after purity: 0 0.02/0.28 # Propositional unsat core size : 0 0.02/0.28 # Current number of processed clauses : 99 0.02/0.28 # Positive orientable unit clauses : 24 0.02/0.28 # Positive unorientable unit clauses: 0 0.02/0.28 # Negative unit clauses : 3 0.02/0.28 # Non-unit-clauses : 72 0.02/0.28 # Current number of unprocessed clauses: 246 0.02/0.28 # ...number of literals in the above : 643 0.02/0.28 # Current number of archived formulas : 0 0.02/0.28 # Current number of archived clauses : 98 0.02/0.28 # Clause-clause subsumption calls (NU) : 2164 0.02/0.28 # Rec. Clause-clause subsumption calls : 1919 0.02/0.28 # Non-unit clause-clause subsumptions : 6 0.02/0.28 # Unit Clause-clause subsumption calls : 374 0.02/0.28 # Rewrite failures with RHS unbound : 0 0.02/0.28 # BW rewrite match attempts : 15 0.02/0.28 # BW rewrite match successes : 2 0.02/0.28 # Condensation attempts : 0 0.02/0.28 # Condensation successes : 0 0.02/0.28 # Termbank termtop insertions : 13118 0.02/0.28 0.02/0.28 # ------------------------------------------------- 0.02/0.28 # User time : 0.021 s 0.02/0.28 # System time : 0.001 s 0.02/0.28 # Total time : 0.022 s 0.02/0.28 # Maximum resident set size: 1580 pages 0.09/0.44 EOF