%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT045+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:58 AM UTC 2026
% Result : Theorem 10.15s 2.55s
% Output : CNFRefutation 10.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 20 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( greater(external_ties(X1,X2),external_ties(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pe3evgeh/input.p',i_0_3) ).
cnf(i_0_13,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pe3evgeh/input.p',i_0_13) ).
cnf(i_0_14,negated_conjecture,
organization(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pe3evgeh/input.p',i_0_14) ).
cnf(i_0_2,plain,
( greater(position(X1,X2),position(X1,X3))
| ~ organization(X1)
| ~ greater(external_ties(X1,X2),external_ties(X1,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pe3evgeh/input.p',i_0_2) ).
cnf(i_0_12,negated_conjecture,
~ greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pe3evgeh/input.p',i_0_12) ).
cnf(c_0_20,plain,
( greater(external_ties(X1,X2),external_ties(X1,X3))
| ~ organization(X1)
| ~ greater(age(X1,X2),age(X1,X3)) ),
i_0_3 ).
cnf(c_0_21,negated_conjecture,
greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)),
i_0_13 ).
cnf(c_0_22,negated_conjecture,
organization(esk1_0),
i_0_14 ).
cnf(c_0_23,plain,
( greater(position(X1,X2),position(X1,X3))
| ~ organization(X1)
| ~ greater(external_ties(X1,X2),external_ties(X1,X3)) ),
i_0_2 ).
cnf(c_0_24,negated_conjecture,
greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
~ greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0)),
i_0_12 ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT045+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.02 % Command : enigmatic-eprover.py %s %d 1
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 7 13:08:28 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.08/0.35 # ENIGMATIC: Selected SinE mode:
% 0.08/0.35 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.08/0.35 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.08/0.35 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.15/2.55 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 10.15/2.55 # Version: 2.1pre011
% 10.15/2.55 # Preprocessing time : 0.008 s
% 10.15/2.55
% 10.15/2.55 # Proof found!
% 10.15/2.55 # SZS status Theorem
% 10.15/2.55 # SZS output start CNFRefutation
% See solution above
% 10.15/2.55 # Proof object total steps : 12
% 10.15/2.55 # Proof object clause steps : 7
% 10.15/2.55 # Proof object formula steps : 5
% 10.15/2.55 # Proof object conjectures : 7
% 10.15/2.55 # Proof object clause conjectures : 4
% 10.15/2.55 # Proof object formula conjectures : 3
% 10.15/2.55 # Proof object initial clauses used : 5
% 10.15/2.55 # Proof object initial formulas used : 5
% 10.15/2.55 # Proof object generating inferences : 2
% 10.15/2.55 # Proof object simplifying inferences : 5
% 10.15/2.55 # Training examples: 0 positive, 0 negative
% 10.15/2.55 # Parsed axioms : 17
% 10.15/2.55 # Removed by relevancy pruning/SinE : 0
% 10.15/2.55 # Initial clauses : 17
% 10.15/2.55 # Removed in clause preprocessing : 0
% 10.15/2.55 # Initial clauses in saturation : 17
% 10.15/2.55 # Processed clauses : 20
% 10.15/2.55 # ...of these trivial : 0
% 10.15/2.55 # ...subsumed : 0
% 10.15/2.55 # ...remaining for further processing : 20
% 10.15/2.55 # Other redundant clauses eliminated : 2
% 10.15/2.55 # Clauses deleted for lack of memory : 0
% 10.15/2.55 # Backward-subsumed : 0
% 10.15/2.55 # Backward-rewritten : 0
% 10.15/2.55 # Generated clauses : 13
% 10.15/2.55 # ...of the previous two non-trivial : 9
% 10.15/2.55 # Contextual simplify-reflections : 0
% 10.15/2.55 # Paramodulations : 11
% 10.15/2.55 # Factorizations : 0
% 10.15/2.55 # Equation resolutions : 2
% 10.15/2.55 # Propositional unsat checks : 0
% 10.15/2.55 # Propositional unsat check successes : 0
% 10.15/2.55 # Current number of processed clauses : 18
% 10.15/2.55 # Positive orientable unit clauses : 4
% 10.15/2.55 # Positive unorientable unit clauses: 0
% 10.15/2.55 # Negative unit clauses : 2
% 10.15/2.55 # Non-unit-clauses : 12
% 10.15/2.55 # Current number of unprocessed clauses: 4
% 10.15/2.55 # ...number of literals in the above : 8
% 10.15/2.55 # Current number of archived formulas : 0
% 10.15/2.55 # Current number of archived clauses : 0
% 10.15/2.55 # Clause-clause subsumption calls (NU) : 24
% 10.15/2.55 # Rec. Clause-clause subsumption calls : 24
% 10.15/2.55 # Non-unit clause-clause subsumptions : 0
% 10.15/2.55 # Unit Clause-clause subsumption calls : 1
% 10.15/2.55 # Rewrite failures with RHS unbound : 0
% 10.15/2.55 # BW rewrite match attempts : 1
% 10.15/2.55 # BW rewrite match successes : 0
% 10.15/2.55 # Condensation attempts : 0
% 10.15/2.55 # Condensation successes : 0
% 10.15/2.55 # Termbank termtop insertions : 436
% 10.15/2.55
% 10.15/2.55 # -------------------------------------------------
% 10.15/2.55 # User time : 0.007 s
% 10.15/2.55 # System time : 0.002 s
% 10.15/2.55 # Total time : 0.009 s
% 10.15/2.55 # ...preprocessing : 0.008 s
% 10.15/2.55 # ...main loop : 0.001 s
% 10.15/2.55 # Maximum resident set size: 6400 pages
% 10.15/2.55
%------------------------------------------------------------------------------