%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT084+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n001.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 11.68s 3.69s
% Output : CNFRefutation 11.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 16 RR)
% Number of literals : 25 ( 4 equ; 11 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 16 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-141kebpn/input.p',i_0_20) ).
cnf(i_0_40,negated_conjecture,
in_lopen(esk5_0,v0,v400),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-141kebpn/input.p',i_0_40) ).
cnf(i_0_29,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-141kebpn/input.p',i_0_29) ).
cnf(i_0_31,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-141kebpn/input.p',i_0_31) ).
cnf(i_0_39,negated_conjecture,
less(v400,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-141kebpn/input.p',i_0_39) ).
cnf(i_0_28,plain,
~ less(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-141kebpn/input.p',i_0_28) ).
cnf(c_0_47,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
i_0_20 ).
cnf(c_0_48,negated_conjecture,
in_lopen(esk5_0,v0,v400),
i_0_40 ).
cnf(c_0_49,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_29 ).
cnf(c_0_50,negated_conjecture,
leq(esk5_0,v400),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
( esk5_0 = v400
| ~ leq(v400,esk5_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
i_0_31 ).
cnf(c_0_53,negated_conjecture,
less(v400,esk5_0),
i_0_39 ).
cnf(c_0_54,plain,
esk5_0 = v400,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_55,plain,
~ less(X1,X1),
i_0_28 ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT084+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 7 14:23:39 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected SinE mode:
% 0.22/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.68/3.69 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 11.68/3.69 # Version: 2.1pre011
% 11.68/3.69 # Preprocessing time : 0.015 s
% 11.68/3.69
% 11.68/3.69 # Proof found!
% 11.68/3.69 # SZS status Theorem
% 11.68/3.69 # SZS output start CNFRefutation
% See solution above
% 11.68/3.69 # Proof object total steps : 16
% 11.68/3.69 # Proof object clause steps : 10
% 11.68/3.69 # Proof object formula steps : 6
% 11.68/3.69 # Proof object conjectures : 6
% 11.68/3.69 # Proof object clause conjectures : 4
% 11.68/3.69 # Proof object formula conjectures : 2
% 11.68/3.69 # Proof object initial clauses used : 6
% 11.68/3.69 # Proof object initial formulas used : 6
% 11.68/3.69 # Proof object generating inferences : 3
% 11.68/3.69 # Proof object simplifying inferences : 4
% 11.68/3.69 # Training examples: 0 positive, 0 negative
% 11.68/3.69 # Parsed axioms : 54
% 11.68/3.69 # Removed by relevancy pruning/SinE : 0
% 11.68/3.69 # Initial clauses : 54
% 11.68/3.69 # Removed in clause preprocessing : 0
% 11.68/3.69 # Initial clauses in saturation : 54
% 11.68/3.69 # Processed clauses : 63
% 11.68/3.69 # ...of these trivial : 0
% 11.68/3.69 # ...subsumed : 1
% 11.68/3.69 # ...remaining for further processing : 62
% 11.68/3.69 # Other redundant clauses eliminated : 1
% 11.68/3.69 # Clauses deleted for lack of memory : 0
% 11.68/3.69 # Backward-subsumed : 0
% 11.68/3.69 # Backward-rewritten : 11
% 11.68/3.69 # Generated clauses : 79
% 11.68/3.69 # ...of the previous two non-trivial : 68
% 11.68/3.69 # Contextual simplify-reflections : 0
% 11.68/3.69 # Paramodulations : 76
% 11.68/3.69 # Factorizations : 2
% 11.68/3.69 # Equation resolutions : 1
% 11.68/3.69 # Propositional unsat checks : 0
% 11.68/3.69 # Propositional unsat check successes : 0
% 11.68/3.69 # Current number of processed clauses : 50
% 11.68/3.69 # Positive orientable unit clauses : 14
% 11.68/3.69 # Positive unorientable unit clauses: 0
% 11.68/3.69 # Negative unit clauses : 7
% 11.68/3.69 # Non-unit-clauses : 29
% 11.68/3.69 # Current number of unprocessed clauses: 32
% 11.68/3.69 # ...number of literals in the above : 77
% 11.68/3.69 # Current number of archived formulas : 0
% 11.68/3.69 # Current number of archived clauses : 11
% 11.68/3.69 # Clause-clause subsumption calls (NU) : 96
% 11.68/3.69 # Rec. Clause-clause subsumption calls : 89
% 11.68/3.69 # Non-unit clause-clause subsumptions : 1
% 11.68/3.69 # Unit Clause-clause subsumption calls : 19
% 11.68/3.69 # Rewrite failures with RHS unbound : 0
% 11.68/3.69 # BW rewrite match attempts : 11
% 11.68/3.69 # BW rewrite match successes : 3
% 11.68/3.69 # Condensation attempts : 0
% 11.68/3.69 # Condensation successes : 0
% 11.68/3.69 # Termbank termtop insertions : 1350
% 11.68/3.69
% 11.68/3.69 # -------------------------------------------------
% 11.68/3.69 # User time : 0.014 s
% 11.68/3.69 # System time : 0.003 s
% 11.68/3.69 # Total time : 0.017 s
% 11.68/3.69 # ...preprocessing : 0.015 s
% 11.68/3.69 # ...main loop : 0.003 s
% 11.68/3.69 # Maximum resident set size: 6400 pages
% 11.68/3.69
%------------------------------------------------------------------------------