%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT092+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n001.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:05 AM UTC 2026
% Result : Theorem 11.99s 3.48s
% Output : CNFRefutation 11.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 14 unt; 0 nHn; 22 RR)
% Number of literals : 39 ( 0 equ; 21 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_37,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzxbv1mn/lgb.p',i_0_37) ).
cnf(i_0_42,plain,
less(v400,v800),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzxbv1mn/lgb.p',i_0_42) ).
cnf(i_0_35,plain,
( less(X1,X2)
| ~ leq(X1,X3)
| ~ less(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzxbv1mn/lgb.p',i_0_35) ).
cnf(i_0_40,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzxbv1mn/lgb.p',i_0_40) ).
cnf(i_0_46,plain,
( completion_conflict(X1,X2,X3,X4)
| ~ leq(X2,X4)
| ~ leq(X1,X4)
| ~ leq(X3,X1)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzxbv1mn/lgb.p',i_0_46) ).
cnf(i_0_43,plain,
less(v800,v1200),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzxbv1mn/lgb.p',i_0_43) ).
cnf(i_0_41,plain,
less(v0,v400),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzxbv1mn/lgb.p',i_0_41) ).
cnf(c_0_54,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
i_0_37 ).
cnf(c_0_55,plain,
less(v400,v800),
i_0_42 ).
cnf(c_0_56,plain,
( less(X1,X2)
| ~ leq(X1,X3)
| ~ less(X3,X2) ),
i_0_35 ).
cnf(c_0_57,plain,
leq(v400,v800),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
~ completion_conflict(v400,v800,v0,v1200),
i_0_40 ).
cnf(c_0_59,plain,
( completion_conflict(X1,X2,X3,X4)
| ~ leq(X2,X4)
| ~ leq(X1,X4)
| ~ leq(X3,X1)
| ~ less(X1,X2) ),
i_0_46 ).
cnf(c_0_60,plain,
less(v800,v1200),
i_0_43 ).
cnf(c_0_61,plain,
less(v0,v400),
i_0_41 ).
cnf(c_0_62,plain,
( less(v400,X1)
| ~ less(v800,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
( ~ leq(v0,v400)
| ~ leq(v800,v1200)
| ~ leq(v400,v1200) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_55])]) ).
cnf(c_0_64,plain,
leq(v800,v1200),
inference(spm,[status(thm)],[c_0_54,c_0_60]) ).
cnf(c_0_65,plain,
leq(v0,v400),
inference(spm,[status(thm)],[c_0_54,c_0_61]) ).
cnf(c_0_66,plain,
less(v400,v1200),
inference(spm,[status(thm)],[c_0_62,c_0_60]) ).
cnf(c_0_67,negated_conjecture,
~ leq(v400,v1200),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64])]),c_0_65])]) ).
cnf(c_0_68,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_66]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT092+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 : n001.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:29:09 UTC 2026
% 0.09/0.35 % 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
% 11.99/3.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.99/3.48 # No SInE strategy applied
% 11.99/3.48 # Trying AutoSched0 for 150 seconds
% 11.99/3.48 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 11.99/3.48 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.99/3.48 #
% 11.99/3.48 # Preprocessing time : 0.013 s
% 11.99/3.48
% 11.99/3.48 # Proof found!
% 11.99/3.48 # SZS status Theorem
% 11.99/3.48 # SZS output start CNFRefutation
% See solution above
% 11.99/3.48 # Training examples: 0 positive, 0 negative
% 11.99/3.48
% 11.99/3.48 # -------------------------------------------------
% 11.99/3.48 # User time : 0.014 s
% 11.99/3.48 # System time : 0.004 s
% 11.99/3.48 # Total time : 0.017 s
% 11.99/3.48 # Maximum resident set size: 3584 pages
% 11.99/3.48
%------------------------------------------------------------------------------