%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT081+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:03 AM UTC 2026
% Result : Theorem 8.56s 3.01s
% Output : CNFRefutation 8.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 11 unt; 0 nHn; 24 RR)
% Number of literals : 42 ( 9 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 23 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_33,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yuq3i0cl/input.p',i_0_33) ).
cnf(i_0_35,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yuq3i0cl/input.p',i_0_35) ).
cnf(i_0_24,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yuq3i0cl/input.p',i_0_24) ).
cnf(i_0_44,negated_conjecture,
in_lopen(esk4_0,v0,v400),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yuq3i0cl/input.p',i_0_44) ).
cnf(i_0_43,negated_conjecture,
leq(v800,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yuq3i0cl/input.p',i_0_43) ).
cnf(i_0_40,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yuq3i0cl/input.p',i_0_40) ).
cnf(i_0_53,plain,
less(v400,v800),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yuq3i0cl/input.p',i_0_53) ).
cnf(i_0_11,plain,
v800 != v400,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-yuq3i0cl/input.p',i_0_11) ).
cnf(c_0_62,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_33 ).
cnf(c_0_63,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
i_0_35 ).
cnf(c_0_64,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
i_0_24 ).
cnf(c_0_65,negated_conjecture,
in_lopen(esk4_0,v0,v400),
i_0_44 ).
cnf(c_0_66,negated_conjecture,
leq(v800,esk4_0),
i_0_43 ).
cnf(c_0_67,plain,
( X1 = X2
| ~ less(X2,X1)
| ~ leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
leq(esk4_0,v400),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
i_0_40 ).
cnf(c_0_70,negated_conjecture,
( esk4_0 = v800
| ~ leq(esk4_0,v800) ),
inference(spm,[status(thm)],[c_0_62,c_0_66]) ).
cnf(c_0_71,negated_conjecture,
( esk4_0 = v400
| ~ less(v400,esk4_0) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
( less(X1,esk4_0)
| ~ less(X1,v800) ),
inference(spm,[status(thm)],[c_0_69,c_0_66]) ).
cnf(c_0_73,plain,
less(v400,v800),
i_0_53 ).
cnf(c_0_74,plain,
( esk4_0 = v800
| ~ less(esk4_0,v800) ),
inference(spm,[status(thm)],[c_0_70,c_0_63]) ).
cnf(c_0_75,negated_conjecture,
esk4_0 = v400,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).
cnf(c_0_76,plain,
v800 != v400,
i_0_11 ).
cnf(c_0_77,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_75]),c_0_73])]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT081+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.35 % Computer : n009.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.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 14:15:54 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.13/0.45 # 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
% 8.56/3.01 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.56/3.01 # Version: 2.1pre011
% 8.56/3.01 # Preprocessing time : 0.010 s
% 8.56/3.01
% 8.56/3.01 # Proof found!
% 8.56/3.01 # SZS status Theorem
% 8.56/3.01 # SZS output start CNFRefutation
% See solution above
% 8.56/3.01 # Proof object total steps : 24
% 8.56/3.01 # Proof object clause steps : 16
% 8.56/3.01 # Proof object formula steps : 8
% 8.56/3.01 # Proof object conjectures : 9
% 8.56/3.01 # Proof object clause conjectures : 7
% 8.56/3.01 # Proof object formula conjectures : 2
% 8.56/3.01 # Proof object initial clauses used : 8
% 8.56/3.01 # Proof object initial formulas used : 8
% 8.56/3.01 # Proof object generating inferences : 7
% 8.56/3.01 # Proof object simplifying inferences : 7
% 8.56/3.01 # Training examples: 0 positive, 0 negative
% 8.56/3.01 # Parsed axioms : 61
% 8.56/3.01 # Removed by relevancy pruning/SinE : 0
% 8.56/3.01 # Initial clauses : 61
% 8.56/3.01 # Removed in clause preprocessing : 0
% 8.56/3.01 # Initial clauses in saturation : 61
% 8.56/3.01 # Processed clauses : 85
% 8.56/3.01 # ...of these trivial : 0
% 8.56/3.01 # ...subsumed : 2
% 8.56/3.01 # ...remaining for further processing : 83
% 8.56/3.01 # Other redundant clauses eliminated : 1
% 8.56/3.01 # Clauses deleted for lack of memory : 0
% 8.56/3.01 # Backward-subsumed : 0
% 8.56/3.01 # Backward-rewritten : 12
% 8.56/3.01 # Generated clauses : 131
% 8.56/3.01 # ...of the previous two non-trivial : 117
% 8.56/3.01 # Contextual simplify-reflections : 0
% 8.56/3.01 # Paramodulations : 128
% 8.56/3.01 # Factorizations : 2
% 8.56/3.01 # Equation resolutions : 1
% 8.56/3.01 # Propositional unsat checks : 0
% 8.56/3.01 # Propositional unsat check successes : 0
% 8.56/3.01 # Current number of processed clauses : 70
% 8.56/3.01 # Positive orientable unit clauses : 21
% 8.56/3.01 # Positive unorientable unit clauses: 0
% 8.56/3.01 # Negative unit clauses : 11
% 8.56/3.01 # Non-unit-clauses : 38
% 8.56/3.01 # Current number of unprocessed clauses: 70
% 8.56/3.01 # ...number of literals in the above : 169
% 8.56/3.01 # Current number of archived formulas : 0
% 8.56/3.01 # Current number of archived clauses : 12
% 8.56/3.01 # Clause-clause subsumption calls (NU) : 150
% 8.56/3.01 # Rec. Clause-clause subsumption calls : 138
% 8.56/3.01 # Non-unit clause-clause subsumptions : 2
% 8.56/3.01 # Unit Clause-clause subsumption calls : 40
% 8.56/3.01 # Rewrite failures with RHS unbound : 0
% 8.56/3.01 # BW rewrite match attempts : 9
% 8.56/3.01 # BW rewrite match successes : 1
% 8.56/3.01 # Condensation attempts : 0
% 8.56/3.01 # Condensation successes : 0
% 8.56/3.01 # Termbank termtop insertions : 1799
% 8.56/3.01
% 8.56/3.01 # -------------------------------------------------
% 8.56/3.01 # User time : 0.012 s
% 8.56/3.01 # System time : 0.002 s
% 8.56/3.01 # Total time : 0.014 s
% 8.56/3.01 # ...preprocessing : 0.010 s
% 8.56/3.01 # ...main loop : 0.004 s
% 8.56/3.01 # Maximum resident set size: 6400 pages
% 8.56/3.01
%------------------------------------------------------------------------------