0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_E %s %d THM 0.12/0.34 % Computer : n016.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 1200 0.12/0.34 % WCLimit : 120 0.12/0.34 % DateTime : Tue Jul 13 10:53:23 EDT 2021 0.12/0.34 % CPUTime : 0.20/0.47 Running first-order theorem proving 0.20/0.47 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.20/0.47 # Version: 2.6 0.20/0.47 # No SInE strategy applied 0.20/0.47 # Trying AutoSched0 for 59 seconds 0.20/0.50 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S024I 0.20/0.50 # and selection function SelectOptimalRestrPDepth2. 0.20/0.50 # 0.20/0.50 # Preprocessing time : 0.028 s 0.20/0.50 # Presaturation interreduction done 0.20/0.50 0.20/0.50 # Proof found! 0.20/0.50 # SZS status Theorem 0.20/0.50 # SZS output start CNFRefutation 0.20/0.50 fof(x2138, conjecture, (?[X1]:![X2]:?[X3]:![X4]:(big_s(X3,X4)=>![X5]:(big_f(X4,X5)=>big_d(X5,X1,X2)))<=((?[X6]:![X2]:?[X7]:![X4]:(big_d(X4,X6,X2)<=big_s(X7,X4))&![X2]:?[X8]:![X9, X10]:(![X1, X5]:((big_f(X10,X5)&big_f(X9,X1))=>big_d(X1,X5,X2))<=big_d(X9,X10,X8)))&![X6]:?[X1]:big_f(X6,X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', x2138)). 0.20/0.50 fof(c_0_1, negated_conjecture, ~((((?[X6]:![X2]:?[X7]:![X4]:(big_s(X7,X4)=>big_d(X4,X6,X2))&![X2]:?[X8]:![X9, X10]:(big_d(X9,X10,X8)=>![X1, X5]:((big_f(X10,X5)&big_f(X9,X1))=>big_d(X1,X5,X2))))&![X6]:?[X1]:big_f(X6,X1))=>?[X1]:![X2]:?[X3]:![X4]:(big_s(X3,X4)=>![X5]:(big_f(X4,X5)=>big_d(X5,X1,X2))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[x2138])])). 0.20/0.50 fof(c_0_2, negated_conjecture, ![X29, X31, X32, X34, X35, X36, X37, X38, X40, X42]:((((~big_s(esk2_1(X29),X31)|big_d(X31,esk1_0,X29))&(~big_d(X34,X35,esk3_1(X32))|(~big_f(X35,X37)|~big_f(X34,X36)|big_d(X36,X37,X32))))&big_f(X38,esk4_1(X38)))&(big_s(X42,esk6_2(X40,X42))&(big_f(esk6_2(X40,X42),esk7_2(X40,X42))&~big_d(esk7_2(X40,X42),X40,esk5_1(X40))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.20/0.50 cnf(c_0_3, negated_conjecture, (~big_d(esk7_2(X1,X2),X1,esk5_1(X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 cnf(c_0_4, negated_conjecture, (big_d(X5,X4,X3)|~big_d(X1,X2,esk3_1(X3))|~big_f(X2,X4)|~big_f(X1,X5)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 cnf(c_0_5, negated_conjecture, (big_d(X2,esk1_0,X1)|~big_s(esk2_1(X1),X2)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 cnf(c_0_6, negated_conjecture, (big_s(X1,esk6_2(X2,X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 cnf(c_0_7, negated_conjecture, (~big_d(X1,X2,esk3_1(esk5_1(X3)))|~big_f(X1,esk7_2(X3,X4))|~big_f(X2,X3)), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.20/0.50 cnf(c_0_8, negated_conjecture, (big_d(esk6_2(X1,esk2_1(X2)),esk1_0,X2)), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.20/0.50 cnf(c_0_9, negated_conjecture, (~big_f(esk6_2(X1,esk2_1(esk3_1(esk5_1(X2)))),esk7_2(X2,X3))|~big_f(esk1_0,X2)), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.20/0.50 cnf(c_0_10, negated_conjecture, (big_f(esk6_2(X1,X2),esk7_2(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 cnf(c_0_11, negated_conjecture, (~big_f(esk1_0,X1)), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.20/0.50 cnf(c_0_12, negated_conjecture, (big_f(X1,esk4_1(X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.50 cnf(c_0_13, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_11, c_0_12]), ['proof']). 0.20/0.50 # SZS output end CNFRefutation 0.20/0.50 # Proof object total steps : 14 0.20/0.50 # Proof object clause steps : 11 0.20/0.50 # Proof object formula steps : 3 0.20/0.50 # Proof object conjectures : 14 0.20/0.50 # Proof object clause conjectures : 11 0.20/0.50 # Proof object formula conjectures : 3 0.20/0.50 # Proof object initial clauses used : 6 0.20/0.50 # Proof object initial formulas used : 1 0.20/0.50 # Proof object generating inferences : 5 0.20/0.50 # Proof object simplifying inferences : 0 0.20/0.50 # Training examples: 0 positive, 0 negative 0.20/0.50 # Parsed axioms : 1 0.20/0.50 # Removed by relevancy pruning/SinE : 0 0.20/0.50 # Initial clauses : 6 0.20/0.50 # Removed in clause preprocessing : 0 0.20/0.50 # Initial clauses in saturation : 6 0.20/0.50 # Processed clauses : 16 0.20/0.50 # ...of these trivial : 0 0.20/0.50 # ...subsumed : 0 0.20/0.50 # ...remaining for further processing : 16 0.20/0.50 # Other redundant clauses eliminated : 0 0.20/0.50 # Clauses deleted for lack of memory : 0 0.20/0.50 # Backward-subsumed : 0 0.20/0.50 # Backward-rewritten : 0 0.20/0.50 # Generated clauses : 8 0.20/0.50 # ...of the previous two non-trivial : 7 0.20/0.50 # Contextual simplify-reflections : 0 0.20/0.50 # Paramodulations : 8 0.20/0.50 # Factorizations : 0 0.20/0.50 # NegExts : 0 0.20/0.50 # Equation resolutions : 0 0.20/0.50 # Propositional unsat checks : 0 0.20/0.50 # Propositional check models : 0 0.20/0.50 # Propositional check unsatisfiable : 0 0.20/0.50 # Propositional clauses : 0 0.20/0.50 # Propositional clauses after purity: 0 0.20/0.50 # Propositional unsat core size : 0 0.20/0.50 # Propositional preprocessing time : 0.000 0.20/0.50 # Propositional encoding time : 0.000 0.20/0.50 # Propositional solver time : 0.000 0.20/0.50 # Success case prop preproc time : 0.000 0.20/0.50 # Success case prop encoding time : 0.000 0.20/0.50 # Success case prop solver time : 0.000 0.20/0.50 # Current number of processed clauses : 10 0.20/0.50 # Positive orientable unit clauses : 4 0.20/0.50 # Positive unorientable unit clauses: 0 0.20/0.50 # Negative unit clauses : 2 0.20/0.50 # Non-unit-clauses : 4 0.20/0.50 # Current number of unprocessed clauses: 3 0.20/0.50 # ...number of literals in the above : 14 0.20/0.50 # Current number of archived formulas : 0 0.20/0.50 # Current number of archived clauses : 6 0.20/0.50 # Clause-clause subsumption calls (NU) : 0 0.20/0.50 # Rec. Clause-clause subsumption calls : 0 0.20/0.50 # Non-unit clause-clause subsumptions : 0 0.20/0.50 # Unit Clause-clause subsumption calls : 3 0.20/0.50 # Rewrite failures with RHS unbound : 0 0.20/0.50 # BW rewrite match attempts : 0 0.20/0.50 # BW rewrite match successes : 0 0.20/0.50 # Condensation attempts : 0 0.20/0.50 # Condensation successes : 0 0.20/0.50 # Termbank termtop insertions : 808 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.024 s 0.20/0.50 # System time : 0.007 s 0.20/0.50 # Total time : 0.031 s 0.20/0.50 # Maximum resident set size: 1588 pages 0.20/0.50 EOF