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.03/0.23 % Computer : n166.star.cs.uiowa.edu 0.03/0.23 % Model : x86_64 x86_64 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.03/0.23 % Memory : 32218.625MB 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.03/0.23 % CPULimit : 300 0.03/0.23 % DateTime : Sat Jul 14 05:27:25 CDT 2018 0.03/0.23 % CPUTime : 0.03/0.23 # Version: 2.2pre001 0.03/0.23 # No SInE strategy applied 0.03/0.23 # Trying AutoSched0 for 151 seconds 0.03/0.25 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V 0.03/0.25 # and selection function PSelectComplexExceptRRHorn. 0.03/0.25 # 0.03/0.25 # Preprocessing time : 0.010 s 0.03/0.25 0.03/0.25 # Proof found! 0.03/0.25 # SZS status Theorem 0.03/0.25 # SZS output start CNFRefutation 0.03/0.25 fof(l14_co, conjecture, ![X1, X2, X3, X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(remove_cpq(triple(X1,X2,X3),X4)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', l14_co)). 0.03/0.25 fof(ax41, axiom, ![X1, X2, X3]:(X3=bad<=~(ok(triple(X1,X2,X3)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax', ax41)). 0.03/0.25 fof(ax40, axiom, ![X1, X2]:(ok(triple(X1,X2,bad))<=>~$true), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax', ax40)). 0.03/0.25 fof(ax45, axiom, ![X1, X2, X3, X4]:(triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)=remove_cpq(triple(X1,X2,X3),X4)<=(contains_slb(X2,X4)&strictly_less_than(X4,lookup_slb(X2,X4)))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax', ax45)). 0.03/0.25 fof(ax43, axiom, ![X1, X2, X3, X4]:(~(contains_slb(X2,X4))=>triple(X1,X2,bad)=remove_cpq(triple(X1,X2,X3),X4)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax', ax43)). 0.03/0.25 fof(ax44, axiom, ![X1, X2, X3, X4]:((contains_slb(X2,X4)&less_than(lookup_slb(X2,X4),X4))=>remove_cpq(triple(X1,X2,X3),X4)=triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax', ax44)). 0.03/0.25 fof(stricly_smaller_definition, axiom, ![X1, X2]:(strictly_less_than(X1,X2)<=>(~(less_than(X2,X1))&less_than(X1,X2))), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax', stricly_smaller_definition)). 0.03/0.25 fof(totality, axiom, ![X1, X2]:(less_than(X1,X2)|less_than(X2,X1)), file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax', totality)). 0.03/0.25 fof(c_0_8, negated_conjecture, ~(![X1, X2, X3, X4]:(~(ok(triple(X1,X2,X3)))=>~(ok(remove_cpq(triple(X1,X2,X3),X4))))), inference(assume_negation,[status(cth)],[l14_co])). 0.03/0.25 fof(c_0_9, negated_conjecture, (~ok(triple(esk1_0,esk2_0,esk3_0))&ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))), inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])])). 0.03/0.25 fof(c_0_10, plain, ![X93, X94, X95]:(ok(triple(X93,X94,X95))|X95=bad), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax41])])])). 0.03/0.25 cnf(c_0_11, negated_conjecture, (~ok(triple(esk1_0,esk2_0,esk3_0))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.03/0.25 cnf(c_0_12, plain, (ok(triple(X1,X2,X3))|X3=bad), inference(split_conjunct,[status(thm)],[c_0_10])). 0.03/0.25 fof(c_0_13, plain, ![X106, X107]:~ok(triple(X106,X107,bad)), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax40])])). 0.03/0.25 fof(c_0_14, plain, ![X72, X73, X74, X75]:(~contains_slb(X73,X75)|~strictly_less_than(X75,lookup_slb(X73,X75))|triple(remove_pqp(X72,X75),remove_slb(X73,X75),bad)=remove_cpq(triple(X72,X73,X74),X75)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax45])])])). 0.03/0.25 cnf(c_0_15, negated_conjecture, (ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.03/0.25 cnf(c_0_16, negated_conjecture, (esk3_0=bad), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.03/0.25 fof(c_0_17, plain, ![X53, X54, X55, X56]:(contains_slb(X54,X56)|triple(X53,X54,bad)=remove_cpq(triple(X53,X54,X55),X56)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax43])])])). 0.03/0.25 fof(c_0_18, plain, ![X117, X118, X119, X120]:(~contains_slb(X118,X120)|~less_than(lookup_slb(X118,X120),X120)|remove_cpq(triple(X117,X118,X119),X120)=triple(remove_pqp(X117,X120),remove_slb(X118,X120),X119)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])])). 0.03/0.25 cnf(c_0_19, plain, (~ok(triple(X1,X2,bad))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.03/0.25 cnf(c_0_20, plain, (triple(remove_pqp(X3,X2),remove_slb(X1,X2),bad)=remove_cpq(triple(X3,X1,X4),X2)|~contains_slb(X1,X2)|~strictly_less_than(X2,lookup_slb(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.03/0.25 cnf(c_0_21, negated_conjecture, (ok(remove_cpq(triple(esk1_0,esk2_0,bad),esk4_0))), inference(rw,[status(thm)],[c_0_15, c_0_16])). 0.03/0.25 cnf(c_0_22, plain, (contains_slb(X1,X2)|triple(X3,X1,bad)=remove_cpq(triple(X3,X1,X4),X2)), inference(split_conjunct,[status(thm)],[c_0_17])). 0.03/0.25 fof(c_0_23, plain, ![X8, X9, X8, X9]:(((~less_than(X9,X8)|~strictly_less_than(X8,X9))&(less_than(X8,X9)|~strictly_less_than(X8,X9)))&(less_than(X9,X8)|~less_than(X8,X9)|strictly_less_than(X8,X9))), 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)],[stricly_smaller_definition])])])])])])). 0.03/0.25 fof(c_0_24, plain, ![X13, X14]:(less_than(X13,X14)|less_than(X14,X13)), inference(variable_rename,[status(thm)],[totality])). 0.03/0.25 cnf(c_0_25, plain, (remove_cpq(triple(X3,X1,X4),X2)=triple(remove_pqp(X3,X2),remove_slb(X1,X2),X4)|~contains_slb(X1,X2)|~less_than(lookup_slb(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_18])). 0.03/0.25 cnf(c_0_26, plain, (~ok(remove_cpq(triple(X1,X2,X3),X4))|~contains_slb(X2,X4)|~strictly_less_than(X4,lookup_slb(X2,X4))), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.03/0.25 cnf(c_0_27, negated_conjecture, (contains_slb(esk2_0,esk4_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_19])). 0.03/0.25 cnf(c_0_28, plain, (less_than(X1,X2)|strictly_less_than(X2,X1)|~less_than(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_23])). 0.03/0.25 cnf(c_0_29, plain, (less_than(X1,X2)|less_than(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_24])). 0.03/0.25 cnf(c_0_30, plain, (~ok(remove_cpq(triple(X1,X2,bad),X3))|~contains_slb(X2,X3)|~less_than(lookup_slb(X2,X3),X3)), inference(spm,[status(thm)],[c_0_19, c_0_25])). 0.03/0.25 cnf(c_0_31, negated_conjecture, (~strictly_less_than(esk4_0,lookup_slb(esk2_0,esk4_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_21]), c_0_27])])). 0.03/0.25 cnf(c_0_32, plain, (strictly_less_than(X1,X2)|less_than(X2,X1)), inference(csr,[status(thm)],[c_0_28, c_0_29])). 0.03/0.25 cnf(c_0_33, negated_conjecture, (~less_than(lookup_slb(esk2_0,esk4_0),esk4_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_21]), c_0_27])])). 0.03/0.25 cnf(c_0_34, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_33]), ['proof']). 0.03/0.25 # SZS output end CNFRefutation 0.03/0.25 # Proof object total steps : 35 0.03/0.25 # Proof object clause steps : 18 0.03/0.25 # Proof object formula steps : 17 0.03/0.25 # Proof object conjectures : 11 0.03/0.25 # Proof object clause conjectures : 8 0.03/0.25 # Proof object formula conjectures : 3 0.03/0.25 # Proof object initial clauses used : 9 0.03/0.25 # Proof object initial formulas used : 8 0.03/0.25 # Proof object generating inferences : 7 0.03/0.25 # Proof object simplifying inferences : 8 0.03/0.25 # Training examples: 0 positive, 0 negative 0.03/0.25 # Parsed axioms : 42 0.03/0.25 # Removed by relevancy pruning/SinE : 0 0.03/0.25 # Initial clauses : 52 0.03/0.25 # Removed in clause preprocessing : 2 0.03/0.25 # Initial clauses in saturation : 50 0.03/0.25 # Processed clauses : 73 0.03/0.25 # ...of these trivial : 1 0.03/0.25 # ...subsumed : 3 0.03/0.25 # ...remaining for further processing : 69 0.03/0.25 # Other redundant clauses eliminated : 3 0.03/0.25 # Clauses deleted for lack of memory : 0 0.03/0.25 # Backward-subsumed : 0 0.03/0.25 # Backward-rewritten : 2 0.03/0.25 # Generated clauses : 156 0.03/0.25 # ...of the previous two non-trivial : 139 0.03/0.25 # Contextual simplify-reflections : 3 0.03/0.25 # Paramodulations : 152 0.03/0.25 # Factorizations : 2 0.03/0.25 # Equation resolutions : 3 0.03/0.25 # Propositional unsat checks : 0 0.03/0.25 # Propositional check models : 0 0.03/0.25 # Propositional check unsatisfiable : 0 0.03/0.25 # Propositional clauses : 0 0.03/0.25 # Propositional clauses after purity: 0 0.03/0.25 # Propositional unsat core size : 0 0.03/0.25 # Current number of processed clauses : 65 0.03/0.25 # Positive orientable unit clauses : 17 0.03/0.25 # Positive unorientable unit clauses: 0 0.03/0.25 # Negative unit clauses : 10 0.03/0.25 # Non-unit-clauses : 38 0.03/0.25 # Current number of unprocessed clauses: 115 0.03/0.25 # ...number of literals in the above : 389 0.03/0.25 # Current number of archived formulas : 0 0.03/0.25 # Current number of archived clauses : 4 0.03/0.25 # Clause-clause subsumption calls (NU) : 161 0.03/0.25 # Rec. Clause-clause subsumption calls : 104 0.03/0.25 # Non-unit clause-clause subsumptions : 5 0.03/0.25 # Unit Clause-clause subsumption calls : 177 0.03/0.25 # Rewrite failures with RHS unbound : 0 0.03/0.25 # BW rewrite match attempts : 7 0.03/0.25 # BW rewrite match successes : 1 0.03/0.25 # Condensation attempts : 73 0.03/0.25 # Condensation successes : 0 0.03/0.25 # Termbank termtop insertions : 5561 0.03/0.25 0.03/0.25 # ------------------------------------------------- 0.03/0.25 # User time : 0.012 s 0.03/0.25 # System time : 0.003 s 0.03/0.25 # Total time : 0.015 s 0.03/0.25 # Maximum resident set size: 1580 pages 0.03/0.25 EOF