0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.13 % Command : run_E %s %d THM 0.14/0.34 % Computer : n009.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 1200 0.14/0.34 % WCLimit : 120 0.14/0.34 % DateTime : Tue Jul 13 10:38:57 EDT 2021 0.14/0.34 % CPUTime : 0.20/0.46 Running first-order theorem proving 0.20/0.46 Running: /export/starexec/sandbox/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/sandbox/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.51 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S047N 0.20/0.51 # and selection function PSelectComplexPreferNEQ. 0.20/0.51 # 0.20/0.51 # Preprocessing time : 0.029 s 0.20/0.51 # Presaturation interreduction done 0.20/0.51 0.20/0.51 # Proof found! 0.20/0.51 # SZS status Theorem 0.20/0.51 # SZS output start CNFRefutation 0.20/0.51 fof(co1, conjecture, ((![X1]:(sorti1(X1)=>sorti2(h(X1)))&![X2]:(sorti2(X2)=>sorti1(j(X2))))=>~((((![X3]:(![X4]:(sorti1(X4)=>h(op1(X3,X4))=op2(h(X3),h(X4)))<=sorti1(X3))&![X5]:(sorti2(X5)=>X5=h(j(X5))))&![X6]:(sorti1(X6)=>j(h(X6))=X6))&![X7]:(sorti2(X7)=>![X8]:(sorti2(X8)=>j(op2(X7,X8))=op1(j(X7),j(X8))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', co1)). 0.20/0.51 fof(ax3, axiom, ?[X1]:(sorti1(X1)&![X2]:(sorti1(X2)=>op1(X2,X2)=X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax3)). 0.20/0.51 fof(ax4, axiom, ~(?[X1]:(![X2]:(sorti2(X2)=>op2(X2,X2)=X1)&sorti2(X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax4)). 0.20/0.51 fof(c_0_3, negated_conjecture, ~(((![X1]:(sorti1(X1)=>sorti2(h(X1)))&![X2]:(sorti2(X2)=>sorti1(j(X2))))=>~((((![X3]:(sorti1(X3)=>![X4]:(sorti1(X4)=>h(op1(X3,X4))=op2(h(X3),h(X4))))&![X5]:(sorti2(X5)=>X5=h(j(X5))))&![X6]:(sorti1(X6)=>j(h(X6))=X6))&![X7]:(sorti2(X7)=>![X8]:(sorti2(X8)=>j(op2(X7,X8))=op1(j(X7),j(X8)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])])). 0.20/0.51 fof(c_0_4, negated_conjecture, ![X27, X28, X29, X30, X31, X32, X33, X34]:(((~sorti1(X27)|sorti2(h(X27)))&(~sorti2(X28)|sorti1(j(X28))))&((((~sorti1(X29)|(~sorti1(X30)|h(op1(X29,X30))=op2(h(X29),h(X30))))&(~sorti2(X31)|X31=h(j(X31))))&(~sorti1(X32)|j(h(X32))=X32))&(~sorti2(X33)|(~sorti2(X34)|j(op2(X33,X34))=op1(j(X33),j(X34)))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])). 0.20/0.51 fof(c_0_5, plain, ![X38]:(sorti1(esk2_0)&(~sorti1(X38)|op1(X38,X38)=esk2_0)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])). 0.20/0.51 fof(c_0_6, plain, ![X35]:((sorti2(esk1_1(X35))|~sorti2(X35))&(op2(esk1_1(X35),esk1_1(X35))!=X35|~sorti2(X35))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])). 0.20/0.51 cnf(c_0_7, negated_conjecture, (sorti2(h(X1))|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 cnf(c_0_8, plain, (sorti1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.20/0.51 cnf(c_0_9, plain, (sorti2(esk1_1(X1))|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.20/0.51 cnf(c_0_10, negated_conjecture, (sorti2(h(esk2_0))), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.20/0.51 cnf(c_0_11, negated_conjecture, (sorti1(j(X1))|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 cnf(c_0_12, negated_conjecture, (sorti2(esk1_1(h(esk2_0)))), inference(spm,[status(thm)],[c_0_9, c_0_10])). 0.20/0.51 cnf(c_0_13, negated_conjecture, (X1=h(j(X1))|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 cnf(c_0_14, negated_conjecture, (h(op1(X1,X2))=op2(h(X1),h(X2))|~sorti1(X1)|~sorti1(X2)), inference(split_conjunct,[status(thm)],[c_0_4])). 0.20/0.51 cnf(c_0_15, negated_conjecture, (sorti1(j(esk1_1(h(esk2_0))))), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.20/0.51 cnf(c_0_16, negated_conjecture, (h(j(esk1_1(h(esk2_0))))=esk1_1(h(esk2_0))), inference(spm,[status(thm)],[c_0_13, c_0_12])). 0.20/0.51 cnf(c_0_17, plain, (op1(X1,X1)=esk2_0|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_5])). 0.20/0.51 cnf(c_0_18, plain, (op2(esk1_1(X1),esk1_1(X1))!=X1|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.20/0.51 cnf(c_0_19, negated_conjecture, (h(op1(X1,j(esk1_1(h(esk2_0)))))=op2(h(X1),esk1_1(h(esk2_0)))|~sorti1(X1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])). 0.20/0.51 cnf(c_0_20, negated_conjecture, (op1(j(esk1_1(h(esk2_0))),j(esk1_1(h(esk2_0))))=esk2_0), inference(spm,[status(thm)],[c_0_17, c_0_15])). 0.20/0.51 cnf(c_0_21, negated_conjecture, (op2(esk1_1(h(esk2_0)),esk1_1(h(esk2_0)))!=h(esk2_0)), inference(spm,[status(thm)],[c_0_18, c_0_10])). 0.20/0.51 cnf(c_0_22, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_15]), c_0_20]), c_0_16]), c_0_21]), ['proof']). 0.20/0.51 # SZS output end CNFRefutation 0.20/0.51 # Proof object total steps : 23 0.20/0.51 # Proof object clause steps : 16 0.20/0.51 # Proof object formula steps : 7 0.20/0.51 # Proof object conjectures : 15 0.20/0.51 # Proof object clause conjectures : 12 0.20/0.51 # Proof object formula conjectures : 3 0.20/0.51 # Proof object initial clauses used : 8 0.20/0.51 # Proof object initial formulas used : 3 0.20/0.51 # Proof object generating inferences : 8 0.20/0.51 # Proof object simplifying inferences : 4 0.20/0.51 # Training examples: 0 positive, 0 negative 0.20/0.51 # Parsed axioms : 5 0.20/0.51 # Removed by relevancy pruning/SinE : 0 0.20/0.51 # Initial clauses : 12 0.20/0.51 # Removed in clause preprocessing : 0 0.20/0.51 # Initial clauses in saturation : 12 0.20/0.51 # Processed clauses : 127 0.20/0.51 # ...of these trivial : 2 0.20/0.51 # ...subsumed : 3 0.20/0.51 # ...remaining for further processing : 122 0.20/0.51 # Other redundant clauses eliminated : 0 0.20/0.51 # Clauses deleted for lack of memory : 0 0.20/0.51 # Backward-subsumed : 0 0.20/0.51 # Backward-rewritten : 14 0.20/0.51 # Generated clauses : 581 0.20/0.51 # ...of the previous two non-trivial : 547 0.20/0.51 # Contextual simplify-reflections : 0 0.20/0.51 # Paramodulations : 581 0.20/0.51 # Factorizations : 0 0.20/0.51 # NegExts : 0 0.20/0.51 # Equation resolutions : 0 0.20/0.51 # Propositional unsat checks : 0 0.20/0.51 # Propositional check models : 0 0.20/0.51 # Propositional check unsatisfiable : 0 0.20/0.51 # Propositional clauses : 0 0.20/0.51 # Propositional clauses after purity: 0 0.20/0.51 # Propositional unsat core size : 0 0.20/0.51 # Propositional preprocessing time : 0.000 0.20/0.51 # Propositional encoding time : 0.000 0.20/0.51 # Propositional solver time : 0.000 0.20/0.51 # Success case prop preproc time : 0.000 0.20/0.51 # Success case prop encoding time : 0.000 0.20/0.51 # Success case prop solver time : 0.000 0.20/0.51 # Current number of processed clauses : 96 0.20/0.51 # Positive orientable unit clauses : 51 0.20/0.51 # Positive unorientable unit clauses: 0 0.20/0.51 # Negative unit clauses : 24 0.20/0.51 # Non-unit-clauses : 21 0.20/0.51 # Current number of unprocessed clauses: 408 0.20/0.51 # ...number of literals in the above : 507 0.20/0.51 # Current number of archived formulas : 0 0.20/0.51 # Current number of archived clauses : 26 0.20/0.51 # Clause-clause subsumption calls (NU) : 24 0.20/0.51 # Rec. Clause-clause subsumption calls : 24 0.20/0.51 # Non-unit clause-clause subsumptions : 1 0.20/0.51 # Unit Clause-clause subsumption calls : 115 0.20/0.51 # Rewrite failures with RHS unbound : 0 0.20/0.51 # BW rewrite match attempts : 154 0.20/0.51 # BW rewrite match successes : 3 0.20/0.51 # Condensation attempts : 0 0.20/0.51 # Condensation successes : 0 0.20/0.51 # Termbank termtop insertions : 12260 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.040 s 0.20/0.51 # System time : 0.002 s 0.20/0.51 # Total time : 0.042 s 0.20/0.51 # Maximum resident set size: 1588 pages 0.20/0.51 EOF