%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT087+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.51s 3.70s
% Output : CNFRefutation 11.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 7 unt; 0 nHn; 13 RR)
% Number of literals : 21 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_34,negated_conjecture,
~ in_lopen(X1,v0,v600),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7baa2oon/input.p',i_0_34) ).
cnf(i_0_16,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7baa2oon/input.p',i_0_16) ).
cnf(i_0_28,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7baa2oon/input.p',i_0_28) ).
cnf(i_0_35,plain,
less(v0,v200),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7baa2oon/input.p',i_0_35) ).
cnf(i_0_37,plain,
less(v200,v600),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7baa2oon/input.p',i_0_37) ).
cnf(c_0_43,negated_conjecture,
~ in_lopen(X1,v0,v600),
i_0_34 ).
cnf(c_0_44,plain,
( in_lopen(X1,X2,X3)
| ~ leq(X1,X3)
| ~ less(X2,X1) ),
i_0_16 ).
cnf(c_0_45,negated_conjecture,
( ~ leq(X1,v600)
| ~ less(v0,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
i_0_28 ).
cnf(c_0_47,plain,
( ~ less(v0,X1)
| ~ less(X1,v600) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
less(v0,v200),
i_0_35 ).
cnf(c_0_49,plain,
less(v200,v600),
i_0_37 ).
cnf(c_0_50,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT087+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.35 % Computer : n001.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 7 14:25:39 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.45 # ENIGMATIC: Selected SinE mode:
% 0.23/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.23/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.23/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.51/3.70 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 11.51/3.70 # Version: 2.1pre011
% 11.51/3.70 # Preprocessing time : 0.014 s
% 11.51/3.70
% 11.51/3.70 # Proof found!
% 11.51/3.70 # SZS status Theorem
% 11.51/3.70 # SZS output start CNFRefutation
% See solution above
% 11.51/3.70 # Proof object total steps : 13
% 11.51/3.70 # Proof object clause steps : 8
% 11.51/3.70 # Proof object formula steps : 5
% 11.51/3.70 # Proof object conjectures : 3
% 11.51/3.70 # Proof object clause conjectures : 2
% 11.51/3.70 # Proof object formula conjectures : 1
% 11.51/3.70 # Proof object initial clauses used : 5
% 11.51/3.70 # Proof object initial formulas used : 5
% 11.51/3.70 # Proof object generating inferences : 3
% 11.51/3.70 # Proof object simplifying inferences : 2
% 11.51/3.70 # Training examples: 0 positive, 0 negative
% 11.51/3.70 # Parsed axioms : 42
% 11.51/3.70 # Removed by relevancy pruning/SinE : 0
% 11.51/3.70 # Initial clauses : 42
% 11.51/3.70 # Removed in clause preprocessing : 0
% 11.51/3.70 # Initial clauses in saturation : 42
% 11.51/3.70 # Processed clauses : 44
% 11.51/3.70 # ...of these trivial : 0
% 11.51/3.70 # ...subsumed : 1
% 11.51/3.70 # ...remaining for further processing : 43
% 11.51/3.70 # Other redundant clauses eliminated : 1
% 11.51/3.70 # Clauses deleted for lack of memory : 0
% 11.51/3.70 # Backward-subsumed : 0
% 11.51/3.70 # Backward-rewritten : 0
% 11.51/3.70 # Generated clauses : 45
% 11.51/3.70 # ...of the previous two non-trivial : 33
% 11.51/3.70 # Contextual simplify-reflections : 0
% 11.51/3.70 # Paramodulations : 42
% 11.51/3.70 # Factorizations : 2
% 11.51/3.70 # Equation resolutions : 1
% 11.51/3.70 # Propositional unsat checks : 0
% 11.51/3.70 # Propositional unsat check successes : 0
% 11.51/3.70 # Current number of processed clauses : 42
% 11.51/3.70 # Positive orientable unit clauses : 6
% 11.51/3.70 # Positive unorientable unit clauses: 0
% 11.51/3.70 # Negative unit clauses : 5
% 7.86/3.70 # Non-unit-clauses : 31
% 7.86/3.70 # Current number of unprocessed clauses: 28
% 7.86/3.70 # ...number of literals in the above : 70
% 7.86/3.70 # Current number of archived formulas : 0
% 7.86/3.70 # Current number of archived clauses : 0
% 7.86/3.70 # Clause-clause subsumption calls (NU) : 101
% 7.86/3.70 # Rec. Clause-clause subsumption calls : 91
% 7.86/3.70 # Non-unit clause-clause subsumptions : 1
% 7.86/3.70 # Unit Clause-clause subsumption calls : 4
% 7.86/3.70 # Rewrite failures with RHS unbound : 0
% 7.86/3.70 # BW rewrite match attempts : 0
% 7.86/3.70 # BW rewrite match successes : 0
% 7.86/3.70 # Condensation attempts : 0
% 7.86/3.70 # Condensation successes : 0
% 7.86/3.70 # Termbank termtop insertions : 987
% 7.86/3.70
% 7.86/3.70 # -------------------------------------------------
% 7.86/3.70 # User time : 0.015 s
% 7.86/3.70 # System time : 0.001 s
% 7.86/3.70 # Total time : 0.016 s
% 7.86/3.70 # ...preprocessing : 0.014 s
% 7.86/3.70 # ...main loop : 0.002 s
% 7.86/3.70 # Maximum resident set size: 6400 pages
% 7.86/3.70
%------------------------------------------------------------------------------