%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT052+1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:07:59 AM UTC 2026
% Result : Theorem 3.56s 2.01s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 4 unt; 2 nHn; 8 RR)
% Number of literals : 16 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 2 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 : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4le94wh/input.p',i_0_5) ).
cnf(i_0_1,negated_conjecture,
dissimilar(esk1_0,esk2_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r4le94wh/input.p',i_0_1) ).
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-r4le94wh/input.p',i_0_4) ).
cnf(c_0_9,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
i_0_5 ).
cnf(c_0_10,negated_conjecture,
dissimilar(esk1_0,esk2_0,esk2_0),
i_0_1 ).
cnf(c_0_11,plain,
( is_aligned(X1,X2)
| is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
i_0_4 ).
cnf(c_0_12,negated_conjecture,
~ is_aligned(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT052+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.01 % Command : enigmatic-eprover.py %s %d 1
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Mon Sep 7 13:21:28 UTC 2026
% 0.02/0.29 % CPUTime :
% 0.08/0.34 # ENIGMATIC: Selected SinE mode:
% 0.08/0.34 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.08/0.34 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.08/0.34 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 3.56/2.01 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 3.56/2.01 # Version: 2.1pre011
% 3.56/2.01 # Preprocessing time : 0.007 s
% 3.56/2.01
% 3.56/2.01 # Proof found!
% 3.56/2.01 # SZS status Theorem
% 3.56/2.01 # SZS output start CNFRefutation
% See solution above
% 3.56/2.01 # Proof object total steps : 8
% 3.56/2.01 # Proof object clause steps : 5
% 3.56/2.01 # Proof object formula steps : 3
% 3.56/2.01 # Proof object conjectures : 4
% 3.56/2.01 # Proof object clause conjectures : 3
% 3.56/2.01 # Proof object formula conjectures : 1
% 3.56/2.01 # Proof object initial clauses used : 3
% 3.56/2.01 # Proof object initial formulas used : 3
% 3.56/2.01 # Proof object generating inferences : 2
% 3.56/2.01 # Proof object simplifying inferences : 1
% 3.56/2.01 # Training examples: 0 positive, 0 negative
% 3.56/2.01 # Parsed axioms : 6
% 3.56/2.01 # Removed by relevancy pruning/SinE : 0
% 3.56/2.01 # Initial clauses : 6
% 3.56/2.01 # Removed in clause preprocessing : 0
% 3.56/2.01 # Initial clauses in saturation : 6
% 3.56/2.01 # Processed clauses : 9
% 3.56/2.01 # ...of these trivial : 0
% 3.56/2.01 # ...subsumed : 0
% 3.56/2.01 # ...remaining for further processing : 8
% 3.56/2.01 # Other redundant clauses eliminated : 0
% 3.56/2.01 # Clauses deleted for lack of memory : 0
% 3.56/2.01 # Backward-subsumed : 0
% 3.56/2.01 # Backward-rewritten : 0
% 3.56/2.01 # Generated clauses : 9
% 3.56/2.01 # ...of the previous two non-trivial : 3
% 3.56/2.01 # Contextual simplify-reflections : 0
% 3.56/2.01 # Paramodulations : 9
% 3.56/2.01 # Factorizations : 0
% 3.56/2.01 # Equation resolutions : 0
% 3.56/2.01 # Propositional unsat checks : 0
% 3.56/2.01 # Propositional unsat check successes : 0
% 3.56/2.01 # Current number of processed clauses : 8
% 3.56/2.01 # Positive orientable unit clauses : 2
% 3.56/2.01 # Positive unorientable unit clauses: 0
% 3.56/2.01 # Negative unit clauses : 1
% 3.56/2.01 # Non-unit-clauses : 5
% 3.56/2.01 # Current number of unprocessed clauses: 0
% 3.56/2.01 # ...number of literals in the above : 0
% 3.56/2.01 # Current number of archived formulas : 0
% 3.56/2.01 # Current number of archived clauses : 0
% 3.56/2.01 # Clause-clause subsumption calls (NU) : 2
% 3.56/2.01 # Rec. Clause-clause subsumption calls : 2
% 3.56/2.01 # Non-unit clause-clause subsumptions : 0
% 3.56/2.01 # Unit Clause-clause subsumption calls : 3
% 3.56/2.01 # Rewrite failures with RHS unbound : 0
% 3.56/2.01 # BW rewrite match attempts : 0
% 3.56/2.01 # BW rewrite match successes : 0
% 3.56/2.01 # Condensation attempts : 0
% 3.56/2.01 # Condensation successes : 0
% 3.56/2.01 # Termbank termtop insertions : 221
% 3.56/2.01
% 3.56/2.01 # -------------------------------------------------
% 3.56/2.01 # User time : 0.007 s
% 3.56/2.01 # System time : 0.001 s
% 3.56/2.01 # Total time : 0.007 s
% 3.56/2.01 # ...preprocessing : 0.007 s
% 3.56/2.01 # ...main loop : 0.000 s
% 3.56/2.01 # Maximum resident set size: 6144 pages
% 3.56/2.01
%------------------------------------------------------------------------------