%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:02 AM UTC 2026
% Result : Theorem 12.76s 3.94s
% Output : CNFRefutation 12.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 13 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_55,negated_conjecture,
( ~ leq(X1,nsup)
| ~ leq(ninf,X1)
| ~ completion_compatible(X1,ninf,nsup) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oa9tdnhi/lgb.p',i_0_55) ).
cnf(i_0_25,hypothesis,
leq(X1,nsup),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oa9tdnhi/lgb.p',i_0_25) ).
cnf(i_0_24,hypothesis,
leq(ninf,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oa9tdnhi/lgb.p',i_0_24) ).
cnf(i_0_17,plain,
( completion_compatible(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oa9tdnhi/lgb.p',i_0_17) ).
cnf(c_0_60,negated_conjecture,
( ~ leq(X1,nsup)
| ~ leq(ninf,X1)
| ~ completion_compatible(X1,ninf,nsup) ),
i_0_55 ).
cnf(c_0_61,hypothesis,
leq(X1,nsup),
i_0_25 ).
cnf(c_0_62,hypothesis,
leq(ninf,X1),
i_0_24 ).
cnf(c_0_63,negated_conjecture,
~ completion_compatible(X1,ninf,nsup),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_64,plain,
( completion_compatible(X1,X2,X3)
| ~ leq(X1,X3)
| ~ leq(X2,X1) ),
i_0_17 ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_62]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.35 % Computer : n004.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 13:53:02 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.45 # ENIGMATIC: Selected SinE mode:
% 0.13/0.45 # Parsing /export/starexec/sandbox/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
% 12.76/3.94 # ENIGMATIC: Solved by autoschedule-lgb:
% 12.76/3.94 # No SInE strategy applied
% 12.76/3.94 # Trying AutoSched0 for 150 seconds
% 12.76/3.94 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 12.76/3.94 # and selection function SelectComplexExceptUniqMaxHorn.
% 12.76/3.94 #
% 12.76/3.94 # Preprocessing time : 0.013 s
% 12.76/3.94 # Presaturation interreduction done
% 12.76/3.94
% 12.76/3.94 # Proof found!
% 12.76/3.94 # SZS status Theorem
% 12.76/3.94 # SZS output start CNFRefutation
% See solution above
% 12.76/3.94 # Training examples: 0 positive, 0 negative
% 12.76/3.94
% 12.76/3.94 # -------------------------------------------------
% 12.76/3.94 # User time : 0.015 s
% 12.76/3.94 # System time : 0.003 s
% 12.76/3.94 # Total time : 0.018 s
% 12.76/3.94 # Maximum resident set size: 3584 pages
% 12.76/3.94
%------------------------------------------------------------------------------