%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT085+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 : n009.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:01 PM UTC 2026
% Result : Theorem 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 27 unt; 0 def)
% Number of atoms : 156 ( 52 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 161 ( 64 ~; 50 |; 43 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 43 ( 1 sgn 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl445,conjecture,
~ ? [X1,X2,X3] :
( leq(v100,X3)
& leq(v200,X2)
& leq(v400,X1)
& ( in_lopen(X3,v0,v50)
| in_lopen(X2,v0,v100)
| in_lopen(X1,v0,v200) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',odrl445) ).
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(less_leq_trans,axiom,
! [X1,X2,X3] :
( ( leq(X2,X3)
& less(X1,X2) )
=> less(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).
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_v100_v200,axiom,
less(v100,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v100_v200) ).
fof(leq_antisym,axiom,
! [X1,X2] :
( ( leq(X2,X1)
& leq(X1,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(ord_v200_v400,axiom,
less(v200,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(ord_v50_v100,axiom,
less(v50,v100),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v50_v100) ).
fof(distinct,axiom,
( v200 != v400
& v100 != v400
& v100 != v200
& v50 != v400
& v50 != v200
& v50 != v100
& v0 != v400
& v0 != v200
& v0 != v100
& v0 != v50 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(c_0_10,negated_conjecture,
~ ~ ? [X1,X2,X3] :
( leq(v100,X3)
& leq(v200,X2)
& leq(v400,X1)
& ( in_lopen(X3,v0,v50)
| in_lopen(X2,v0,v100)
| in_lopen(X1,v0,v200) ) ),
inference(assume_negation,[status(cth)],[odrl445]) ).
fof(c_0_11,plain,
! [X37,X38,X39] :
( ( in_lopen(X37,X38,X39)
| ~ leq(X37,X39)
| ~ less(X38,X37) )
& ( ~ in_lopen(X37,X38,X39)
| leq(X37,X39) )
& ( ~ in_lopen(X37,X38,X39)
| less(X38,X37) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])])]) ).
fof(c_0_12,negated_conjecture,
( leq(v100,esk6_0)
& leq(v200,esk5_0)
& leq(v400,esk4_0)
& ( in_lopen(esk6_0,v0,v50)
| in_lopen(esk5_0,v0,v100)
| in_lopen(esk4_0,v0,v200) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_13,plain,
! [X28,X29,X30] :
( less(X28,X30)
| ~ leq(X29,X30)
| ~ less(X28,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_leq_trans])])]) ).
cnf(c_0_14,plain,
( ~ in_lopen(X1,X3,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( in_lopen(esk6_0,v0,v50)
| in_lopen(esk5_0,v0,v100)
| in_lopen(esk4_0,v0,v200) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ leq(X2,X3)
| ~ less(X1,X2)
| less(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
leq(v200,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( leq(esk4_0,v200)
| in_lopen(esk5_0,v0,v100)
| in_lopen(esk6_0,v0,v50) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
leq(v400,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,plain,
! [X19,X20] :
( ( leq(X19,X20)
| X19 != X20 )
& ( leq(X19,X20)
| ~ less(X19,X20) )
& ( X19 = X20
| less(X19,X20)
| ~ leq(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ less(X1,v200)
| less(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
less(v100,v200),
inference(split_conjunct,[status(thm)],[ord_v100_v200]) ).
fof(c_0_23,plain,
! [X21,X22] :
( X21 = X22
| ~ leq(X22,X21)
| ~ leq(X21,X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])])]) ).
cnf(c_0_24,negated_conjecture,
( leq(esk5_0,v100)
| leq(esk4_0,v200)
| in_lopen(esk6_0,v0,v50) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( ~ less(X1,v400)
| less(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_26,plain,
less(v200,v400),
inference(split_conjunct,[status(thm)],[ord_v200_v400]) ).
cnf(c_0_27,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
less(v100,esk5_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( leq(esk6_0,v50)
| leq(esk4_0,v200)
| leq(esk5_0,v100) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
less(v200,esk4_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
leq(v100,esk5_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( ~ leq(v200,esk4_0)
| leq(esk5_0,v100)
| leq(esk6_0,v50)
| esk4_0 = v200 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
leq(v200,esk4_0),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
leq(v100,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( ~ leq(esk5_0,v100)
| esk5_0 = v100 ),
inference(spm,[status(thm)],[c_0_29,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( leq(esk6_0,v50)
| leq(esk5_0,v100)
| esk4_0 = v200 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
( ~ less(X1,v100)
| less(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_39,plain,
less(v50,v100),
inference(split_conjunct,[status(thm)],[ord_v50_v100]) ).
fof(c_0_40,plain,
( v200 != v400
& v100 != v400
& v100 != v200
& v50 != v400
& v50 != v200
& v50 != v100
& v0 != v400
& v0 != v200
& v0 != v100
& v0 != v50 ),
inference(fof_simplification,[status(thm)],[distinct]) ).
cnf(c_0_41,negated_conjecture,
( leq(esk6_0,v50)
| esk5_0 = v100
| esk4_0 = v200 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
less(v50,esk6_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_43,plain,
( v200 != v400
& v100 != v400
& v100 != v200
& v50 != v400
& v50 != v200
& v50 != v100
& v0 != v400
& v0 != v200
& v0 != v100
& v0 != v50 ),
inference(fof_nnf,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( ~ leq(v50,esk6_0)
| esk6_0 = v50
| esk4_0 = v200
| esk5_0 = v100 ),
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
leq(v50,esk6_0),
inference(spm,[status(thm)],[c_0_27,c_0_42]) ).
cnf(c_0_46,plain,
leq(v200,v400),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_47,plain,
v200 != v400,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( esk5_0 = v100
| esk4_0 = v200
| esk6_0 = v50 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_49,plain,
~ leq(v400,v200),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_46]),c_0_47]) ).
cnf(c_0_50,plain,
leq(v100,v200),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_51,plain,
v100 != v200,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_52,plain,
! [X1] : ~ less(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexive]) ).
cnf(c_0_53,negated_conjecture,
( esk6_0 = v50
| esk5_0 = v100 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_48]),c_0_49]) ).
cnf(c_0_54,plain,
~ leq(v200,v100),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_50]),c_0_51]) ).
fof(c_0_55,plain,
! [X13] : ~ less(X13,X13),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_52])]) ).
cnf(c_0_56,negated_conjecture,
esk6_0 = v50,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_53]),c_0_54]) ).
cnf(c_0_57,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT085+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.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 01:25:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.14/0.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 553623 completed with status 0
% 0.14/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.46 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.46 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 553631 completed with status 0
% 0.14/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.46 % Preprocessing time : 0.002 s
% 0.14/0.46 % Presaturation interreduction done
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Theorem
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 44
% 0.14/0.46 % Removed by relevancy pruning/SinE : 0
% 0.14/0.46 % Initial clauses : 74
% 0.14/0.46 % Removed in clause preprocessing : 0
% 0.14/0.46 % Initial clauses in saturation : 74
% 0.14/0.46 % Processed clauses : 238
% 0.14/0.46 % ...of these trivial : 1
% 0.14/0.46 % ...subsumed : 4
% 0.14/0.46 % ...remaining for further processing : 233
% 0.14/0.46 % Other redundant clauses eliminated : 7
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 1
% 0.14/0.46 % Backward-rewritten : 22
% 0.14/0.46 % Generated clauses : 377
% 0.14/0.46 % ...of the previous two non-redundant : 339
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 0
% 0.14/0.46 % Paramodulations : 369
% 0.14/0.46 % Factorizations : 2
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 7
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 67
% 0.14/0.46 % ...of those cached : 27
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 131
% 0.14/0.46 % Positive orientable unit clauses : 55
% 0.14/0.46 % Positive unorientable unit clauses: 0
% 0.14/0.46 % Negative unit clauses : 24
% 0.14/0.46 % Non-unit-clauses : 52
% 0.14/0.46 % Current number of unprocessed clauses: 247
% 0.14/0.46 % ...number of literals in the above : 604
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 96
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 629
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 542
% 0.14/0.46 % Non-unit clause-clause subsumptions : 5
% 0.14/0.46 % Unit Clause-clause subsumption calls : 177
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 15
% 0.14/0.46 % BW rewrite match successes : 5
% 0.14/0.46 % Condensation attempts : 0
% 0.14/0.46 % Condensation successes : 0
% 0.14/0.46 % Termbank termtop insertions : 7070
% 0.14/0.46 % Search garbage collected termcells : 796
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.017 s
% 0.14/0.46 % System time : 0.004 s
% 0.14/0.46 % Total time : 0.021 s
% 0.14/0.46 % Maximum resident set size: 3676 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.058 s
% 0.14/0.46 % System time : 0.016 s
% 0.14/0.46 % Total time : 0.075 s
% 0.14/0.46 % Maximum resident set size: 4608 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------