%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT093+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:05 AM UTC 2026
% Result : Theorem 9.95s 3.61s
% Output : CNFRefutation 9.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 9 RR)
% Number of literals : 17 ( 8 equ; 10 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_21,plain,
( xone_verdict(X1,X2) = compatible
| X2 != conflict
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_mc5zt9x/lgb.p',i_0_21) ).
cnf(i_0_8,plain,
is_verdict(conflict),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_mc5zt9x/lgb.p',i_0_8) ).
cnf(i_0_7,plain,
is_verdict(compatible),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_mc5zt9x/lgb.p',i_0_7) ).
cnf(i_0_9,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_mc5zt9x/lgb.p',i_0_9) ).
cnf(c_0_26,plain,
( xone_verdict(X1,X2) = compatible
| X2 != conflict
| X1 != compatible
| ~ is_verdict(X2)
| ~ is_verdict(X1) ),
i_0_21 ).
cnf(c_0_27,plain,
is_verdict(conflict),
i_0_8 ).
cnf(c_0_28,plain,
is_verdict(compatible),
i_0_7 ).
cnf(c_0_29,negated_conjecture,
xone_verdict(compatible,conflict) != compatible,
i_0_9 ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]),c_0_27]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 14:00:47 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.21/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
% 9.95/3.61 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.95/3.61 # No SInE strategy applied
% 9.95/3.61 # Trying AutoSched0 for 150 seconds
% 9.95/3.61 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AN
% 9.95/3.61 # and selection function SelectComplexExceptUniqMaxHorn.
% 9.95/3.61 #
% 9.95/3.61 # Preprocessing time : 0.013 s
% 9.95/3.61 # Presaturation interreduction done
% 9.95/3.61
% 9.95/3.61 # Proof found!
% 9.95/3.61 # SZS status Theorem
% 9.95/3.61 # SZS output start CNFRefutation
% See solution above
% 9.95/3.61 # Training examples: 0 positive, 0 negative
% 9.95/3.61
% 9.95/3.61 # -------------------------------------------------
% 9.95/3.61 # User time : 0.013 s
% 9.95/3.61 # System time : 0.003 s
% 9.95/3.61 # Total time : 0.015 s
% 9.95/3.61 # Maximum resident set size: 3328 pages
% 9.95/3.61
%------------------------------------------------------------------------------