%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT083+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 13.40s 4.02s
% Output : CNFRefutation 13.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 8 unt; 0 nHn; 13 RR)
% Number of literals : 20 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 15 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_35,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4qhoj2qn/input.p',i_0_35) ).
cnf(i_0_32,negated_conjecture,
less(v600,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4qhoj2qn/input.p',i_0_32) ).
cnf(i_0_18,plain,
( less(X1,X2)
| ~ in_open(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4qhoj2qn/input.p',i_0_18) ).
cnf(i_0_33,negated_conjecture,
in_open(esk4_0,v0,v600),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4qhoj2qn/input.p',i_0_33) ).
cnf(i_0_23,plain,
~ less(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4qhoj2qn/input.p',i_0_23) ).
cnf(c_0_41,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
i_0_35 ).
cnf(c_0_42,negated_conjecture,
less(v600,esk4_0),
i_0_32 ).
cnf(c_0_43,plain,
( less(X1,X2)
| ~ in_open(X1,X3,X2) ),
i_0_18 ).
cnf(c_0_44,negated_conjecture,
in_open(esk4_0,v0,v600),
i_0_33 ).
cnf(c_0_45,plain,
~ less(X1,X1),
i_0_23 ).
cnf(c_0_46,negated_conjecture,
( less(X1,esk4_0)
| ~ less(X1,v600) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
less(esk4_0,v600),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT083+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.35 % Computer : n027.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 7 14:20:17 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.12/0.45 # ENIGMATIC: Selected SinE mode:
% 0.12/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.40/4.02 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 13.40/4.02 # Version: 2.1pre011
% 13.40/4.02 # Preprocessing time : 0.015 s
% 13.40/4.02
% 13.40/4.02 # Proof found!
% 13.40/4.02 # SZS status Theorem
% 13.40/4.02 # SZS output start CNFRefutation
% See solution above
% 13.40/4.02 # Proof object total steps : 13
% 13.40/4.02 # Proof object clause steps : 8
% 13.40/4.02 # Proof object formula steps : 5
% 13.40/4.02 # Proof object conjectures : 6
% 13.40/4.02 # Proof object clause conjectures : 4
% 13.40/4.02 # Proof object formula conjectures : 2
% 13.40/4.02 # Proof object initial clauses used : 5
% 13.40/4.02 # Proof object initial formulas used : 5
% 13.40/4.02 # Proof object generating inferences : 3
% 13.40/4.02 # Proof object simplifying inferences : 2
% 13.40/4.02 # Training examples: 0 positive, 0 negative
% 13.40/4.02 # Parsed axioms : 38
% 13.40/4.02 # Removed by relevancy pruning/SinE : 0
% 13.40/4.02 # Initial clauses : 38
% 13.40/4.02 # Removed in clause preprocessing : 0
% 13.40/4.02 # Initial clauses in saturation : 38
% 13.40/4.02 # Processed clauses : 41
% 13.40/4.02 # ...of these trivial : 0
% 13.40/4.02 # ...subsumed : 1
% 13.40/4.02 # ...remaining for further processing : 40
% 13.40/4.02 # Other redundant clauses eliminated : 1
% 13.40/4.02 # Clauses deleted for lack of memory : 0
% 13.40/4.02 # Backward-subsumed : 0
% 13.40/4.02 # Backward-rewritten : 0
% 13.40/4.02 # Generated clauses : 46
% 13.40/4.02 # ...of the previous two non-trivial : 30
% 13.40/4.02 # Contextual simplify-reflections : 0
% 13.40/4.02 # Paramodulations : 43
% 13.40/4.02 # Factorizations : 2
% 13.40/4.02 # Equation resolutions : 1
% 13.40/4.02 # Propositional unsat checks : 0
% 13.40/4.02 # Propositional unsat check successes : 0
% 13.40/4.02 # Current number of processed clauses : 39
% 13.40/4.02 # Positive orientable unit clauses : 7
% 13.40/4.02 # Positive unorientable unit clauses: 0
% 13.40/4.02 # Negative unit clauses : 2
% 13.40/4.02 # Non-unit-clauses : 30
% 13.40/4.02 # Current number of unprocessed clauses: 27
% 13.40/4.02 # ...number of literals in the above : 68
% 13.40/4.02 # Current number of archived formulas : 0
% 13.40/4.02 # Current number of archived clauses : 0
% 13.40/4.02 # Clause-clause subsumption calls (NU) : 110
% 13.40/4.02 # Rec. Clause-clause subsumption calls : 100
% 13.40/4.02 # Non-unit clause-clause subsumptions : 1
% 13.40/4.02 # Unit Clause-clause subsumption calls : 6
% 13.40/4.02 # Rewrite failures with RHS unbound : 0
% 13.40/4.02 # BW rewrite match attempts : 4
% 13.40/4.02 # BW rewrite match successes : 0
% 13.40/4.02 # Condensation attempts : 0
% 13.40/4.02 # Condensation successes : 0
% 13.40/4.02 # Termbank termtop insertions : 970
% 13.40/4.02
% 13.40/4.02 # -------------------------------------------------
% 13.40/4.02 # User time : 0.013 s
% 13.40/4.02 # System time : 0.004 s
% 13.40/4.02 # Total time : 0.017 s
% 13.40/4.02 # ...preprocessing : 0.015 s
% 13.40/4.02 # ...main loop : 0.002 s
% 13.40/4.02 # Maximum resident set size: 6400 pages
% 13.40/4.02
%------------------------------------------------------------------------------