%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT088+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 10.87s 3.73s
% Output : CNFRefutation 10.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 6 unt; 0 nHn; 12 RR)
% Number of literals : 23 ( 2 equ; 13 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 : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_39,negated_conjecture,
( ~ less(v200,X1)
| ~ in_lopen(X1,v0,v400) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vujwb_z_/input.p',i_0_39) ).
cnf(i_0_21,plain,
( in_lopen(X1,X2,X3)
| ~ less(X2,X1)
| ~ leq(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vujwb_z_/input.p',i_0_21) ).
cnf(i_0_32,plain,
( leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vujwb_z_/input.p',i_0_32) ).
cnf(i_0_43,plain,
less(v200,v400),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vujwb_z_/input.p',i_0_43) ).
cnf(i_0_41,plain,
less(v0,v400),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vujwb_z_/input.p',i_0_41) ).
cnf(c_0_49,negated_conjecture,
( ~ less(v200,X1)
| ~ in_lopen(X1,v0,v400) ),
i_0_39 ).
cnf(c_0_50,plain,
( in_lopen(X1,X2,X3)
| ~ less(X2,X1)
| ~ leq(X1,X3) ),
i_0_21 ).
cnf(c_0_51,plain,
( leq(X1,X2)
| X1 != X2 ),
i_0_32 ).
cnf(c_0_52,negated_conjecture,
( ~ leq(X1,v400)
| ~ less(v200,X1)
| ~ less(v0,X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_54,plain,
less(v200,v400),
i_0_43 ).
cnf(c_0_55,plain,
less(v0,v400),
i_0_41 ).
cnf(c_0_56,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT088+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n028.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 14:23:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected SinE mode:
% 0.22/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.87/3.73 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 10.87/3.73 # Version: 2.1pre011
% 10.87/3.73 # Preprocessing time : 0.015 s
% 10.87/3.73
% 10.87/3.73 # Proof found!
% 10.87/3.73 # SZS status Theorem
% 10.87/3.73 # SZS output start CNFRefutation
% See solution above
% 10.87/3.73 # Proof object total steps : 13
% 10.87/3.73 # Proof object clause steps : 8
% 10.87/3.73 # Proof object formula steps : 5
% 10.87/3.73 # Proof object conjectures : 3
% 10.87/3.73 # Proof object clause conjectures : 2
% 10.87/3.73 # Proof object formula conjectures : 1
% 10.87/3.73 # Proof object initial clauses used : 5
% 10.87/3.73 # Proof object initial formulas used : 5
% 10.87/3.73 # Proof object generating inferences : 2
% 10.87/3.73 # Proof object simplifying inferences : 4
% 10.87/3.73 # Training examples: 0 positive, 0 negative
% 10.87/3.73 # Parsed axioms : 51
% 10.87/3.73 # Removed by relevancy pruning/SinE : 0
% 10.87/3.73 # Initial clauses : 51
% 10.87/3.73 # Removed in clause preprocessing : 0
% 10.87/3.73 # Initial clauses in saturation : 51
% 10.87/3.73 # Processed clauses : 53
% 10.87/3.73 # ...of these trivial : 0
% 10.87/3.73 # ...subsumed : 1
% 10.87/3.73 # ...remaining for further processing : 52
% 10.87/3.73 # Other redundant clauses eliminated : 1
% 10.87/3.73 # Clauses deleted for lack of memory : 0
% 10.87/3.73 # Backward-subsumed : 0
% 10.87/3.73 # Backward-rewritten : 0
% 10.87/3.73 # Generated clauses : 50
% 10.87/3.73 # ...of the previous two non-trivial : 35
% 10.87/3.73 # Contextual simplify-reflections : 0
% 10.87/3.73 # Paramodulations : 47
% 10.87/3.73 # Factorizations : 2
% 10.87/3.73 # Equation resolutions : 1
% 10.87/3.73 # Propositional unsat checks : 0
% 10.87/3.73 # Propositional unsat check successes : 0
% 10.87/3.73 # Current number of processed clauses : 51
% 10.87/3.73 # Positive orientable unit clauses : 11
% 10.87/3.73 # Positive unorientable unit clauses: 0
% 10.87/3.73 # Negative unit clauses : 7
% 10.87/3.73 # Non-unit-clauses : 33
% 10.87/3.73 # Current number of unprocessed clauses: 32
% 10.87/3.73 # ...number of literals in the above : 81
% 10.87/3.73 # Current number of archived formulas : 0
% 10.87/3.73 # Current number of archived clauses : 0
% 10.87/3.73 # Clause-clause subsumption calls (NU) : 166
% 10.87/3.73 # Rec. Clause-clause subsumption calls : 154
% 10.87/3.73 # Non-unit clause-clause subsumptions : 1
% 10.87/3.73 # Unit Clause-clause subsumption calls : 13
% 10.87/3.73 # Rewrite failures with RHS unbound : 0
% 10.87/3.73 # BW rewrite match attempts : 4
% 10.87/3.73 # BW rewrite match successes : 0
% 10.87/3.73 # Condensation attempts : 0
% 10.87/3.73 # Condensation successes : 0
% 10.87/3.73 # Termbank termtop insertions : 1141
% 10.87/3.73
% 10.87/3.73 # -------------------------------------------------
% 10.87/3.73 # User time : 0.013 s
% 10.87/3.73 # System time : 0.004 s
% 10.87/3.73 # Total time : 0.017 s
% 10.87/3.73 # ...preprocessing : 0.015 s
% 10.87/3.73 # ...main loop : 0.002 s
% 10.87/3.73 # Maximum resident set size: 6400 pages
% 10.87/3.73
%------------------------------------------------------------------------------