%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:28:09 PM UTC 2026
% Result : Theorem 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 10 unt; 0 def)
% Number of atoms : 139 ( 39 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 181 ( 82 ~; 48 |; 47 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 61 ( 2 sgn 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl462,conjecture,
? [X1,X2] :
( ( ( in_lopen(X2,v0,v400)
& ~ in_lopen(X1,v0,v600) )
| ( ~ in_lopen(X2,v0,v400)
& in_lopen(X1,v0,v600) ) )
& in_lopen(X2,v0,v200)
& leq(v800,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl462) ).
fof(leq_trans,axiom,
! [X1,X2,X3] :
( ( leq(X2,X3)
& leq(X1,X2) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(leq_def,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( X1 = X2
| less(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(in_lopen,axiom,
! [X1,X4,X5] :
( in_lopen(X1,X4,X5)
<=> ( leq(X1,X5)
& less(X4,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_lopen) ).
fof(ord_v200_v400,axiom,
less(v200,v400),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(ord_v0_v200,axiom,
less(v0,v200),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v0_v200) ).
fof(leq_antisym,axiom,
! [X1,X2] :
( ( leq(X2,X1)
& leq(X1,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).
fof(distinct,axiom,
( v600 != v800
& v400 != v800
& v400 != v600
& v200 != v800
& v200 != v600
& v200 != v400
& v0 != v800
& v0 != v600
& v0 != v400
& v0 != v200 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
fof(ord_v600_v800,axiom,
less(v600,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(c_0_9,negated_conjecture,
~ ? [X1,X2] :
( ( ( in_lopen(X2,v0,v400)
& ~ in_lopen(X1,v0,v600) )
| ( ~ in_lopen(X2,v0,v400)
& in_lopen(X1,v0,v600) ) )
& in_lopen(X2,v0,v200)
& leq(v800,X1) ),
inference(assume_negation,[status(cth)],[odrl462]) ).
fof(c_0_10,negated_conjecture,
~ ? [X1,X2] :
( ( ( in_lopen(X2,v0,v400)
& ~ in_lopen(X1,v0,v600) )
| ( ~ in_lopen(X2,v0,v400)
& in_lopen(X1,v0,v600) ) )
& in_lopen(X2,v0,v200)
& leq(v800,X1) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X31,X32,X33] :
( leq(X31,X33)
| ~ leq(X32,X33)
| ~ leq(X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_trans])])]) ).
fof(c_0_12,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])])])]) ).
fof(c_0_13,negated_conjecture,
! [X85,X86] :
( ( ~ in_lopen(X86,v0,v200)
| ~ leq(v800,X85)
| ~ in_lopen(X86,v0,v400)
| in_lopen(X85,v0,v600) )
& ( ~ in_lopen(X86,v0,v200)
| ~ leq(v800,X85)
| in_lopen(X86,v0,v400)
| ~ in_lopen(X85,v0,v600) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,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])])])]) ).
cnf(c_0_15,plain,
( ~ leq(X2,X3)
| ~ leq(X1,X2)
| leq(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ in_lopen(X2,v0,v200)
| ~ leq(v800,X1)
| ~ in_lopen(X2,v0,v400)
| in_lopen(X1,v0,v600) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( ~ leq(X2,X3)
| ~ less(X1,X2)
| in_lopen(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ in_lopen(X2,X1,X3)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ less(X3,X2)
| ~ leq(X1,X3)
| leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
less(v200,v400),
inference(split_conjunct,[status(thm)],[ord_v200_v400]) ).
cnf(c_0_22,negated_conjecture,
( ~ leq(X2,v400)
| ~ leq(v800,X1)
| ~ in_lopen(X2,v0,v200)
| in_lopen(X1,v0,v600) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
( ~ leq(X1,v200)
| leq(X1,v400) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( X1 != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( ~ less(v0,X2)
| ~ leq(X2,v200)
| ~ leq(v800,X1)
| in_lopen(X1,v0,v600) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_23]) ).
cnf(c_0_26,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
less(v0,v200),
inference(split_conjunct,[status(thm)],[ord_v0_v200]) ).
fof(c_0_28,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_29,plain,
( ~ in_lopen(X1,X3,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( ~ leq(v800,X1)
| in_lopen(X1,v0,v600) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
fof(c_0_31,plain,
( v600 != v800
& v400 != v800
& v400 != v600
& v200 != v800
& v200 != v600
& v200 != v400
& v0 != v800
& v0 != v600
& v0 != v400
& v0 != v200 ),
inference(fof_simplification,[status(thm)],[distinct]) ).
cnf(c_0_32,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( ~ leq(v800,X1)
| leq(X1,v600) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_34,plain,
( v600 != v800
& v400 != v800
& v400 != v600
& v200 != v800
& v200 != v600
& v200 != v400
& v0 != v800
& v0 != v600
& v0 != v400
& v0 != v200 ),
inference(fof_nnf,[status(thm)],[c_0_31]) ).
cnf(c_0_35,plain,
( ~ less(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_36,negated_conjecture,
leq(v800,v600),
inference(spm,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_37,plain,
less(v600,v800),
inference(split_conjunct,[status(thm)],[ord_v600_v800]) ).
cnf(c_0_38,plain,
v600 != v800,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n007.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 01:23:35 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 4064868 completed with status 0
% 0.14/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.45 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.45 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.45 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 4064877 completed with status 0
% 0.14/0.45 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.14/0.45 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.45 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.45 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.45 % Preprocessing time : 0.002 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Theorem
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 44
% 0.14/0.45 % Removed by relevancy pruning/SinE : 0
% 0.14/0.45 % Initial clauses : 72
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 72
% 0.14/0.45 % Processed clauses : 321
% 0.14/0.45 % ...of these trivial : 0
% 0.14/0.45 % ...subsumed : 153
% 0.14/0.45 % ...remaining for further processing : 168
% 0.14/0.45 % Other redundant clauses eliminated : 1
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 4
% 0.14/0.45 % Backward-rewritten : 2
% 0.14/0.45 % Generated clauses : 753
% 0.14/0.45 % ...of the previous two non-redundant : 672
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 4
% 0.14/0.45 % Paramodulations : 748
% 0.14/0.45 % Factorizations : 4
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 1
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 87
% 0.14/0.45 % ...of those cached : 73
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 161
% 0.14/0.45 % Positive orientable unit clauses : 21
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 30
% 0.14/0.45 % Non-unit-clauses : 110
% 0.14/0.45 % Current number of unprocessed clauses: 419
% 0.14/0.45 % ...number of literals in the above : 1302
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 6
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 1909
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 1153
% 0.14/0.45 % Non-unit clause-clause subsumptions : 36
% 0.14/0.45 % Unit Clause-clause subsumption calls : 129
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 9
% 0.14/0.45 % BW rewrite match successes : 1
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 11436
% 0.14/0.45 % Search garbage collected termcells : 819
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.026 s
% 0.14/0.45 % System time : 0.003 s
% 0.14/0.45 % Total time : 0.029 s
% 0.14/0.45 % Maximum resident set size: 3420 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.089 s
% 0.14/0.45 % System time : 0.013 s
% 0.14/0.45 % Total time : 0.102 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------