%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT053+1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:00 AM UTC 2026
% Result : Theorem 6.45s 2.94s
% Output : CNFRefutation 6.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 6 unt; 14 nHn; 19 RR)
% Number of literals : 63 ( 0 equ; 26 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h7i_ui5/lgb.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
( dissimilar(esk1_0,esk2_0,esk3_0)
| dissimilar(esk1_0,esk3_0,esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h7i_ui5/lgb.p',i_0_6) ).
cnf(i_0_5,plain,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h7i_ui5/lgb.p',i_0_5) ).
cnf(i_0_2,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X3,X2)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h7i_ui5/lgb.p',i_0_2) ).
cnf(i_0_4,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h7i_ui5/lgb.p',i_0_4) ).
cnf(i_0_1,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X2,X3)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h7i_ui5/lgb.p',i_0_1) ).
cnf(i_0_7,negated_conjecture,
( ~ dissimilar(esk1_0,esk2_0,esk3_0)
| ~ dissimilar(esk1_0,esk3_0,esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9h7i_ui5/lgb.p',i_0_7) ).
cnf(c_0_15,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
i_0_3 ).
cnf(c_0_16,negated_conjecture,
( dissimilar(esk1_0,esk2_0,esk3_0)
| dissimilar(esk1_0,esk3_0,esk2_0) ),
i_0_6 ).
cnf(c_0_17,plain,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
i_0_5 ).
cnf(c_0_18,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X3,X2)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
i_0_2 ).
cnf(c_0_19,negated_conjecture,
( is_aligned(esk1_0,esk3_0)
| is_aligned(esk1_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
organization(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_17]) ).
cnf(c_0_21,plain,
( is_aligned(esk1_0,esk2_0)
| is_aligned(esk1_0,X1)
| dissimilar(esk1_0,esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_22,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
i_0_4 ).
cnf(c_0_23,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X2,X3)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
i_0_1 ).
cnf(c_0_24,plain,
( is_aligned(esk1_0,esk2_0)
| dissimilar(esk1_0,esk3_0,esk2_0) ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_aligned(esk1_0,esk3_0)
| ~ is_aligned(esk1_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_16]),c_0_22]) ).
cnf(c_0_26,plain,
( is_aligned(esk1_0,X1)
| dissimilar(esk1_0,esk3_0,esk2_0)
| dissimilar(esk1_0,X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
( ~ dissimilar(esk1_0,esk2_0,esk3_0)
| ~ dissimilar(esk1_0,esk3_0,esk2_0) ),
i_0_7 ).
cnf(c_0_28,negated_conjecture,
dissimilar(esk1_0,esk3_0,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_29,plain,
( is_aligned(esk1_0,esk2_0)
| is_aligned(esk1_0,X1)
| dissimilar(esk1_0,X1,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_20])]) ).
cnf(c_0_30,negated_conjecture,
~ dissimilar(esk1_0,esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_31,plain,
is_aligned(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_29]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
~ is_aligned(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_31])]) ).
cnf(c_0_33,plain,
( is_aligned(esk1_0,X1)
| dissimilar(esk1_0,esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_31]),c_0_20])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT053+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.35 % Computer : n029.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 13:24:58 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.12/0.45 # ENIGMATIC: Selected SinE mode:
% 0.12/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.45/2.94 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.45/2.94 # No SInE strategy applied
% 6.45/2.94 # Trying AutoSched0 for 150 seconds
% 6.45/2.94 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 6.45/2.94 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.45/2.94 #
% 6.45/2.94 # Preprocessing time : 0.013 s
% 6.45/2.94
% 6.45/2.94 # Proof found!
% 6.45/2.94 # SZS status Theorem
% 6.45/2.94 # SZS output start CNFRefutation
% See solution above
% 6.45/2.94 # Training examples: 0 positive, 0 negative
% 6.45/2.94
% 6.45/2.94 # -------------------------------------------------
% 6.45/2.94 # User time : 0.011 s
% 6.45/2.94 # System time : 0.005 s
% 6.45/2.94 # Total time : 0.015 s
% 6.45/2.94 # Maximum resident set size: 3328 pages
% 6.45/2.94
%------------------------------------------------------------------------------