0.00/0.02	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.09/0.36	% Computer : n012.cluster.edu
0.09/0.36	% Model    : x86_64 x86_64
0.09/0.36	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.36	% Memory   : 8046.5625MB
0.09/0.36	% OS       : Linux 6.8.0-71-generic
0.09/0.36	% CPULimit : 1440
0.09/0.36	% WCLimit  : 180
0.09/0.36	% DateTime : Mon Jul 27 09:42:33 UTC 2026
0.09/0.36	% CPUTime  : 
0.09/0.36	Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.14/0.40	Running first-order theorem proving
0.14/0.40	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.14/0.44	% Version: 3.5.1
0.14/0.44	% Preprocessing class: FSLSSMSMSSSNFFN.
0.14/0.44	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.14/0.44	% Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 900s (5) cores
0.14/0.44	% Starting new_bool_3 with 180s (1) cores
0.14/0.44	% Starting new_bool_1 with 180s (1) cores
0.14/0.44	% Starting sh5l with 180s (1) cores
0.14/0.44	% new_bool_3 with pid 1840216 completed with status 0
0.14/0.44	% Result found by new_bool_3
0.14/0.44	% Preprocessing class: FSLSSMSMSSSNFFN.
0.14/0.44	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.14/0.44	% Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 900s (5) cores
0.14/0.44	% Starting new_bool_3 with 180s (1) cores
0.14/0.44	% (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
0.14/0.44	% SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.14/0.44	% Search class: FGUSM-FFMM32-MFFFFFNN
0.14/0.44	% partial match(1): FGHSM-FFMM32-MFFFFFNN
0.14/0.44	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.14/0.44	% Starting SubtermCWHack with 17s (1) cores
0.14/0.44	% SubtermCWHack with pid 1840223 completed with status 0
0.14/0.44	% Result found by SubtermCWHack
0.14/0.44	% Preprocessing class: FSLSSMSMSSSNFFN.
0.14/0.44	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.14/0.44	% Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 900s (5) cores
0.14/0.44	% Starting new_bool_3 with 180s (1) cores
0.14/0.44	% (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
0.14/0.44	% SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.14/0.44	% Search class: FGUSM-FFMM32-MFFFFFNN
0.14/0.44	% partial match(1): FGHSM-FFMM32-MFFFFFNN
0.14/0.44	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.14/0.44	% Starting SubtermCWHack with 17s (1) cores
0.14/0.44	% Preprocessing time       : 0.002 s
0.14/0.44	
0.14/0.44	% Proof found!
0.14/0.44	% SZS status Theorem
0.14/0.44	% SZS output start CNFRefutation
0.14/0.44	fof(gauss_init_0077, conjecture, ((geq(minus(n330,n1),n0)&geq(minus(n410,n1),n0))=>![X3]:(((leq(n0,X3)&leq(X3,n2))=>![X8]:((init=a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X8,X3)<=(leq(n0,X8)&leq(X8,minus(n0,n1)))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', gauss_init_0077)).
0.14/0.44	fof(leq_succ, axiom, ![X1, X2]:((leq(X1,succ(X2))<=leq(X1,X2))), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', leq_succ)).
0.14/0.44	fof(pred_succ, axiom, ![X1]:(pred(succ(X1))=X1), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', pred_succ)).
0.14/0.44	fof(pred_minus_1, axiom, ![X1]:(pred(X1)=minus(X1,n1)), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', pred_minus_1)).
0.14/0.44	fof(succ_tptp_minus_1, axiom, n0=succ(tptp_minus_1), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', succ_tptp_minus_1)).
0.14/0.44	fof(leq_succ_gt_equiv, axiom, ![X1, X2]:((gt(succ(X2),X1)<=>leq(X1,X2))), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', leq_succ_gt_equiv)).
0.14/0.44	fof(finite_domain_0, axiom, ![X1]:(((leq(n0,X1)&leq(X1,n0))=>n0=X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', finite_domain_0)).
0.14/0.44	fof(irreflexivity_gt, axiom, ![X1]:(~(gt(X1,X1))), file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax', irreflexivity_gt)).
0.14/0.44	fof(c_0_8, negated_conjecture, ~(((geq(minus(n330,n1),n0)&geq(minus(n410,n1),n0))=>![X3]:(((leq(n0,X3)&leq(X3,n2))=>![X8]:((init=a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X8,X3)<=(leq(n0,X8)&leq(X8,minus(n0,n1))))))))), inference(assume_negation,[status(cth)],[gauss_init_0077])).
0.14/0.44	fof(c_0_9, plain, ![X1, X2]:((leq(X1,X2)=>leq(X1,succ(X2)))), inference(fof_simplification,[status(thm)],[leq_succ])).
0.14/0.44	fof(c_0_10, negated_conjecture, ~(((geq(minus(n330,n1),n0)&geq(minus(n410,n1),n0))=>![X3]:(((leq(n0,X3)&leq(X3,n2))=>![X8]:(((leq(n0,X8)&leq(X8,minus(n0,n1)))=>init=a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),X8,X3))))))), inference(fof_simplification,[status(thm)],[c_0_8])).
0.14/0.44	fof(c_0_11, plain, ![X73]:(pred(succ(X73))=X73), inference(variable_rename,[status(thm)],[pred_succ])).
0.14/0.44	fof(c_0_12, plain, ![X42, X43]:((~leq(X42,X43)|leq(X42,succ(X43)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
0.14/0.44	fof(c_0_13, negated_conjecture, ((geq(minus(n330,n1),n0)&geq(minus(n410,n1),n0))&((leq(n0,esk1_0)&leq(esk1_0,n2))&((leq(n0,esk2_0)&leq(esk2_0,minus(n0,n1)))&init!=a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),esk2_0,esk1_0)))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])).
0.14/0.44	fof(c_0_14, plain, ![X49]:(pred(X49)=minus(X49,n1)), inference(variable_rename,[status(thm)],[pred_minus_1])).
0.14/0.44	cnf(c_0_15, plain, (pred(succ(X1))=X1), inference(split_conjunct,[status(thm)],[c_0_11])).
0.14/0.44	cnf(c_0_16, plain, (n0=succ(tptp_minus_1)), inference(split_conjunct,[status(thm)],[succ_tptp_minus_1])).
0.14/0.44	cnf(c_0_17, plain, (leq(X1,succ(X2))|~leq(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
0.14/0.44	cnf(c_0_18, negated_conjecture, (leq(esk2_0,minus(n0,n1))), inference(split_conjunct,[status(thm)],[c_0_13])).
0.14/0.44	cnf(c_0_19, plain, (pred(X1)=minus(X1,n1)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.14/0.44	cnf(c_0_20, plain, (pred(n0)=tptp_minus_1), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.14/0.44	fof(c_0_21, plain, ![X33, X34]:(((~gt(succ(X34),X33)|leq(X33,X34))&(~leq(X33,X34)|gt(succ(X34),X33)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_succ_gt_equiv])])])).
0.14/0.44	fof(c_0_22, plain, ![X46]:((~leq(n0,X46)|~leq(X46,n0)|n0=X46)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[finite_domain_0])])])).
0.14/0.44	cnf(c_0_23, plain, (leq(X1,n0)|~leq(X1,tptp_minus_1)), inference(spm,[status(thm)],[c_0_17, c_0_16])).
0.14/0.44	cnf(c_0_24, negated_conjecture, (leq(esk2_0,tptp_minus_1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19]), c_0_20])).
0.14/0.44	fof(c_0_25, plain, ![X1]:(~gt(X1,X1)), inference(fof_simplification,[status(thm)],[irreflexivity_gt])).
0.14/0.44	cnf(c_0_26, plain, (gt(succ(X2),X1)|~leq(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_21])).
0.14/0.44	cnf(c_0_27, plain, (n0=X1|~leq(n0,X1)|~leq(X1,n0)), inference(split_conjunct,[status(thm)],[c_0_22])).
0.14/0.44	cnf(c_0_28, negated_conjecture, (leq(esk2_0,n0)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.14/0.44	cnf(c_0_29, negated_conjecture, (leq(n0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.14/0.44	fof(c_0_30, plain, ![X66]:(~gt(X66,X66)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_25])])).
0.14/0.44	cnf(c_0_31, negated_conjecture, (gt(n0,esk2_0)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_24]), c_0_16])).
0.14/0.44	cnf(c_0_32, negated_conjecture, (esk2_0=n0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])])).
0.14/0.44	cnf(c_0_33, plain, (~gt(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_30])).
0.14/0.44	cnf(c_0_34, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32]), c_0_33]), ['proof']).
0.14/0.44	% SZS output end CNFRefutation
0.14/0.44	% Parsed axioms                        : 100
0.14/0.44	% Removed by relevancy pruning/SinE    : 22
0.14/0.44	% Initial clauses                      : 88
0.14/0.44	% Removed in clause preprocessing      : 0
0.14/0.44	% Initial clauses in saturation        : 88
0.14/0.44	% Processed clauses                    : 124
0.14/0.44	% ...of these trivial                  : 0
0.14/0.44	% ...subsumed                          : 2
0.14/0.44	% ...remaining for further processing  : 122
0.14/0.44	% Other redundant clauses eliminated   : 0
0.14/0.44	% Clauses deleted for lack of memory   : 0
0.14/0.44	% Backward-subsumed                    : 0
0.14/0.44	% Backward-rewritten                   : 10
0.14/0.44	% Generated clauses                    : 134
0.14/0.44	% ...of the previous two non-redundant : 92
0.14/0.44	% ...aggressively subsumed             : 0
0.14/0.44	% Contextual simplify-reflections      : 0
0.14/0.44	% Paramodulations                      : 132
0.14/0.44	% Factorizations                       : 2
0.14/0.44	% NegExts                              : 0
0.14/0.44	% Equation resolutions                 : 0
0.14/0.44	% Disequality decompositions           : 0
0.14/0.44	% Total rewrite steps                  : 82
0.14/0.44	% ...of those cached                   : 52
0.14/0.44	% Propositional unsat checks           : 0
0.14/0.44	%    Propositional check models        : 0
0.14/0.44	%    Propositional check unsatisfiable : 0
0.14/0.44	%    Propositional clauses             : 0
0.14/0.44	%    Propositional clauses after purity: 0
0.14/0.44	%    Propositional unsat core size     : 0
0.14/0.44	%    Propositional preprocessing time  : 0.000
0.14/0.44	%    Propositional encoding time       : 0.000
0.14/0.44	%    Propositional solver time         : 0.000
0.14/0.44	%    Success case prop preproc time    : 0.000
0.14/0.44	%    Success case prop encoding time   : 0.000
0.14/0.44	%    Success case prop solver time     : 0.000
0.14/0.44	% Current number of processed clauses  : 112
0.14/0.44	%    Positive orientable unit clauses  : 72
0.14/0.44	%    Positive unorientable unit clauses: 0
0.14/0.44	%    Negative unit clauses             : 9
0.14/0.44	%    Non-unit-clauses                  : 31
0.14/0.44	% Current number of unprocessed clauses: 56
0.14/0.44	% ...number of literals in the above   : 150
0.14/0.44	% Current number of archived formulas  : 0
0.14/0.44	% Current number of archived clauses   : 10
0.14/0.44	% Clause-clause subsumption calls (NU) : 104
0.14/0.44	% Rec. Clause-clause subsumption calls : 101
0.14/0.44	% Non-unit clause-clause subsumptions  : 1
0.14/0.44	% Unit Clause-clause subsumption calls : 64
0.14/0.44	% Rewrite failures with RHS unbound    : 0
0.14/0.44	% BW rewrite match attempts            : 7
0.14/0.44	% BW rewrite match successes           : 4
0.14/0.44	% Condensation attempts                : 0
0.14/0.44	% Condensation successes               : 0
0.14/0.44	% Termbank termtop insertions          : 5317
0.14/0.44	% Search garbage collected termcells   : 727
0.14/0.44	
0.14/0.44	% -------------------------------------------------
0.14/0.44	% User time                : 0.010 s
0.14/0.44	% System time              : 0.002 s
0.14/0.44	% Total time               : 0.011 s
0.14/0.44	% Maximum resident set size: 3956 pages
0.14/0.44	
0.14/0.44	% -------------------------------------------------
0.14/0.44	% User time                : 0.012 s
0.14/0.44	% System time              : 0.007 s
0.14/0.44	% Total time               : 0.019 s
0.14/0.44	% Maximum resident set size: 4608 pages
0.14/0.44	% E exiting
0.14/0.45	EOF