%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:27:02 PM UTC 2026
% Result : Theorem 0.16s 5.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 35 ( 4 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 35 ( 15 ~; 13 |; 5 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 21 ( 1 sgn 11 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl500,conjecture,
? [X1] : in_lopen(X1,v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl500) ).
fof(in_lopen,axiom,
! [X1,X4,X5] :
( in_lopen(X1,X4,X5)
<=> ( leq(X1,X5)
& less(X4,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(leq_def,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( X1 = X2
| less(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(ord_v0_v600,axiom,
less(v0,v600),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v600) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] : in_lopen(X1,v0,v600),
inference(assume_negation,[status(cth)],[odrl500]) ).
fof(c_0_5,negated_conjecture,
! [X13] : ~ in_lopen(X13,v0,v600),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X14,X15,X16] :
( ( in_lopen(X14,X15,X16)
| ~ leq(X14,X16)
| ~ less(X15,X14) )
& ( ~ in_lopen(X14,X15,X16)
| leq(X14,X16) )
& ( ~ in_lopen(X14,X15,X16)
| less(X15,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])])]) ).
fof(c_0_7,plain,
! [X17,X18] :
( ( leq(X17,X18)
| X17 != X18 )
& ( leq(X17,X18)
| ~ less(X17,X18) )
& ( X17 = X18
| less(X17,X18)
| ~ leq(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])]) ).
cnf(c_0_8,negated_conjecture,
~ in_lopen(X1,v0,v600),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ leq(X2,X3)
| ~ less(X1,X2)
| in_lopen(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ less(v0,X1)
| ~ leq(X1,v600) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
less(v0,v600),
inference(split_conjunct,[status(thm)],[ord_v0_v600]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.40 % Computer : n004.cluster.edu
% 0.13/5.40 % Model : x86_64 x86_64
% 0.13/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.40 % Memory : 8046.5625MB
% 0.13/5.40 % OS : Linux 6.8.0-71-generic
% 0.16/5.40 % CPULimit : 300
% 0.16/5.40 % WCLimit : 300
% 0.16/5.40 % DateTime : Mon Sep 21 01:25:24 UTC 2026
% 0.16/5.40 % CPUTime :
% 0.16/5.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.45 Running first-order theorem proving
% 0.16/5.45 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=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/5.47 % Version: 3.5.1
% 0.16/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.47 % Starting sh5l with 300s (1) cores
% 0.16/5.47 % new_bool_3 with pid 1963184 completed with status 0
% 0.16/5.47 % Result found by new_bool_3
% 0.16/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.47 % Search class: FGUSF-FFSM00-SFFFFFNN
% 0.16/5.47 % partial match(1): FGUNF-FFSM00-SFFFFFNN
% 0.16/5.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.47 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.47 % SubtermCWHack with pid 1963187 completed with status 0
% 0.16/5.47 % Result found by SubtermCWHack
% 0.16/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.47 % Search class: FGUSF-FFSM00-SFFFFFNN
% 0.16/5.47 % partial match(1): FGUNF-FFSM00-SFFFFFNN
% 0.16/5.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.47 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.47 % Preprocessing time : 0.001 s
% 0.16/5.47
% 0.16/5.47 % Proof found!
% 0.16/5.47 % SZS status Theorem
% 0.16/5.47 % SZS output start CNFRefutation
% See solution above
% 0.16/5.48 % Parsed axioms : 35
% 0.16/5.48 % Removed by relevancy pruning/SinE : 17
% 0.16/5.48 % Initial clauses : 24
% 0.16/5.48 % Removed in clause preprocessing : 0
% 0.16/5.48 % Initial clauses in saturation : 24
% 0.16/5.48 % Processed clauses : 34
% 0.16/5.48 % ...of these trivial : 0
% 0.16/5.48 % ...subsumed : 3
% 0.16/5.48 % ...remaining for further processing : 31
% 0.16/5.48 % Other redundant clauses eliminated : 1
% 0.16/5.48 % Clauses deleted for lack of memory : 0
% 0.16/5.48 % Backward-subsumed : 0
% 0.16/5.48 % Backward-rewritten : 0
% 0.16/5.48 % Generated clauses : 36
% 0.16/5.48 % ...of the previous two non-redundant : 21
% 0.16/5.48 % ...aggressively subsumed : 0
% 0.16/5.48 % Contextual simplify-reflections : 0
% 0.16/5.48 % Paramodulations : 33
% 0.16/5.48 % Factorizations : 2
% 0.16/5.48 % NegExts : 0
% 0.16/5.48 % Equation resolutions : 1
% 0.16/5.48 % Disequality decompositions : 0
% 0.16/5.48 % Total rewrite steps : 7
% 0.16/5.48 % ...of those cached : 4
% 0.16/5.48 % Propositional unsat checks : 0
% 0.16/5.48 % Propositional check models : 0
% 0.16/5.48 % Propositional check unsatisfiable : 0
% 0.16/5.48 % Propositional clauses : 0
% 0.16/5.48 % Propositional clauses after purity: 0
% 0.16/5.48 % Propositional unsat core size : 0
% 0.16/5.48 % Propositional preprocessing time : 0.000
% 0.16/5.48 % Propositional encoding time : 0.000
% 0.16/5.48 % Propositional solver time : 0.000
% 0.16/5.48 % Success case prop preproc time : 0.000
% 0.16/5.48 % Success case prop encoding time : 0.000
% 0.16/5.48 % Success case prop solver time : 0.000
% 0.16/5.48 % Current number of processed clauses : 30
% 0.16/5.48 % Positive orientable unit clauses : 7
% 0.16/5.48 % Positive unorientable unit clauses: 0
% 0.16/5.48 % Negative unit clauses : 6
% 0.16/5.48 % Non-unit-clauses : 17
% 0.16/5.48 % Current number of unprocessed clauses: 11
% 0.16/5.48 % ...number of literals in the above : 37
% 0.16/5.48 % Current number of archived formulas : 0
% 0.16/5.48 % Current number of archived clauses : 0
% 0.16/5.48 % Clause-clause subsumption calls (NU) : 20
% 0.16/5.48 % Rec. Clause-clause subsumption calls : 20
% 0.16/5.48 % Non-unit clause-clause subsumptions : 3
% 0.16/5.48 % Unit Clause-clause subsumption calls : 0
% 0.16/5.48 % Rewrite failures with RHS unbound : 0
% 0.16/5.48 % BW rewrite match attempts : 0
% 0.16/5.48 % BW rewrite match successes : 0
% 0.16/5.48 % Condensation attempts : 0
% 0.16/5.48 % Condensation successes : 0
% 0.16/5.48 % Termbank termtop insertions : 1611
% 0.16/5.48 % Search garbage collected termcells : 316
% 0.16/5.48
% 0.16/5.48 % -------------------------------------------------
% 0.16/5.48 % User time : 0.004 s
% 0.16/5.48 % System time : 0.003 s
% 0.16/5.48 % Total time : 0.007 s
% 0.16/5.48 % Maximum resident set size: 3668 pages
% 0.16/5.48
% 0.16/5.48 % -------------------------------------------------
% 0.16/5.48 % User time : 0.005 s
% 0.16/5.48 % System time : 0.009 s
% 0.16/5.48 % Total time : 0.014 s
% 0.16/5.48 % Maximum resident set size: 4864 pages
% 0.16/5.48 % E exiting
%------------------------------------------------------------------------------