%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:04 AM UTC 2026
% Result : Theorem 13.55s 4.09s
% Output : CNFRefutation 13.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 13 ( 2 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,negated_conjecture,
~ prec(v5,v5,o,o),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-na_bx10t/input.p',i_0_43) ).
cnf(i_0_50,plain,
( prec(X1,X2,o,o)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-na_bx10t/input.p',i_0_50) ).
cnf(i_0_31,plain,
( leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-na_bx10t/input.p',i_0_31) ).
cnf(c_0_54,negated_conjecture,
~ prec(v5,v5,o,o),
i_0_43 ).
cnf(c_0_55,plain,
( prec(X1,X2,o,o)
| ~ leq(X1,X2) ),
i_0_50 ).
cnf(c_0_56,plain,
( leq(X1,X2)
| X1 != X2 ),
i_0_31 ).
cnf(c_0_57,negated_conjecture,
~ leq(v5,v5),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT089+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.35 % Computer : n010.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 7 13:59:42 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.12/0.46 # ENIGMATIC: Selected SinE mode:
% 0.12/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.55/4.09 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 13.55/4.09 # Version: 2.1pre011
% 13.55/4.09 # Preprocessing time : 0.016 s
% 13.55/4.09
% 13.55/4.09 # Proof found!
% 13.55/4.09 # SZS status Theorem
% 13.55/4.09 # SZS output start CNFRefutation
% See solution above
% 13.55/4.09 # Proof object total steps : 9
% 13.55/4.09 # Proof object clause steps : 6
% 13.55/4.09 # Proof object formula steps : 3
% 13.55/4.09 # Proof object conjectures : 4
% 13.55/4.09 # Proof object clause conjectures : 3
% 13.55/4.09 # Proof object formula conjectures : 1
% 13.55/4.09 # Proof object initial clauses used : 3
% 13.55/4.09 # Proof object initial formulas used : 3
% 13.55/4.09 # Proof object generating inferences : 1
% 13.55/4.09 # Proof object simplifying inferences : 3
% 13.55/4.09 # Training examples: 0 positive, 0 negative
% 13.55/4.09 # Parsed axioms : 59
% 13.55/4.09 # Removed by relevancy pruning/SinE : 0
% 13.55/4.09 # Initial clauses : 59
% 13.55/4.09 # Removed in clause preprocessing : 0
% 13.55/4.09 # Initial clauses in saturation : 59
% 13.55/4.09 # Processed clauses : 63
% 13.55/4.09 # ...of these trivial : 0
% 13.55/4.09 # ...subsumed : 1
% 13.55/4.09 # ...remaining for further processing : 62
% 13.55/4.09 # Other redundant clauses eliminated : 1
% 13.55/4.09 # Clauses deleted for lack of memory : 0
% 13.55/4.09 # Backward-subsumed : 0
% 13.55/4.09 # Backward-rewritten : 1
% 13.55/4.09 # Generated clauses : 48
% 13.55/4.09 # ...of the previous two non-trivial : 27
% 13.55/4.09 # Contextual simplify-reflections : 0
% 13.55/4.09 # Paramodulations : 45
% 13.55/4.09 # Factorizations : 2
% 13.55/4.09 # Equation resolutions : 1
% 13.55/4.09 # Propositional unsat checks : 0
% 13.55/4.09 # Propositional unsat check successes : 0
% 13.55/4.09 # Current number of processed clauses : 60
% 13.55/4.09 # Positive orientable unit clauses : 15
% 13.55/4.09 # Positive unorientable unit clauses: 0
% 13.55/4.09 # Negative unit clauses : 3
% 13.55/4.09 # Non-unit-clauses : 42
% 13.55/4.09 # Current number of unprocessed clauses: 23
% 13.55/4.09 # ...number of literals in the above : 64
% 13.55/4.09 # Current number of archived formulas : 0
% 13.55/4.09 # Current number of archived clauses : 1
% 13.55/4.09 # Clause-clause subsumption calls (NU) : 88
% 13.55/4.09 # Rec. Clause-clause subsumption calls : 73
% 13.55/4.09 # Non-unit clause-clause subsumptions : 1
% 13.55/4.09 # Unit Clause-clause subsumption calls : 50
% 13.55/4.09 # Rewrite failures with RHS unbound : 0
% 13.55/4.09 # BW rewrite match attempts : 7
% 13.55/4.09 # BW rewrite match successes : 1
% 13.55/4.09 # Condensation attempts : 0
% 13.55/4.09 # Condensation successes : 0
% 13.55/4.09 # Termbank termtop insertions : 1308
% 13.55/4.09
% 13.55/4.09 # -------------------------------------------------
% 13.55/4.09 # User time : 0.016 s
% 13.55/4.09 # System time : 0.002 s
% 13.55/4.09 # Total time : 0.018 s
% 13.55/4.09 # ...preprocessing : 0.016 s
% 13.55/4.09 # ...main loop : 0.002 s
% 13.55/4.09 # Maximum resident set size: 6400 pages
% 13.55/4.09
%------------------------------------------------------------------------------