%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT082+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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 15.01s 4.32s
% Output : CNFRefutation 15.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 28 ( 5 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 16 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_32,plain,
( leq(X1,X2)
| ~ in_closed(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mlfbwfg/input.p',i_0_32) ).
cnf(i_0_56,negated_conjecture,
in_closed(esk4_0,v601,v601),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mlfbwfg/input.p',i_0_56) ).
cnf(i_0_33,plain,
( leq(X1,X2)
| ~ in_closed(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mlfbwfg/input.p',i_0_33) ).
cnf(i_0_57,negated_conjecture,
in_closed(esk4_0,v600,v600),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mlfbwfg/input.p',i_0_57) ).
cnf(i_0_44,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mlfbwfg/input.p',i_0_44) ).
cnf(i_0_10,plain,
v601 != v600,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7mlfbwfg/input.p',i_0_10) ).
cnf(c_0_64,plain,
( leq(X1,X2)
| ~ in_closed(X1,X3,X2) ),
i_0_32 ).
cnf(c_0_65,negated_conjecture,
in_closed(esk4_0,v601,v601),
i_0_56 ).
cnf(c_0_66,plain,
( leq(X1,X2)
| ~ in_closed(X2,X1,X3) ),
i_0_33 ).
cnf(c_0_67,negated_conjecture,
in_closed(esk4_0,v600,v600),
i_0_57 ).
cnf(c_0_68,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_44 ).
cnf(c_0_69,negated_conjecture,
leq(esk4_0,v601),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
leq(v601,esk4_0),
inference(spm,[status(thm)],[c_0_66,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
leq(v600,esk4_0),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_72,plain,
esk4_0 = v601,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_73,negated_conjecture,
leq(v600,v601),
inference(rw,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,plain,
v601 != v600,
i_0_10 ).
cnf(c_0_75,negated_conjecture,
in_closed(v601,v600,v600),
inference(rw,[status(thm)],[c_0_67,c_0_72]) ).
cnf(c_0_76,plain,
~ leq(v601,v600),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_73]),c_0_74]) ).
cnf(c_0_77,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_75]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT082+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 : n008.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:17:24 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.47 # ENIGMATIC: Selected SinE mode:
% 0.10/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.10/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.10/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 15.01/4.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 15.01/4.32 # Version: 2.1pre011
% 15.01/4.32 # Preprocessing time : 0.015 s
% 15.01/4.32
% 15.01/4.32 # Proof found!
% 15.01/4.32 # SZS status Theorem
% 15.01/4.32 # SZS output start CNFRefutation
% See solution above
% 15.01/4.32 # Proof object total steps : 20
% 15.01/4.32 # Proof object clause steps : 14
% 15.01/4.32 # Proof object formula steps : 6
% 15.01/4.32 # Proof object conjectures : 9
% 15.01/4.32 # Proof object clause conjectures : 7
% 15.01/4.32 # Proof object formula conjectures : 2
% 15.01/4.32 # Proof object initial clauses used : 6
% 15.01/4.32 # Proof object initial formulas used : 6
% 15.01/4.32 # Proof object generating inferences : 6
% 15.01/4.32 # Proof object simplifying inferences : 6
% 15.01/4.32 # Training examples: 0 positive, 0 negative
% 15.01/4.32 # Parsed axioms : 87
% 15.01/4.32 # Removed by relevancy pruning/SinE : 0
% 15.01/4.32 # Initial clauses : 87
% 15.01/4.32 # Removed in clause preprocessing : 0
% 15.01/4.32 # Initial clauses in saturation : 87
% 15.01/4.32 # Processed clauses : 118
% 15.01/4.32 # ...of these trivial : 0
% 15.01/4.32 # ...subsumed : 7
% 15.01/4.32 # ...remaining for further processing : 111
% 15.01/4.32 # Other redundant clauses eliminated : 1
% 15.01/4.32 # Clauses deleted for lack of memory : 0
% 15.01/4.32 # Backward-subsumed : 0
% 15.01/4.32 # Backward-rewritten : 5
% 15.01/4.32 # Generated clauses : 165
% 15.01/4.32 # ...of the previous two non-trivial : 146
% 15.01/4.32 # Contextual simplify-reflections : 0
% 15.01/4.32 # Paramodulations : 162
% 15.01/4.32 # Factorizations : 2
% 15.01/4.32 # Equation resolutions : 1
% 15.01/4.32 # Propositional unsat checks : 0
% 15.01/4.32 # Propositional unsat check successes : 0
% 15.01/4.32 # Current number of processed clauses : 105
% 15.01/4.32 # Positive orientable unit clauses : 41
% 15.01/4.32 # Positive unorientable unit clauses: 0
% 15.01/4.32 # Negative unit clauses : 25
% 15.01/4.32 # Non-unit-clauses : 39
% 15.01/4.32 # Current number of unprocessed clauses: 98
% 15.01/4.32 # ...number of literals in the above : 226
% 15.01/4.32 # Current number of archived formulas : 0
% 15.01/4.32 # Current number of archived clauses : 5
% 15.01/4.32 # Clause-clause subsumption calls (NU) : 157
% 15.01/4.32 # Rec. Clause-clause subsumption calls : 146
% 15.01/4.32 # Non-unit clause-clause subsumptions : 5
% 15.01/4.32 # Unit Clause-clause subsumption calls : 250
% 15.01/4.32 # Rewrite failures with RHS unbound : 0
% 15.01/4.32 # BW rewrite match attempts : 6
% 15.01/4.32 # BW rewrite match successes : 1
% 15.01/4.32 # Condensation attempts : 0
% 15.01/4.32 # Condensation successes : 0
% 15.01/4.32 # Termbank termtop insertions : 2217
% 15.01/4.32
% 15.01/4.32 # -------------------------------------------------
% 15.01/4.32 # User time : 0.015 s
% 15.01/4.32 # System time : 0.005 s
% 15.01/4.32 # Total time : 0.020 s
% 15.01/4.32 # ...preprocessing : 0.015 s
% 15.01/4.32 # ...main loop : 0.005 s
% 15.01/4.32 # Maximum resident set size: 6656 pages
% 15.01/4.32
%------------------------------------------------------------------------------