%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT080+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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 11.60s 3.91s
% Output : CNFRefutation 11.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 28 ( 5 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 16 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_48,plain,
( leq(X1,X2)
| ~ in_closed(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0qw92_2z/lgb.p',i_0_48) ).
cnf(i_0_73,negated_conjecture,
in_closed(esk4_0,v800,v800),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0qw92_2z/lgb.p',i_0_73) ).
cnf(i_0_47,plain,
( leq(X1,X2)
| ~ in_closed(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0qw92_2z/lgb.p',i_0_47) ).
cnf(i_0_74,negated_conjecture,
in_closed(esk4_0,v600,v600),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0qw92_2z/lgb.p',i_0_74) ).
cnf(i_0_59,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0qw92_2z/lgb.p',i_0_59) ).
cnf(i_0_10,plain,
v800 != v600,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0qw92_2z/lgb.p',i_0_10) ).
cnf(c_0_81,plain,
( leq(X1,X2)
| ~ in_closed(X2,X1,X3) ),
i_0_48 ).
cnf(c_0_82,negated_conjecture,
in_closed(esk4_0,v800,v800),
i_0_73 ).
cnf(c_0_83,plain,
( leq(X1,X2)
| ~ in_closed(X1,X3,X2) ),
i_0_47 ).
cnf(c_0_84,negated_conjecture,
in_closed(esk4_0,v600,v600),
i_0_74 ).
cnf(c_0_85,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_59 ).
cnf(c_0_86,negated_conjecture,
leq(v800,esk4_0),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,negated_conjecture,
leq(esk4_0,v800),
inference(spm,[status(thm)],[c_0_83,c_0_82]) ).
cnf(c_0_88,negated_conjecture,
leq(v600,esk4_0),
inference(spm,[status(thm)],[c_0_81,c_0_84]) ).
cnf(c_0_89,plain,
esk4_0 = v800,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87])]) ).
cnf(c_0_90,negated_conjecture,
leq(v600,v800),
inference(rw,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_91,plain,
v800 != v600,
i_0_10 ).
cnf(c_0_92,negated_conjecture,
leq(esk4_0,v600),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_93,plain,
~ leq(v800,v600),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_90]),c_0_91]) ).
cnf(c_0_94,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_89]),c_0_93]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT080+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.35 % Computer : n011.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 7 14:15:02 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.45 # ENIGMATIC: Selected SinE mode:
% 0.13/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.13/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.13/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.60/3.91 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.60/3.91 # No SInE strategy applied
% 11.60/3.91 # Trying AutoSched0 for 150 seconds
% 11.60/3.91 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 11.60/3.91 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.60/3.91 #
% 11.60/3.91 # Preprocessing time : 0.014 s
% 11.60/3.91
% 11.60/3.91 # Proof found!
% 11.60/3.91 # SZS status Theorem
% 11.60/3.91 # SZS output start CNFRefutation
% See solution above
% 11.60/3.91 # Training examples: 0 positive, 0 negative
% 11.60/3.91
% 11.60/3.91 # -------------------------------------------------
% 11.60/3.91 # User time : 0.019 s
% 11.60/3.91 # System time : 0.000 s
% 11.60/3.91 # Total time : 0.019 s
% 11.60/3.91 # Maximum resident set size: 3584 pages
% 11.60/3.91
%------------------------------------------------------------------------------