%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MGT086+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 : n014.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.26s 0.60s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 15 unt; 0 def)
% Number of atoms : 119 ( 38 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 150 ( 68 ~; 33 |; 46 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 41 ( 1 sgn 16 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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(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/sandbox/benchmark/theBenchmark.p',odrl462) ).
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(ord_v200_v400,axiom,
less(v200,v400),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v200_v400) ).
fof(ord_v0_v200,axiom,
less(v0,v200),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v0_v200) ).
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/sandbox/benchmark/theBenchmark.p',distinct) ).
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_v600_v800,axiom,
less(v600,v800),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(c_0_8,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_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,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_11,plain,
( X1 != X2
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
less(v200,v400),
inference(split_conjunct,[status(thm)],[ord_v200_v400]) ).
fof(c_0_14,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]) ).
cnf(c_0_15,plain,
( ~ leq(X2,X3)
| ~ less(X1,X2)
| in_lopen(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
leq(v200,v400),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,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_14])])])]) ).
cnf(c_0_19,plain,
( ~ less(X2,X1)
| in_lopen(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
less(v0,v200),
inference(split_conjunct,[status(thm)],[ord_v0_v200]) ).
cnf(c_0_21,plain,
( ~ less(X1,v200)
| in_lopen(v200,X1,v400) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
fof(c_0_22,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_23,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_18]) ).
cnf(c_0_24,plain,
in_lopen(v200,v0,v200),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
in_lopen(v200,v0,v400),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
fof(c_0_26,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_27,plain,
less(v600,v800),
inference(split_conjunct,[status(thm)],[ord_v600_v800]) ).
fof(c_0_28,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_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ leq(v800,X1)
| in_lopen(X1,v0,v600) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
leq(v600,v800),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_32,plain,
v600 != v800,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( ~ in_lopen(X1,X3,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_34,negated_conjecture,
in_lopen(v800,v0,v600),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_35,plain,
~ leq(v800,v600),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n014.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 01:25:34 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.52 Running first-order theorem proving
% 0.19/0.52 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.26/0.60 % Version: 3.5.1
% 0.26/0.60 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.60 % Starting sh5l with 300s (1) cores
% 0.26/0.60 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2861980 completed with status 0
% 0.26/0.60 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.26/0.60 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.60 % No SInE strategy applied
% 0.26/0.60 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.26/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.26/0.60 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.60 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.26/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.60 % new_bool_3 with pid 2861990 completed with status 0
% 0.26/0.60 % Result found by new_bool_3
% 0.26/0.60 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.26/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.26/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.60 % No SInE strategy applied
% 0.26/0.60 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.26/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.60 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.26/0.60 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.60 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.26/0.60 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.60 % Preprocessing time : 0.003 s
% 0.26/0.60 % Presaturation interreduction done
% 0.26/0.60
% 0.26/0.60 % Proof found!
% 0.26/0.60 % SZS status Theorem
% 0.26/0.60 % SZS output start CNFRefutation
% See solution above
% 0.26/0.60 % Parsed axioms : 44
% 0.26/0.60 % Removed by relevancy pruning/SinE : 0
% 0.26/0.60 % Initial clauses : 72
% 0.26/0.60 % Removed in clause preprocessing : 0
% 0.26/0.60 % Initial clauses in saturation : 72
% 0.26/0.60 % Processed clauses : 247
% 0.26/0.60 % ...of these trivial : 0
% 0.26/0.60 % ...subsumed : 4
% 0.26/0.60 % ...remaining for further processing : 243
% 0.26/0.60 % Other redundant clauses eliminated : 7
% 0.26/0.60 % Clauses deleted for lack of memory : 0
% 0.26/0.60 % Backward-subsumed : 1
% 0.26/0.60 % Backward-rewritten : 0
% 0.26/0.60 % Generated clauses : 350
% 0.26/0.60 % ...of the previous two non-redundant : 232
% 0.26/0.60 % ...aggressively subsumed : 0
% 0.26/0.60 % Contextual simplify-reflections : 0
% 0.26/0.60 % Paramodulations : 340
% 0.26/0.60 % Factorizations : 4
% 0.26/0.60 % NegExts : 0
% 0.26/0.60 % Equation resolutions : 7
% 0.26/0.60 % Disequality decompositions : 0
% 0.26/0.60 % Total rewrite steps : 121
% 0.26/0.60 % ...of those cached : 93
% 0.26/0.60 % Propositional unsat checks : 0
% 0.26/0.60 % Propositional check models : 0
% 0.26/0.60 % Propositional check unsatisfiable : 0
% 0.26/0.60 % Propositional clauses : 0
% 0.26/0.60 % Propositional clauses after purity: 0
% 0.26/0.60 % Propositional unsat core size : 0
% 0.26/0.60 % Propositional preprocessing time : 0.000
% 0.26/0.60 % Propositional encoding time : 0.000
% 0.26/0.60 % Propositional solver time : 0.000
% 0.26/0.60 % Success case prop preproc time : 0.000
% 0.26/0.60 % Success case prop encoding time : 0.000
% 0.26/0.60 % Success case prop solver time : 0.000
% 0.26/0.60 % Current number of processed clauses : 165
% 0.26/0.60 % Positive orientable unit clauses : 61
% 0.26/0.60 % Positive unorientable unit clauses: 0
% 0.26/0.60 % Negative unit clauses : 24
% 0.26/0.60 % Non-unit-clauses : 80
% 0.26/0.60 % Current number of unprocessed clauses: 128
% 0.26/0.60 % ...number of literals in the above : 334
% 0.26/0.60 % Current number of archived formulas : 0
% 0.26/0.60 % Current number of archived clauses : 72
% 0.26/0.60 % Clause-clause subsumption calls (NU) : 693
% 0.26/0.60 % Rec. Clause-clause subsumption calls : 486
% 0.26/0.60 % Non-unit clause-clause subsumptions : 5
% 0.26/0.60 % Unit Clause-clause subsumption calls : 62
% 0.26/0.60 % Rewrite failures with RHS unbound : 0
% 0.26/0.60 % BW rewrite match attempts : 19
% 0.26/0.60 % BW rewrite match successes : 0
% 0.26/0.60 % Condensation attempts : 0
% 0.26/0.60 % Condensation successes : 0
% 0.26/0.60 % Termbank termtop insertions : 7057
% 0.26/0.60 % Search garbage collected termcells : 819
% 0.26/0.60
% 0.26/0.60 % -------------------------------------------------
% 0.26/0.60 % User time : 0.028 s
% 0.26/0.60 % System time : 0.005 s
% 0.26/0.60 % Total time : 0.033 s
% 0.26/0.60 % Maximum resident set size: 3420 pages
% 0.26/0.60
% 0.26/0.60 % -------------------------------------------------
% 0.26/0.60 % User time : 0.110 s
% 0.26/0.60 % System time : 0.022 s
% 0.26/0.60 % Total time : 0.132 s
% 0.26/0.60 % Maximum resident set size: 4864 pages
% 0.26/0.60 % E exiting
%------------------------------------------------------------------------------