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.23 % Computer : n134.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:35:39 CDT 2018 0.02/0.23 % CPUTime : 0.02/0.23 # Version: 2.2pre001 0.02/0.23 # No SInE strategy applied 0.02/0.23 # Trying AutoSched0 for 151 seconds 0.06/0.28 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S 0.06/0.28 # and selection function SelectComplexG. 0.06/0.28 # 0.06/0.28 # Preprocessing time : 0.008 s 0.06/0.28 0.06/0.28 # Proof found! 0.06/0.28 # SZS status Theorem 0.06/0.28 # SZS output start CNFRefutation 0.06/0.28 fof(conjecture_1, conjecture, ![X1, X2, X3]:(((element(X1)&element(X2))&X3=times(X1,X2))=>element(X3)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conjecture_1)). 0.06/0.28 fof(axiom_2, axiom, ![X2]:(element(X2)<=>?[X3]:(times(X2,X2)=X3&X2=times(X2,X3))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom_2)). 0.06/0.28 fof(axiom_1, axiom, ![X1, X2, X3]:times(times(X1,X2),X3)=times(X2,times(X3,X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom_1)). 0.06/0.28 fof(c_0_3, negated_conjecture, ~(![X1, X2, X3]:(((element(X1)&element(X2))&X3=times(X1,X2))=>element(X3))), inference(assume_negation,[status(cth)],[conjecture_1])). 0.06/0.28 fof(c_0_4, plain, ![X7, X7, X9]:(((times(X7,X7)=esk1_1(X7)|~element(X7))&(X7=times(X7,esk1_1(X7))|~element(X7)))&(times(X7,X7)!=X9|X7!=times(X7,X9)|element(X7))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])])])). 0.06/0.28 fof(c_0_5, negated_conjecture, (((element(esk2_0)&element(esk3_0))&esk4_0=times(esk2_0,esk3_0))&~element(esk4_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])). 0.06/0.28 fof(c_0_6, plain, ![X4, X5, X6]:times(times(X4,X5),X6)=times(X5,times(X6,X4)), inference(variable_rename,[status(thm)],[axiom_1])). 0.06/0.28 cnf(c_0_7, plain, (X1=times(X1,esk1_1(X1))|~element(X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.06/0.28 cnf(c_0_8, negated_conjecture, (element(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.06/0.28 cnf(c_0_9, plain, (times(X1,X1)=esk1_1(X1)|~element(X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.06/0.28 cnf(c_0_10, plain, (times(times(X1,X2),X3)=times(X2,times(X3,X1))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.06/0.28 cnf(c_0_11, negated_conjecture, (times(esk3_0,esk1_1(esk3_0))=esk3_0), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.06/0.28 cnf(c_0_12, negated_conjecture, (esk4_0=times(esk2_0,esk3_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.06/0.28 cnf(c_0_13, negated_conjecture, (times(esk3_0,esk3_0)=esk1_1(esk3_0)), inference(spm,[status(thm)],[c_0_9, c_0_8])). 0.06/0.28 cnf(c_0_14, negated_conjecture, (times(esk1_1(esk3_0),times(X1,esk3_0))=times(esk3_0,X1)), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.06/0.28 cnf(c_0_15, plain, (times(times(X1,X2),times(X3,X4))=times(X2,times(X4,times(X1,X3)))), inference(spm,[status(thm)],[c_0_10, c_0_10])). 0.06/0.28 cnf(c_0_16, negated_conjecture, (times(esk4_0,X1)=times(esk3_0,times(X1,esk2_0))), inference(spm,[status(thm)],[c_0_10, c_0_12])). 0.06/0.28 cnf(c_0_17, negated_conjecture, (times(esk1_1(esk3_0),X1)=times(esk3_0,times(X1,esk3_0))), inference(spm,[status(thm)],[c_0_10, c_0_13])). 0.06/0.28 cnf(c_0_18, negated_conjecture, (times(times(esk3_0,X1),X2)=times(esk3_0,times(esk1_1(esk3_0),times(X1,X2)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_14]), c_0_15])). 0.06/0.28 cnf(c_0_19, negated_conjecture, (times(esk1_1(esk3_0),esk4_0)=times(esk3_0,esk2_0)), inference(spm,[status(thm)],[c_0_14, c_0_12])). 0.06/0.28 cnf(c_0_20, negated_conjecture, (times(esk1_1(esk3_0),times(esk3_0,times(esk3_0,esk2_0)))=times(esk3_0,esk4_0)), inference(spm,[status(thm)],[c_0_14, c_0_16])). 0.06/0.28 cnf(c_0_21, negated_conjecture, (times(esk1_1(esk3_0),times(esk3_0,X1))=times(esk3_0,times(esk3_0,times(esk3_0,X1)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_14])). 0.06/0.28 cnf(c_0_22, negated_conjecture, (times(esk3_0,times(esk3_0,times(esk3_0,esk2_0)))=times(esk3_0,esk2_0)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_17]), c_0_16])). 0.06/0.28 cnf(c_0_23, plain, (times(times(X1,times(X2,X3)),X4)=times(X2,times(X4,times(X3,X1)))), inference(spm,[status(thm)],[c_0_10, c_0_10])). 0.06/0.28 cnf(c_0_24, negated_conjecture, (times(esk1_1(esk3_0),times(X1,times(esk3_0,X2)))=times(esk3_0,times(X2,X1))), inference(spm,[status(thm)],[c_0_14, c_0_10])). 0.06/0.28 cnf(c_0_25, plain, (element(X1)|times(X1,X1)!=X2|X1!=times(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.06/0.28 cnf(c_0_26, negated_conjecture, (times(esk3_0,times(esk3_0,esk2_0))=times(esk3_0,esk4_0)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_21]), c_0_22])). 0.06/0.28 cnf(c_0_27, negated_conjecture, (times(times(X1,esk3_0),X2)=times(esk3_0,times(X1,X2))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_17]), c_0_13]), c_0_11])). 0.06/0.28 cnf(c_0_28, plain, (element(X1)|times(X1,times(X1,X1))!=X1), inference(er,[status(thm)],[c_0_25])). 0.06/0.28 cnf(c_0_29, negated_conjecture, (element(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.06/0.28 cnf(c_0_30, negated_conjecture, (times(esk4_0,esk1_1(esk3_0))=times(esk3_0,times(esk3_0,esk4_0))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_12])). 0.06/0.28 cnf(c_0_31, negated_conjecture, (times(esk3_0,times(esk3_0,esk4_0))=times(esk3_0,esk2_0)), inference(rw,[status(thm)],[c_0_22, c_0_26])). 0.06/0.28 cnf(c_0_32, negated_conjecture, (times(esk3_0,times(esk1_1(esk3_0),X1))=times(esk3_0,X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_11]), c_0_14])). 0.06/0.28 cnf(c_0_33, negated_conjecture, (times(esk1_1(esk3_0),X1)=times(esk3_0,times(esk3_0,X1))), inference(spm,[status(thm)],[c_0_27, c_0_13])). 0.06/0.28 cnf(c_0_34, plain, (element(times(X1,X2))|times(X2,times(X2,times(X2,times(X1,times(X1,X1)))))!=times(X1,X2)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_15]), c_0_15]), c_0_15])). 0.06/0.28 cnf(c_0_35, negated_conjecture, (times(esk2_0,esk2_0)=esk1_1(esk2_0)), inference(spm,[status(thm)],[c_0_9, c_0_29])). 0.06/0.28 cnf(c_0_36, negated_conjecture, (times(esk2_0,esk1_1(esk2_0))=esk2_0), inference(spm,[status(thm)],[c_0_7, c_0_29])). 0.06/0.28 cnf(c_0_37, negated_conjecture, (times(times(esk4_0,X1),X2)=times(esk2_0,times(esk3_0,times(X1,X2)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_16]), c_0_15])). 0.06/0.28 cnf(c_0_38, negated_conjecture, (times(esk4_0,esk1_1(esk3_0))=times(esk3_0,esk2_0)), inference(rw,[status(thm)],[c_0_30, c_0_31])). 0.06/0.28 cnf(c_0_39, negated_conjecture, (times(esk3_0,times(esk2_0,X1))=times(esk4_0,X1)), inference(spm,[status(thm)],[c_0_27, c_0_12])). 0.06/0.28 cnf(c_0_40, negated_conjecture, (times(esk3_0,times(esk3_0,times(esk3_0,X1)))=times(esk3_0,X1)), inference(rw,[status(thm)],[c_0_32, c_0_33])). 0.06/0.28 cnf(c_0_41, negated_conjecture, (element(times(esk2_0,X1))|times(X1,times(X1,times(X1,esk2_0)))!=times(esk2_0,X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])). 0.06/0.28 cnf(c_0_42, negated_conjecture, (~element(esk4_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.06/0.28 cnf(c_0_43, negated_conjecture, (times(esk2_0,times(esk3_0,X1))=times(esk4_0,X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_18]), c_0_32]), c_0_39]), c_0_33]), c_0_40])). 0.06/0.28 cnf(c_0_44, negated_conjecture, (times(esk3_0,esk2_0)!=esk4_0), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_12]), c_0_26]), c_0_31]), c_0_42])). 0.06/0.28 cnf(c_0_45, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_11]), c_0_12]), c_0_30]), c_0_31]), c_0_44]), ['proof']). 0.06/0.28 # SZS output end CNFRefutation 0.06/0.28 # Proof object total steps : 46 0.06/0.28 # Proof object clause steps : 39 0.06/0.28 # Proof object formula steps : 7 0.06/0.28 # Proof object conjectures : 34 0.06/0.28 # Proof object clause conjectures : 31 0.06/0.28 # Proof object formula conjectures : 3 0.06/0.28 # Proof object initial clauses used : 8 0.06/0.28 # Proof object initial formulas used : 3 0.06/0.28 # Proof object generating inferences : 25 0.06/0.28 # Proof object simplifying inferences : 31 0.06/0.28 # Training examples: 0 positive, 0 negative 0.06/0.28 # Parsed axioms : 3 0.06/0.28 # Removed by relevancy pruning/SinE : 0 0.06/0.28 # Initial clauses : 8 0.06/0.28 # Removed in clause preprocessing : 0 0.06/0.28 # Initial clauses in saturation : 8 0.06/0.28 # Processed clauses : 334 0.06/0.28 # ...of these trivial : 37 0.06/0.28 # ...subsumed : 104 0.06/0.28 # ...remaining for further processing : 193 0.06/0.28 # Other redundant clauses eliminated : 1 0.06/0.28 # Clauses deleted for lack of memory : 0 0.06/0.28 # Backward-subsumed : 2 0.06/0.28 # Backward-rewritten : 107 0.06/0.28 # Generated clauses : 4188 0.06/0.28 # ...of the previous two non-trivial : 3604 0.06/0.28 # Contextual simplify-reflections : 0 0.06/0.28 # Paramodulations : 4187 0.06/0.28 # Factorizations : 0 0.06/0.28 # Equation resolutions : 1 0.06/0.28 # Propositional unsat checks : 0 0.06/0.28 # Propositional check models : 0 0.06/0.28 # Propositional check unsatisfiable : 0 0.06/0.28 # Propositional clauses : 0 0.06/0.28 # Propositional clauses after purity: 0 0.06/0.28 # Propositional unsat core size : 0 0.06/0.28 # Current number of processed clauses : 83 0.06/0.28 # Positive orientable unit clauses : 47 0.06/0.28 # Positive unorientable unit clauses: 11 0.06/0.28 # Negative unit clauses : 2 0.06/0.28 # Non-unit-clauses : 23 0.06/0.28 # Current number of unprocessed clauses: 1895 0.06/0.28 # ...number of literals in the above : 2638 0.06/0.28 # Current number of archived formulas : 0 0.06/0.28 # Current number of archived clauses : 109 0.06/0.28 # Clause-clause subsumption calls (NU) : 997 0.06/0.28 # Rec. Clause-clause subsumption calls : 990 0.06/0.28 # Non-unit clause-clause subsumptions : 62 0.06/0.28 # Unit Clause-clause subsumption calls : 77 0.06/0.28 # Rewrite failures with RHS unbound : 0 0.06/0.28 # BW rewrite match attempts : 305 0.06/0.28 # BW rewrite match successes : 228 0.06/0.28 # Condensation attempts : 0 0.06/0.28 # Condensation successes : 0 0.06/0.28 # Termbank termtop insertions : 75499 0.06/0.28 0.06/0.28 # ------------------------------------------------- 0.06/0.28 # User time : 0.047 s 0.06/0.28 # System time : 0.006 s 0.06/0.28 # Total time : 0.053 s 0.06/0.28 # Maximum resident set size: 1456 pages 0.06/0.29 EOF