%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 : Tue Sep 8 06:08:04 AM UTC 2026
% Result : Theorem 11.50s 3.13s
% Output : CNFRefutation 11.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 42 ( 14 unt; 0 def)
% Number of atoms : 119 ( 16 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 140 ( 63 ~; 48 |; 25 &)
% ( 2 <=>; 2 =>; 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 : 66 ( 2 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl462,conjecture,
? [X1,X2] :
( leq(v800,X1)
& in_lopen(X2,v0,v200)
& ( ( in_lopen(X1,v0,v600)
& ~ in_lopen(X2,v0,v400) )
| ( ~ in_lopen(X1,v0,v600)
& in_lopen(X2,v0,v400) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl462) ).
fof(leq_trans,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(leq_def,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( less(X1,X2)
| 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)
<=> ( less(X4,X1)
& leq(X1,X5) ) ),
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(transitive,axiom,
! [X1,X2,X3] :
( ( less(X1,X2)
& less(X2,X3) )
=> less(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',transitive) ).
fof(irreflexive,axiom,
! [X1] : ~ less(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).
fof(ord_v600_v800,axiom,
less(v600,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v800) ).
fof(distinct,axiom,
( v0 != v200
& v0 != v400
& v0 != v600
& v0 != v800
& v200 != v400
& v200 != v600
& v200 != v800
& v400 != v600
& v400 != v800
& v600 != v800 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
fof(c_0_10,negated_conjecture,
~ ? [X1,X2] :
( leq(v800,X1)
& in_lopen(X2,v0,v200)
& ( ( in_lopen(X1,v0,v600)
& ~ in_lopen(X2,v0,v400) )
| ( ~ in_lopen(X1,v0,v600)
& in_lopen(X2,v0,v400) ) ) ),
inference(assume_negation,[status(cth)],[odrl462]) ).
fof(c_0_11,plain,
! [X31,X32,X33] :
( ~ leq(X31,X32)
| ~ leq(X32,X33)
| leq(X31,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_trans])]) ).
fof(c_0_12,plain,
! [X19,X20] :
( ( ~ leq(X19,X20)
| less(X19,X20)
| X19 = X20 )
& ( ~ less(X19,X20)
| leq(X19,X20) )
& ( X19 != X20
| leq(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
fof(c_0_13,negated_conjecture,
! [X85,X86] :
( ( ~ in_lopen(X85,v0,v600)
| in_lopen(X86,v0,v400)
| ~ leq(v800,X85)
| ~ in_lopen(X86,v0,v200) )
& ( in_lopen(X85,v0,v600)
| ~ in_lopen(X86,v0,v400)
| ~ leq(v800,X85)
| ~ in_lopen(X86,v0,v200) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X37,X38,X39] :
( ( less(X38,X37)
| ~ in_lopen(X37,X38,X39) )
& ( leq(X37,X39)
| ~ in_lopen(X37,X38,X39) )
& ( ~ less(X38,X37)
| ~ leq(X37,X39)
| in_lopen(X37,X38,X39) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])]) ).
cnf(c_0_15,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( in_lopen(X1,v0,v600)
| ~ in_lopen(X2,v0,v400)
| ~ leq(v800,X1)
| ~ in_lopen(X2,v0,v200) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( in_lopen(X2,X1,X3)
| ~ less(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( less(X1,X2)
| ~ in_lopen(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( leq(X1,X2)
| ~ leq(X1,X3)
| ~ less(X3,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,
( in_lopen(X1,v0,v600)
| ~ in_lopen(X2,v0,v200)
| ~ leq(v800,X1)
| ~ leq(X2,v400) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
( leq(X1,v400)
| ~ leq(X1,v200) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( in_lopen(X1,v0,v600)
| ~ leq(v800,X1)
| ~ leq(X2,v200)
| ~ less(v0,X2) ),
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,
! [X14,X15,X16] :
( ~ less(X14,X15)
| ~ less(X15,X16)
| less(X14,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitive])]) ).
cnf(c_0_29,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( in_lopen(X1,v0,v600)
| ~ leq(v800,X1) ),
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,
! [X13] : ~ less(X13,X13),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexive])]) ).
cnf(c_0_32,plain,
( less(X1,X3)
| ~ less(X1,X2)
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
less(v600,v800),
inference(split_conjunct,[status(thm)],[ord_v600_v800]) ).
cnf(c_0_34,negated_conjecture,
( leq(X1,v600)
| ~ leq(v800,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
~ less(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
( less(X1,v800)
| ~ less(X1,v600) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( less(X1,X2)
| X1 = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_38,negated_conjecture,
leq(v800,v600),
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_39,plain,
v600 != v800,
inference(split_conjunct,[status(thm)],[distinct]) ).
cnf(c_0_40,plain,
~ less(v800,v600),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT086+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.02/0.36 % CPULimit : 300
% 0.02/0.36 % WCLimit : 300
% 0.02/0.36 % DateTime : Mon Sep 7 14:19:22 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.41 # ENIGMATIC: Selected SinE mode:
% 0.02/0.41 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.41 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.02/0.41 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.02/0.41 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.50/3.13 # ENIGMATIC: Solved by autoschedule:
% 11.50/3.13 # No SInE strategy applied
% 11.50/3.13 # Trying AutoSched0 for 150 seconds
% 11.50/3.13 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 11.50/3.13 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.50/3.13 #
% 11.50/3.13 # Preprocessing time : 0.028 s
% 11.50/3.13
% 11.50/3.13 # Proof found!
% 11.50/3.13 # SZS status Theorem
% 11.50/3.13 # SZS output start CNFRefutation
% See solution above
% 11.50/3.13 # Training examples: 0 positive, 0 negative
% 11.50/3.13
% 11.50/3.13 # -------------------------------------------------
% 11.50/3.13 # User time : 0.044 s
% 11.50/3.13 # System time : 0.007 s
% 11.50/3.13 # Total time : 0.051 s
% 11.50/3.13 # Maximum resident set size: 3584 pages
% 11.50/3.13
%------------------------------------------------------------------------------