0.00/0.01	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.02	% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.03/0.33	% Computer : n024.cluster.edu
0.03/0.33	% Model    : x86_64 x86_64
0.03/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.03/0.33	% Memory   : 8046.5625MB
0.03/0.33	% OS       : Linux 6.8.0-71-generic
0.03/0.33	% CPULimit : 1440
0.03/0.33	% WCLimit  : 180
0.03/0.33	% DateTime : Mon Jul 27 04:15:32 UTC 2026
0.03/0.34	% CPUTime  : 
0.03/0.34	Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.03/0.36	Running first-order theorem proving
0.03/0.36	Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/benchmark/theBenchmark.p
0.03/0.37	% Version: 3.5.1
0.03/0.37	% Preprocessing class: FSMSSMSSSSSNFFN.
0.03/0.37	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.03/0.37	% Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores
0.03/0.37	% Starting new_bool_3 with 180s (1) cores
0.03/0.37	% Starting new_bool_1 with 180s (1) cores
0.03/0.37	% Starting sh5l with 180s (1) cores
0.03/0.37	% new_bool_3 with pid 2833571 completed with status 0
0.03/0.37	% Result found by new_bool_3
0.03/0.37	% Preprocessing class: FSMSSMSSSSSNFFN.
0.03/0.37	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.03/0.37	% Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores
0.03/0.37	% Starting new_bool_3 with 180s (1) cores
0.03/0.37	% (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
0.03/0.37	% SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.03/0.37	% Search class: FHHSF-FFSF21-SFFFFFNN
0.03/0.37	% Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.03/0.37	% Starting SubtermCWHack with 19s (1) cores
0.03/0.37	% SubtermCWHack with pid 2833576 completed with status 0
0.03/0.37	% Result found by SubtermCWHack
0.03/0.37	% Preprocessing class: FSMSSMSSSSSNFFN.
0.03/0.37	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.03/0.37	% Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores
0.03/0.37	% Starting new_bool_3 with 180s (1) cores
0.03/0.37	% (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
0.03/0.37	% SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.03/0.37	% Search class: FHHSF-FFSF21-SFFFFFNN
0.03/0.37	% Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.03/0.37	% Starting SubtermCWHack with 19s (1) cores
0.03/0.37	% Preprocessing time       : 0.001 s
0.03/0.37	
0.03/0.37	% Proof found!
0.03/0.37	% SZS status Theorem
0.03/0.37	% SZS output start CNFRefutation
0.03/0.37	fof(co1, conjecture, (~((((![X3]:((sorti2(X3)=>h(j(X3))=X3))&![X4]:((sorti1(X4)=>j(h(X4))=X4)))&![X5]:((sorti2(X5)=>![X6]:((j(op2(X5,X6))=op1(j(X5),j(X6))<=sorti2(X6))))))&![X7]:((sorti1(X7)=>![X8]:((op2(h(X7),h(X8))=h(op1(X7,X8))<=sorti1(X8)))))))<=(![X2]:((sorti1(j(X2))<=sorti2(X2)))&![X1]:((sorti1(X1)=>sorti2(h(X1)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', co1)).
0.03/0.37	fof(ax3, axiom, ?[X1]:((sorti1(X1)&![X2]:((sorti1(X2)=>X1=op1(X2,X2))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax3)).
0.03/0.37	fof(ax2, axiom, ![X1]:((![X2]:((sorti2(op2(X1,X2))<=sorti2(X2)))<=sorti2(X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax2)).
0.03/0.37	fof(ax4, axiom, ~(?[X1]:((sorti2(X1)&![X2]:((op2(X2,X2)=X1<=sorti2(X2)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax4)).
0.03/0.37	fof(c_0_4, negated_conjecture, ~((~((((![X3]:((sorti2(X3)=>h(j(X3))=X3))&![X4]:((sorti1(X4)=>j(h(X4))=X4)))&![X5]:((sorti2(X5)=>![X6]:((j(op2(X5,X6))=op1(j(X5),j(X6))<=sorti2(X6))))))&![X7]:((sorti1(X7)=>![X8]:((op2(h(X7),h(X8))=h(op1(X7,X8))<=sorti1(X8)))))))<=(![X2]:((sorti1(j(X2))<=sorti2(X2)))&![X1]:((sorti1(X1)=>sorti2(h(X1))))))), inference(assume_negation,[status(cth)],[co1])).
0.03/0.37	fof(c_0_5, negated_conjecture, ~(((![X2]:((sorti2(X2)=>sorti1(j(X2))))&![X1]:((sorti1(X1)=>sorti2(h(X1)))))=>~((((![X3]:((sorti2(X3)=>h(j(X3))=X3))&![X4]:((sorti1(X4)=>j(h(X4))=X4)))&![X5]:((sorti2(X5)=>![X6]:((sorti2(X6)=>j(op2(X5,X6))=op1(j(X5),j(X6)))))))&![X7]:((sorti1(X7)=>![X8]:((sorti1(X8)=>op2(h(X7),h(X8))=h(op1(X7,X8)))))))))), inference(fof_simplification,[status(thm)],[c_0_4])).
0.03/0.37	fof(c_0_6, plain, ![X22]:((sorti1(esk2_0)&(~sorti1(X22)|esk2_0=op1(X22,X22)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])])).
0.03/0.37	fof(c_0_7, negated_conjecture, ![X9, X10, X11, X12, X13, X14, X15, X16]:((((~sorti2(X9)|sorti1(j(X9)))&(~sorti1(X10)|sorti2(h(X10))))&((((~sorti2(X11)|h(j(X11))=X11)&(~sorti1(X12)|j(h(X12))=X12))&(~sorti2(X13)|(~sorti2(X14)|j(op2(X13,X14))=op1(j(X13),j(X14)))))&(~sorti1(X15)|(~sorti1(X16)|op2(h(X15),h(X16))=h(op1(X15,X16))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
0.03/0.37	cnf(c_0_8, plain, (esk2_0=op1(X1,X1)|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.03/0.37	cnf(c_0_9, negated_conjecture, (j(op2(X1,X2))=op1(j(X1),j(X2))|~sorti2(X1)|~sorti2(X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.03/0.37	cnf(c_0_10, negated_conjecture, (sorti1(j(X1))|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.03/0.37	fof(c_0_11, plain, ![X1]:((sorti2(X1)=>![X2]:((sorti2(X2)=>sorti2(op2(X1,X2)))))), inference(fof_simplification,[status(thm)],[ax2])).
0.03/0.37	cnf(c_0_12, negated_conjecture, (h(j(X1))=X1|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.03/0.37	cnf(c_0_13, negated_conjecture, (j(op2(X1,X1))=esk2_0|~sorti2(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])).
0.03/0.37	fof(c_0_14, plain, ![X17, X18]:((~sorti2(X17)|(~sorti2(X18)|sorti2(op2(X17,X18))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])).
0.03/0.37	cnf(c_0_15, negated_conjecture, (op2(X1,X1)=h(esk2_0)|~sorti2(op2(X1,X1))|~sorti2(X1)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.03/0.37	cnf(c_0_16, plain, (sorti2(op2(X1,X2))|~sorti2(X1)|~sorti2(X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.03/0.37	cnf(c_0_17, negated_conjecture, (op2(X1,X1)=h(esk2_0)|~sorti2(X1)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.03/0.37	fof(c_0_18, plain, ~(?[X1]:((sorti2(X1)&![X2]:((sorti2(X2)=>op2(X2,X2)=X1))))), inference(fof_simplification,[status(thm)],[ax4])).
0.03/0.37	cnf(c_0_19, negated_conjecture, (sorti2(h(esk2_0))|~sorti2(X1)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.03/0.37	cnf(c_0_20, negated_conjecture, (sorti2(h(X1))|~sorti1(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.03/0.37	fof(c_0_21, plain, ![X19]:(((sorti2(esk1_1(X19))|~sorti2(X19))&(op2(esk1_1(X19),esk1_1(X19))!=X19|~sorti2(X19)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])).
0.03/0.37	cnf(c_0_22, negated_conjecture, (sorti2(h(esk2_0))|~sorti1(X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.03/0.37	cnf(c_0_23, plain, (sorti1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
0.03/0.37	cnf(c_0_24, plain, (op2(esk1_1(X1),esk1_1(X1))!=X1|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
0.03/0.37	cnf(c_0_25, negated_conjecture, (sorti2(h(esk2_0))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
0.03/0.37	cnf(c_0_26, negated_conjecture, (~sorti2(esk1_1(h(esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_17])]), c_0_25])])).
0.03/0.37	cnf(c_0_27, plain, (sorti2(esk1_1(X1))|~sorti2(X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
0.03/0.37	cnf(c_0_28, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_25])]), ['proof']).
0.03/0.37	% SZS output end CNFRefutation
0.03/0.37	% Parsed axioms                        : 5
0.03/0.37	% Removed by relevancy pruning/SinE    : 0
0.03/0.37	% Initial clauses                      : 12
0.03/0.37	% Removed in clause preprocessing      : 0
0.03/0.37	% Initial clauses in saturation        : 12
0.03/0.37	% Processed clauses                    : 21
0.03/0.37	% ...of these trivial                  : 0
0.03/0.37	% ...subsumed                          : 1
0.03/0.37	% ...remaining for further processing  : 20
0.03/0.37	% Other redundant clauses eliminated   : 1
0.03/0.37	% Clauses deleted for lack of memory   : 0
0.03/0.37	% Backward-subsumed                    : 1
0.03/0.37	% Backward-rewritten                   : 3
0.03/0.37	% Generated clauses                    : 30
0.03/0.37	% ...of the previous two non-redundant : 23
0.03/0.37	% ...aggressively subsumed             : 0
0.03/0.37	% Contextual simplify-reflections      : 1
0.03/0.37	% Paramodulations                      : 29
0.03/0.37	% Factorizations                       : 0
0.03/0.37	% NegExts                              : 0
0.03/0.37	% Equation resolutions                 : 1
0.03/0.37	% Disequality decompositions           : 0
0.03/0.37	% Total rewrite steps                  : 11
0.03/0.37	% ...of those cached                   : 8
0.03/0.37	% Propositional unsat checks           : 0
0.03/0.37	%    Propositional check models        : 0
0.03/0.37	%    Propositional check unsatisfiable : 0
0.03/0.37	%    Propositional clauses             : 0
0.03/0.37	%    Propositional clauses after purity: 0
0.03/0.37	%    Propositional unsat core size     : 0
0.03/0.37	%    Propositional preprocessing time  : 0.000
0.03/0.37	%    Propositional encoding time       : 0.000
0.03/0.37	%    Propositional solver time         : 0.000
0.03/0.37	%    Success case prop preproc time    : 0.000
0.03/0.37	%    Success case prop encoding time   : 0.000
0.03/0.37	%    Success case prop solver time     : 0.000
0.03/0.37	% Current number of processed clauses  : 16
0.03/0.37	%    Positive orientable unit clauses  : 3
0.03/0.37	%    Positive unorientable unit clauses: 0
0.03/0.37	%    Negative unit clauses             : 1
0.03/0.37	%    Non-unit-clauses                  : 12
0.03/0.37	% Current number of unprocessed clauses: 13
0.03/0.37	% ...number of literals in the above   : 41
0.03/0.37	% Current number of archived formulas  : 0
0.03/0.37	% Current number of archived clauses   : 4
0.03/0.37	% Clause-clause subsumption calls (NU) : 5
0.03/0.37	% Rec. Clause-clause subsumption calls : 5
0.03/0.37	% Non-unit clause-clause subsumptions  : 3
0.03/0.37	% Unit Clause-clause subsumption calls : 1
0.03/0.37	% Rewrite failures with RHS unbound    : 0
0.03/0.37	% BW rewrite match attempts            : 2
0.03/0.37	% BW rewrite match successes           : 2
0.03/0.37	% Condensation attempts                : 0
0.03/0.37	% Condensation successes               : 0
0.03/0.37	% Termbank termtop insertions          : 1452
0.03/0.37	% Search garbage collected termcells   : 332
0.03/0.37	
0.03/0.37	% -------------------------------------------------
0.03/0.37	% User time                : 0.003 s
0.03/0.37	% System time              : 0.001 s
0.03/0.37	% Total time               : 0.004 s
0.03/0.37	% Maximum resident set size: 3640 pages
0.03/0.37	
0.03/0.37	% -------------------------------------------------
0.03/0.37	% User time                : 0.005 s
0.03/0.37	% System time              : 0.002 s
0.03/0.37	% Total time               : 0.007 s
0.03/0.37	% Maximum resident set size: 4608 pages
0.03/0.37	% E exiting
0.03/0.37	EOF