%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT049+1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 14.05s 3.33s
% Output : CNFRefutation 14.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 18 ( 10 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( position(X1,X2) = position(X1,X3)
| external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hbd3z3ck/input.p',i_0_2) ).
cnf(i_0_1,plain,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hbd3z3ck/input.p',i_0_1) ).
cnf(i_0_14,negated_conjecture,
organization(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hbd3z3ck/input.p',i_0_14) ).
cnf(i_0_12,negated_conjecture,
position(esk1_0,esk2_0) != position(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hbd3z3ck/input.p',i_0_12) ).
cnf(c_0_19,plain,
( position(X1,X2) = position(X1,X3)
| external_ties(X1,X2) != external_ties(X1,X3)
| ~ organization(X1) ),
i_0_2 ).
cnf(c_0_20,plain,
( external_ties(X1,X2) = external_ties(X1,X3)
| ~ organization(X1) ),
i_0_1 ).
cnf(c_0_21,plain,
( position(X1,X2) = position(X1,X3)
| ~ organization(X1) ),
inference(csr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
organization(esk1_0),
i_0_14 ).
cnf(c_0_23,negated_conjecture,
position(esk1_0,esk2_0) != position(esk1_0,esk3_0),
i_0_12 ).
cnf(c_0_24,negated_conjecture,
position(esk1_0,X1) = position(esk1_0,X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_23,c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT049+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.35 % Computer : n013.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:15:21 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.44 # 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
% 14.05/3.33 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 14.05/3.33 # Version: 2.1pre011
% 14.05/3.33 # Preprocessing time : 0.008 s
% 14.05/3.33
% 14.05/3.33 # Proof found!
% 14.05/3.33 # SZS status Theorem
% 14.05/3.33 # SZS output start CNFRefutation
% See solution above
% 14.05/3.33 # Proof object total steps : 11
% 14.05/3.33 # Proof object clause steps : 7
% 14.05/3.33 # Proof object formula steps : 4
% 14.05/3.33 # Proof object conjectures : 6
% 14.05/3.33 # Proof object clause conjectures : 4
% 14.05/3.33 # Proof object formula conjectures : 2
% 14.05/3.33 # Proof object initial clauses used : 4
% 14.05/3.33 # Proof object initial formulas used : 4
% 14.05/3.33 # Proof object generating inferences : 1
% 14.05/3.33 # Proof object simplifying inferences : 2
% 14.05/3.33 # Training examples: 0 positive, 0 negative
% 14.05/3.33 # Parsed axioms : 17
% 14.05/3.33 # Removed by relevancy pruning/SinE : 0
% 14.05/3.33 # Initial clauses : 17
% 14.05/3.33 # Removed in clause preprocessing : 0
% 14.05/3.33 # Initial clauses in saturation : 17
% 14.05/3.33 # Processed clauses : 26
% 14.05/3.33 # ...of these trivial : 0
% 14.05/3.33 # ...subsumed : 1
% 14.05/3.33 # ...remaining for further processing : 25
% 14.05/3.33 # Other redundant clauses eliminated : 2
% 14.05/3.33 # Clauses deleted for lack of memory : 0
% 14.05/3.33 # Backward-subsumed : 0
% 14.05/3.33 # Backward-rewritten : 0
% 14.05/3.33 # Generated clauses : 38
% 14.05/3.33 # ...of the previous two non-trivial : 20
% 14.05/3.33 # Contextual simplify-reflections : 1
% 14.05/3.33 # Paramodulations : 33
% 14.05/3.33 # Factorizations : 2
% 14.05/3.33 # Equation resolutions : 2
% 14.05/3.33 # Propositional unsat checks : 0
% 14.05/3.33 # Propositional unsat check successes : 0
% 14.05/3.33 # Current number of processed clauses : 22
% 14.05/3.33 # Positive orientable unit clauses : 4
% 14.05/3.33 # Positive unorientable unit clauses: 2
% 14.05/3.33 # Negative unit clauses : 1
% 14.05/3.33 # Non-unit-clauses : 15
% 14.05/3.33 # Current number of unprocessed clauses: 11
% 14.05/3.33 # ...number of literals in the above : 28
% 14.05/3.33 # Current number of archived formulas : 0
% 14.05/3.33 # Current number of archived clauses : 1
% 14.05/3.33 # Clause-clause subsumption calls (NU) : 17
% 14.05/3.33 # Rec. Clause-clause subsumption calls : 17
% 14.05/3.33 # Non-unit clause-clause subsumptions : 1
% 14.05/3.33 # Unit Clause-clause subsumption calls : 2
% 14.05/3.33 # Rewrite failures with RHS unbound : 8
% 14.05/3.33 # BW rewrite match attempts : 6
% 14.05/3.33 # BW rewrite match successes : 4
% 14.05/3.33 # Condensation attempts : 0
% 14.05/3.33 # Condensation successes : 0
% 14.05/3.33 # Termbank termtop insertions : 604
% 14.05/3.33
% 14.05/3.33 # -------------------------------------------------
% 14.05/3.33 # User time : 0.006 s
% 14.05/3.33 # System time : 0.003 s
% 14.05/3.33 # Total time : 0.008 s
% 14.05/3.33 # ...preprocessing : 0.008 s
% 14.05/3.33 # ...main loop : 0.001 s
% 14.05/3.33 # Maximum resident set size: 6144 pages
% 14.05/3.33
%------------------------------------------------------------------------------