0.06/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.11 % Command : run_E %s %d THM 0.10/0.31 % Computer : n031.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 1200 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Jul 13 16:49:14 EDT 2021 0.10/0.32 % CPUTime : 0.16/0.43 Running first-order theorem proving 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.16/0.43 # Version: 2.6 0.16/0.43 # No SInE strategy applied 0.16/0.43 # Trying AutoSched0 for 59 seconds 0.16/0.47 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b 0.16/0.47 # and selection function SelectCQIPrecW. 0.16/0.47 # 0.16/0.47 # Preprocessing time : 0.030 s 0.16/0.47 # Presaturation interreduction done 0.16/0.47 0.16/0.47 # Proof found! 0.16/0.47 # SZS status Theorem 0.16/0.47 # SZS output start CNFRefutation 0.16/0.47 fof('ass(cond(299, 0), 2)', axiom, ![X33, X40, X41]:(greater(X40,X41)=>greater(vmul(X40,X33),vmul(X41,X33))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'ass(cond(299, 0), 2)')). 0.16/0.47 fof('holds(conjunct1(314), 510, 0)', axiom, greater(vd508,vd509), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'holds(conjunct1(314), 510, 0)')). 0.16/0.47 fof('ass(cond(270, 0), 0)', axiom, ![X59, X60]:vmul(X60,X59)=vmul(X59,X60), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'ass(cond(270, 0), 0)')). 0.16/0.47 fof('holds(conjunct1(315), 514, 0)', conjecture, greater(vmul(vd508,vd511),vmul(vd509,vd511)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', 'holds(conjunct1(315), 514, 0)')). 0.16/0.47 fof(c_0_4, plain, ![X301, X302, X303]:(~greater(X302,X303)|greater(vmul(X302,X301),vmul(X303,X301))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])])). 0.16/0.47 cnf(c_0_5, plain, (greater(vmul(X1,X3),vmul(X2,X3))|~greater(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.16/0.47 cnf(c_0_6, plain, (greater(vd508,vd509)), inference(split_conjunct,[status(thm)],['holds(conjunct1(314), 510, 0)'])). 0.16/0.47 fof(c_0_7, plain, ![X326, X327]:vmul(X327,X326)=vmul(X326,X327), inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)'])). 0.16/0.47 fof(c_0_8, negated_conjecture, ~greater(vmul(vd508,vd511),vmul(vd509,vd511)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conjunct1(315), 514, 0)'])])). 0.16/0.47 cnf(c_0_9, plain, (greater(vmul(vd508,X1),vmul(vd509,X1))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.16/0.47 cnf(c_0_10, plain, (vmul(X1,X2)=vmul(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.16/0.47 cnf(c_0_11, negated_conjecture, (~greater(vmul(vd508,vd511),vmul(vd509,vd511))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.16/0.47 cnf(c_0_12, plain, (greater(vmul(vd508,X1),vmul(X1,vd509))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.16/0.47 cnf(c_0_13, negated_conjecture, (~greater(vmul(vd511,vd508),vmul(vd511,vd509))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_10]), c_0_10])). 0.16/0.47 cnf(c_0_14, plain, (greater(vmul(X1,vd508),vmul(X1,vd509))), inference(spm,[status(thm)],[c_0_12, c_0_10])). 0.16/0.47 cnf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])]), ['proof']). 0.16/0.47 # SZS output end CNFRefutation 0.16/0.47 # Proof object total steps : 16 0.16/0.47 # Proof object clause steps : 9 0.16/0.47 # Proof object formula steps : 7 0.16/0.47 # Proof object conjectures : 5 0.16/0.47 # Proof object clause conjectures : 3 0.16/0.47 # Proof object formula conjectures : 2 0.16/0.47 # Proof object initial clauses used : 4 0.16/0.47 # Proof object initial formulas used : 4 0.16/0.47 # Proof object generating inferences : 3 0.16/0.47 # Proof object simplifying inferences : 4 0.16/0.47 # Training examples: 0 positive, 0 negative 0.16/0.47 # Parsed axioms : 59 0.16/0.47 # Removed by relevancy pruning/SinE : 0 0.16/0.47 # Initial clauses : 69 0.16/0.47 # Removed in clause preprocessing : 3 0.16/0.47 # Initial clauses in saturation : 66 0.16/0.47 # Processed clauses : 223 0.16/0.47 # ...of these trivial : 7 0.16/0.47 # ...subsumed : 68 0.16/0.47 # ...remaining for further processing : 148 0.16/0.47 # Other redundant clauses eliminated : 11 0.16/0.47 # Clauses deleted for lack of memory : 0 0.16/0.47 # Backward-subsumed : 1 0.16/0.47 # Backward-rewritten : 4 0.16/0.47 # Generated clauses : 465 0.16/0.47 # ...of the previous two non-trivial : 396 0.16/0.47 # Contextual simplify-reflections : 0 0.16/0.47 # Paramodulations : 451 0.16/0.47 # Factorizations : 0 0.16/0.47 # NegExts : 0 0.16/0.47 # Equation resolutions : 14 0.16/0.47 # Propositional unsat checks : 0 0.16/0.47 # Propositional check models : 0 0.16/0.47 # Propositional check unsatisfiable : 0 0.16/0.47 # Propositional clauses : 0 0.16/0.47 # Propositional clauses after purity: 0 0.16/0.47 # Propositional unsat core size : 0 0.16/0.47 # Propositional preprocessing time : 0.000 0.16/0.47 # Propositional encoding time : 0.000 0.16/0.47 # Propositional solver time : 0.000 0.16/0.47 # Success case prop preproc time : 0.000 0.16/0.47 # Success case prop encoding time : 0.000 0.16/0.47 # Success case prop solver time : 0.000 0.16/0.47 # Current number of processed clauses : 77 0.16/0.47 # Positive orientable unit clauses : 24 0.16/0.47 # Positive unorientable unit clauses: 4 0.16/0.47 # Negative unit clauses : 26 0.16/0.47 # Non-unit-clauses : 23 0.16/0.47 # Current number of unprocessed clauses: 296 0.16/0.47 # ...number of literals in the above : 404 0.16/0.47 # Current number of archived formulas : 0 0.16/0.47 # Current number of archived clauses : 63 0.16/0.47 # Clause-clause subsumption calls (NU) : 123 0.16/0.47 # Rec. Clause-clause subsumption calls : 123 0.16/0.47 # Non-unit clause-clause subsumptions : 10 0.16/0.47 # Unit Clause-clause subsumption calls : 73 0.16/0.47 # Rewrite failures with RHS unbound : 0 0.16/0.47 # BW rewrite match attempts : 66 0.16/0.47 # BW rewrite match successes : 54 0.16/0.47 # Condensation attempts : 0 0.16/0.47 # Condensation successes : 0 0.16/0.47 # Termbank termtop insertions : 7249 0.16/0.47 0.16/0.47 # ------------------------------------------------- 0.16/0.47 # User time : 0.040 s 0.16/0.47 # System time : 0.002 s 0.16/0.47 # Total time : 0.042 s 0.16/0.47 # Maximum resident set size: 1704 pages 0.16/0.47 EOF