%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : Tue Sep 8 06:08:03 AM UTC 2026
% Result : Theorem 13.24s 3.06s
% Output : CNFRefutation 13.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 14 unt; 0 nHn; 35 RR)
% Number of literals : 79 ( 6 equ; 46 neg)
% Maximal clause size : 6 ( 2 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 : 52 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_49,negated_conjecture,
( in_lopen(X1,v0,v16)
| ~ in_lopen(X2,v0,v400)
| ~ in_lopen(X3,v0,v600)
| ~ in_lopen(X1,v0,v32) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_49) ).
cnf(i_0_34,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_34) ).
cnf(i_0_42,plain,
( leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_42) ).
cnf(i_0_46,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_46) ).
cnf(i_0_47,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_47) ).
cnf(i_0_56,plain,
less(v0,v600),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_56) ).
cnf(i_0_59,plain,
less(v16,v32),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_59) ).
cnf(i_0_55,plain,
less(v0,v400),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_55) ).
cnf(i_0_35,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_35) ).
cnf(i_0_41,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_41) ).
cnf(i_0_24,plain,
v32 != v16,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_24) ).
cnf(i_0_54,plain,
less(v0,v32),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cxwtkjdo/lgb.p',i_0_54) ).
cnf(c_0_72,negated_conjecture,
( in_lopen(X1,v0,v16)
| ~ in_lopen(X2,v0,v400)
| ~ in_lopen(X3,v0,v600)
| ~ in_lopen(X1,v0,v32) ),
i_0_49 ).
cnf(c_0_73,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
i_0_34 ).
cnf(c_0_74,negated_conjecture,
( in_lopen(X1,v0,v16)
| ~ in_lopen(X2,v0,v400)
| ~ in_lopen(X1,v0,v32)
| ~ leq(X3,v600)
| ~ less(v0,X3) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_75,plain,
( leq(X1,X2)
| X1 != X2 ),
i_0_42 ).
cnf(c_0_76,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
i_0_46 ).
cnf(c_0_77,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
i_0_47 ).
cnf(c_0_78,plain,
( in_lopen(X1,v0,v16)
| ~ in_lopen(X1,v0,v32)
| ~ leq(X2,v600)
| ~ leq(X3,v400)
| ~ less(v0,X2)
| ~ less(v0,X3) ),
inference(spm,[status(thm)],[c_0_74,c_0_73]) ).
cnf(c_0_79,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_75]) ).
cnf(c_0_80,plain,
less(v0,v600),
i_0_56 ).
cnf(c_0_81,plain,
( leq(X1,X2)
| ~ leq(X1,X3)
| ~ less(X3,X2) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_82,plain,
less(v16,v32),
i_0_59 ).
cnf(c_0_83,plain,
( in_lopen(X1,v0,v16)
| ~ in_lopen(X1,v0,v32)
| ~ leq(X2,v400)
| ~ less(v0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_84,plain,
less(v0,v400),
i_0_55 ).
cnf(c_0_85,plain,
( leq(X1,v32)
| ~ leq(X1,v16) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_86,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
i_0_35 ).
cnf(c_0_87,plain,
( in_lopen(X1,v0,v16)
| ~ in_lopen(X1,v0,v32) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_79]),c_0_84])]) ).
cnf(c_0_88,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_41 ).
cnf(c_0_89,plain,
leq(v16,v32),
inference(spm,[status(thm)],[c_0_85,c_0_79]) ).
cnf(c_0_90,plain,
v32 != v16,
i_0_24 ).
cnf(c_0_91,plain,
( leq(X1,v16)
| ~ in_lopen(X1,v0,v32) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_92,plain,
~ leq(v32,v16),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]) ).
cnf(c_0_93,plain,
( leq(X1,v16)
| ~ leq(X1,v32)
| ~ less(v0,X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_73]) ).
cnf(c_0_94,plain,
less(v0,v32),
i_0_54 ).
cnf(c_0_95,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_79]),c_0_94])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT079+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.35 % Computer : n014.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 7 14:14:15 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.45 # ENIGMATIC: Selected SinE mode:
% 0.21/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.24/3.06 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.24/3.06 # No SInE strategy applied
% 13.24/3.06 # Trying AutoSched0 for 150 seconds
% 13.24/3.06 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 13.24/3.06 # and selection function SelectMaxLComplexAvoidPosPred.
% 13.24/3.06 #
% 13.24/3.06 # Preprocessing time : 0.013 s
% 13.24/3.06
% 13.24/3.06 # Proof found!
% 13.24/3.06 # SZS status Theorem
% 13.24/3.06 # SZS output start CNFRefutation
% See solution above
% 13.24/3.06 # Training examples: 0 positive, 0 negative
% 13.24/3.06
% 13.24/3.06 # -------------------------------------------------
% 13.24/3.06 # User time : 0.088 s
% 13.24/3.06 # System time : 0.008 s
% 13.24/3.06 # Total time : 0.096 s
% 13.24/3.06 # Maximum resident set size: 3584 pages
% 13.24/3.06
%------------------------------------------------------------------------------