%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT078+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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:08:03 AM UTC 2026
% Result : Theorem 9.34s 2.34s
% Output : CNFRefutation 9.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 11 unt; 0 nHn; 24 RR)
% Number of literals : 41 ( 9 equ; 19 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 : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_35,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqqv99ng/input.p',i_0_35) ).
cnf(i_0_54,negated_conjecture,
in_lopen(esk4_0,v0,v600),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqqv99ng/input.p',i_0_54) ).
cnf(i_0_41,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqqv99ng/input.p',i_0_41) ).
cnf(i_0_46,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqqv99ng/input.p',i_0_46) ).
cnf(i_0_53,negated_conjecture,
leq(v1200,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqqv99ng/input.p',i_0_53) ).
cnf(i_0_43,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqqv99ng/input.p',i_0_43) ).
cnf(i_0_68,plain,
less(v600,v1200),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqqv99ng/input.p',i_0_68) ).
cnf(i_0_11,plain,
v1200 != v600,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wqqv99ng/input.p',i_0_11) ).
cnf(c_0_77,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
i_0_35 ).
cnf(c_0_78,negated_conjecture,
in_lopen(esk4_0,v0,v600),
i_0_54 ).
cnf(c_0_79,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_41 ).
cnf(c_0_80,negated_conjecture,
leq(esk4_0,v600),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
i_0_46 ).
cnf(c_0_82,negated_conjecture,
leq(v1200,esk4_0),
i_0_53 ).
cnf(c_0_83,plain,
( esk4_0 = v600
| ~ leq(v600,esk4_0) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_84,negated_conjecture,
( leq(X1,esk4_0)
| ~ leq(X1,v1200) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_85,negated_conjecture,
( esk4_0 = v1200
| ~ leq(esk4_0,v1200) ),
inference(spm,[status(thm)],[c_0_79,c_0_82]) ).
cnf(c_0_86,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
i_0_43 ).
cnf(c_0_87,negated_conjecture,
( esk4_0 = v600
| ~ leq(v600,v1200) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,plain,
less(v600,v1200),
i_0_68 ).
cnf(c_0_89,plain,
( esk4_0 = v1200
| ~ less(esk4_0,v1200) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,plain,
esk4_0 = v600,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_86]),c_0_88])]) ).
cnf(c_0_91,plain,
v1200 != v600,
i_0_11 ).
cnf(c_0_92,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90]),c_0_90]),c_0_88])]),c_0_91]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT078+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.02 % Command : enigmatic-eprover.py %s %d 1
% 0.04/0.29 % Computer : n012.cluster.edu
% 0.04/0.29 % Model : x86_64 x86_64
% 0.04/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.29 % Memory : 8046.5625MB
% 0.04/0.29 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 7 14:13:01 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.08/0.35 # ENIGMATIC: Selected SinE mode:
% 0.08/0.35 # Parsing /export/starexec/sandbox2/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
% 9.34/2.34 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 9.34/2.34 # Version: 2.1pre011
% 9.34/2.34 # Preprocessing time : 0.008 s
% 9.34/2.34
% 9.34/2.34 # Proof found!
% 9.34/2.34 # SZS status Theorem
% 9.34/2.34 # SZS output start CNFRefutation
% See solution above
% 9.34/2.34 # Proof object total steps : 24
% 9.34/2.34 # Proof object clause steps : 16
% 9.34/2.34 # Proof object formula steps : 8
% 9.34/2.34 # Proof object conjectures : 8
% 9.34/2.34 # Proof object clause conjectures : 6
% 9.34/2.34 # Proof object formula conjectures : 2
% 9.34/2.34 # Proof object initial clauses used : 8
% 9.34/2.34 # Proof object initial formulas used : 8
% 9.34/2.34 # Proof object generating inferences : 7
% 9.34/2.34 # Proof object simplifying inferences : 7
% 9.34/2.34 # Training examples: 0 positive, 0 negative
% 9.34/2.34 # Parsed axioms : 84
% 9.34/2.34 # Removed by relevancy pruning/SinE : 0
% 9.34/2.34 # Initial clauses : 84
% 9.34/2.34 # Removed in clause preprocessing : 0
% 9.34/2.34 # Initial clauses in saturation : 84
% 9.34/2.34 # Processed clauses : 111
% 9.34/2.34 # ...of these trivial : 0
% 9.34/2.34 # ...subsumed : 1
% 9.34/2.34 # ...remaining for further processing : 110
% 9.34/2.34 # Other redundant clauses eliminated : 1
% 9.34/2.34 # Clauses deleted for lack of memory : 0
% 9.34/2.34 # Backward-subsumed : 0
% 9.34/2.34 # Backward-rewritten : 12
% 9.34/2.34 # Generated clauses : 178
% 9.34/2.34 # ...of the previous two non-trivial : 167
% 9.34/2.34 # Contextual simplify-reflections : 0
% 9.34/2.34 # Paramodulations : 175
% 9.34/2.34 # Factorizations : 2
% 9.34/2.34 # Equation resolutions : 1
% 9.34/2.34 # Propositional unsat checks : 0
% 9.34/2.34 # Propositional unsat check successes : 0
% 9.34/2.34 # Current number of processed clauses : 97
% 9.34/2.34 # Positive orientable unit clauses : 38
% 9.34/2.34 # Positive unorientable unit clauses: 0
% 9.34/2.34 # Negative unit clauses : 22
% 9.34/2.34 # Non-unit-clauses : 37
% 9.34/2.34 # Current number of unprocessed clauses: 110
% 9.34/2.34 # ...number of literals in the above : 254
% 9.34/2.34 # Current number of archived formulas : 0
% 9.34/2.34 # Current number of archived clauses : 12
% 9.34/2.34 # Clause-clause subsumption calls (NU) : 131
% 9.34/2.34 # Rec. Clause-clause subsumption calls : 122
% 9.34/2.34 # Non-unit clause-clause subsumptions : 1
% 9.34/2.34 # Unit Clause-clause subsumption calls : 217
% 9.34/2.34 # Rewrite failures with RHS unbound : 0
% 9.34/2.34 # BW rewrite match attempts : 12
% 9.34/2.34 # BW rewrite match successes : 1
% 9.34/2.34 # Condensation attempts : 0
% 9.34/2.34 # Condensation successes : 0
% 9.34/2.34 # Termbank termtop insertions : 2285
% 9.34/2.34
% 9.34/2.34 # -------------------------------------------------
% 9.34/2.34 # User time : 0.008 s
% 9.34/2.34 # System time : 0.003 s
% 9.34/2.34 # Total time : 0.011 s
% 9.34/2.34 # ...preprocessing : 0.008 s
% 9.34/2.34 # ...main loop : 0.002 s
% 9.34/2.34 # Maximum resident set size: 6400 pages
% 9.34/2.34
%------------------------------------------------------------------------------