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.04/0.31	% Computer : n012.cluster.edu
0.04/0.31	% Model    : x86_64 x86_64
0.04/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.04/0.31	% Memory   : 8046.5625MB
0.04/0.31	% OS       : Linux 6.8.0-71-generic
0.04/0.31	% CPULimit : 1440
0.04/0.31	% WCLimit  : 180
0.04/0.31	% DateTime : Mon Jul 27 09:01:18 UTC 2026
0.04/0.31	% CPUTime  : 
0.04/0.31	Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.07/0.34	Running first-order theorem proving
0.07/0.34	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.07/0.35	% Version: 3.5.1
0.07/0.35	% Preprocessing class: FSMSSMSSSSSNFFN.
0.07/0.35	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.07/0.35	% Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores
0.07/0.35	% Starting new_bool_3 with 180s (1) cores
0.07/0.35	% Starting new_bool_1 with 180s (1) cores
0.07/0.35	% Starting sh5l with 180s (1) cores
0.07/0.35	% new_bool_3 with pid 1802689 completed with status 0
0.07/0.35	% Result found by new_bool_3
0.07/0.35	% Preprocessing class: FSMSSMSSSSSNFFN.
0.07/0.35	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.07/0.35	% Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores
0.07/0.35	% Starting new_bool_3 with 180s (1) cores
0.07/0.35	% (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
0.07/0.35	% SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.07/0.35	% Search class: FGHSF-FFSM22-SFFFFFNN
0.07/0.35	% Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.07/0.35	% Starting SubtermCWHack with 19s (1) cores
0.07/0.35	% SubtermCWHack with pid 1802692 completed with status 0
0.07/0.35	% Result found by SubtermCWHack
0.07/0.35	% Preprocessing class: FSMSSMSSSSSNFFN.
0.07/0.35	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.07/0.35	% Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 900s (5) cores
0.07/0.35	% Starting new_bool_3 with 180s (1) cores
0.07/0.35	% (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
0.07/0.35	% SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
0.07/0.35	% Search class: FGHSF-FFSM22-SFFFFFNN
0.07/0.35	% Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.07/0.35	% Starting SubtermCWHack with 19s (1) cores
0.07/0.35	% Preprocessing time       : 0.001 s
0.07/0.35	
0.07/0.35	% Proof found!
0.07/0.35	% SZS status Theorem
0.07/0.35	% SZS output start CNFRefutation
0.07/0.35	fof(transitive, axiom, ![X1, X2, X3]:((less(X1,X3)<=(less(X2,X3)&less(X1,X2)))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax', transitive)).
0.07/0.35	fof(odrl509, conjecture, ?[X1]:((in_lopen(X1,v0,v400)&less(v200,X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', odrl509)).
0.07/0.35	fof(in_lopen, axiom, ![X1, X10, X11]:((in_lopen(X1,X10,X11)<=>(leq(X1,X11)&less(X10,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax', in_lopen)).
0.07/0.35	fof(ord_v0_v200, axiom, less(v0,v200), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ord_v0_v200)).
0.07/0.35	fof(leq_def, axiom, ![X1, X2]:((leq(X1,X2)<=>(less(X1,X2)|X1=X2))), file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax', leq_def)).
0.07/0.35	fof(ord_v200_v400, axiom, less(v200,v400), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ord_v200_v400)).
0.07/0.35	fof(c_0_6, plain, ![X1, X2, X3]:(((less(X2,X3)&less(X1,X2))=>less(X1,X3))), inference(fof_simplification,[status(thm)],[transitive])).
0.07/0.35	fof(c_0_7, negated_conjecture, ~(?[X1]:((in_lopen(X1,v0,v400)&less(v200,X1)))), inference(assume_negation,[status(cth)],[odrl509])).
0.07/0.35	fof(c_0_8, plain, ![X14, X15, X16]:((~less(X15,X16)|~less(X14,X15)|less(X14,X16))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
0.07/0.35	fof(c_0_9, negated_conjecture, ![X13]:((~in_lopen(X13,v0,v400)|~less(v200,X13))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
0.07/0.35	fof(c_0_10, plain, ![X23, X24, X25]:((((leq(X23,X25)|~in_lopen(X23,X24,X25))&(less(X24,X23)|~in_lopen(X23,X24,X25)))&(~leq(X23,X25)|~less(X24,X23)|in_lopen(X23,X24,X25)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])])])).
0.07/0.35	cnf(c_0_11, plain, (less(X3,X2)|~less(X1,X2)|~less(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.07/0.35	cnf(c_0_12, plain, (less(v0,v200)), inference(split_conjunct,[status(thm)],[ord_v0_v200])).
0.07/0.35	fof(c_0_13, plain, ![X29, X30]:(((~leq(X29,X30)|(less(X29,X30)|X29=X30))&((~less(X29,X30)|leq(X29,X30))&(X29!=X30|leq(X29,X30))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])])).
0.07/0.35	cnf(c_0_14, negated_conjecture, (~in_lopen(X1,v0,v400)|~less(v200,X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
0.07/0.35	cnf(c_0_15, plain, (in_lopen(X1,X3,X2)|~leq(X1,X2)|~less(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
0.07/0.35	cnf(c_0_16, plain, (less(v0,X1)|~less(v200,X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.07/0.35	cnf(c_0_17, plain, (leq(X1,X2)|X1!=X2), inference(split_conjunct,[status(thm)],[c_0_13])).
0.07/0.35	cnf(c_0_18, negated_conjecture, (~leq(X1,v400)|~less(v200,X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])).
0.07/0.35	cnf(c_0_19, plain, (leq(X1,X1)), inference(er,[status(thm)],[c_0_17])).
0.07/0.35	cnf(c_0_20, plain, (less(v200,v400)), inference(split_conjunct,[status(thm)],[ord_v200_v400])).
0.07/0.35	cnf(c_0_21, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])]), ['proof']).
0.07/0.35	% SZS output end CNFRefutation
0.07/0.35	% Parsed axioms                        : 40
0.07/0.35	% Removed by relevancy pruning/SinE    : 17
0.07/0.35	% Initial clauses                      : 33
0.07/0.35	% Removed in clause preprocessing      : 0
0.07/0.35	% Initial clauses in saturation        : 33
0.07/0.35	% Processed clauses                    : 126
0.07/0.35	% ...of these trivial                  : 0
0.07/0.35	% ...subsumed                          : 43
0.07/0.35	% ...remaining for further processing  : 83
0.07/0.35	% Other redundant clauses eliminated   : 1
0.07/0.35	% Clauses deleted for lack of memory   : 0
0.07/0.35	% Backward-subsumed                    : 0
0.07/0.35	% Backward-rewritten                   : 0
0.07/0.35	% Generated clauses                    : 292
0.07/0.35	% ...of the previous two non-redundant : 247
0.07/0.35	% ...aggressively subsumed             : 0
0.07/0.35	% Contextual simplify-reflections      : 1
0.07/0.35	% Paramodulations                      : 289
0.07/0.35	% Factorizations                       : 2
0.07/0.35	% NegExts                              : 0
0.07/0.35	% Equation resolutions                 : 1
0.07/0.35	% Disequality decompositions           : 0
0.07/0.35	% Total rewrite steps                  : 35
0.07/0.35	% ...of those cached                   : 29
0.07/0.35	% Propositional unsat checks           : 0
0.07/0.35	%    Propositional check models        : 0
0.07/0.35	%    Propositional check unsatisfiable : 0
0.07/0.35	%    Propositional clauses             : 0
0.07/0.35	%    Propositional clauses after purity: 0
0.07/0.35	%    Propositional unsat core size     : 0
0.07/0.35	%    Propositional preprocessing time  : 0.000
0.07/0.35	%    Propositional encoding time       : 0.000
0.07/0.35	%    Propositional solver time         : 0.000
0.07/0.35	%    Success case prop preproc time    : 0.000
0.07/0.35	%    Success case prop encoding time   : 0.000
0.07/0.35	%    Success case prop solver time     : 0.000
0.07/0.35	% Current number of processed clauses  : 82
0.07/0.35	%    Positive orientable unit clauses  : 13
0.07/0.35	%    Positive unorientable unit clauses: 0
0.07/0.35	%    Negative unit clauses             : 15
0.07/0.35	%    Non-unit-clauses                  : 54
0.07/0.35	% Current number of unprocessed clauses: 152
0.07/0.35	% ...number of literals in the above   : 530
0.07/0.35	% Current number of archived formulas  : 0
0.07/0.35	% Current number of archived clauses   : 0
0.07/0.35	% Clause-clause subsumption calls (NU) : 199
0.07/0.35	% Rec. Clause-clause subsumption calls : 185
0.07/0.35	% Non-unit clause-clause subsumptions  : 25
0.07/0.35	% Unit Clause-clause subsumption calls : 3
0.07/0.35	% Rewrite failures with RHS unbound    : 0
0.07/0.35	% BW rewrite match attempts            : 0
0.07/0.35	% BW rewrite match successes           : 0
0.07/0.35	% Condensation attempts                : 0
0.07/0.35	% Condensation successes               : 0
0.07/0.35	% Termbank termtop insertions          : 4392
0.07/0.35	% Search garbage collected termcells   : 369
0.07/0.35	
0.07/0.35	% -------------------------------------------------
0.07/0.35	% User time                : 0.006 s
0.07/0.35	% System time              : 0.001 s
0.07/0.35	% Total time               : 0.007 s
0.07/0.35	% Maximum resident set size: 3672 pages
0.07/0.35	
0.07/0.35	% -------------------------------------------------
0.07/0.35	% User time                : 0.007 s
0.07/0.35	% System time              : 0.003 s
0.07/0.35	% Total time               : 0.010 s
0.07/0.35	% Maximum resident set size: 4608 pages
0.07/0.35	% E exiting
0.07/0.36	EOF