%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT085+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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 9.47s 2.42s
% Output : CNFRefutation 9.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 66 ( 28 unt; 13 nHn; 65 RR)
% Number of literals : 123 ( 22 equ; 46 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 : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 55 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_40) ).
cnf(i_0_51,plain,
less(v200,v400),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_51) ).
cnf(i_0_38,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_38) ).
cnf(i_0_43,negated_conjecture,
leq(v400,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_43) ).
cnf(i_0_34,plain,
( leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_34) ).
cnf(i_0_24,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_24) ).
cnf(i_0_44,negated_conjecture,
( in_lopen(esk4_0,v0,v200)
| in_lopen(esk5_0,v0,v100)
| in_lopen(esk6_0,v0,v50) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_44) ).
cnf(i_0_49,plain,
less(v100,v200),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_49) ).
cnf(i_0_42,negated_conjecture,
leq(v200,esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_42) ).
cnf(i_0_55,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_55) ).
cnf(i_0_32,plain,
~ less(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_32) ).
cnf(i_0_36,plain,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_36) ).
cnf(i_0_52,plain,
less(v50,v100),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_52) ).
cnf(i_0_41,negated_conjecture,
leq(v100,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_41) ).
cnf(i_0_33,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_33) ).
cnf(i_0_35,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_35) ).
cnf(i_0_10,plain,
v400 != v200,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_10) ).
cnf(i_0_12,plain,
v200 != v100,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bwns018x/input.p',i_0_12) ).
cnf(c_0_74,plain,
( less(X1,X2)
| ~ leq(X3,X2)
| ~ less(X1,X3) ),
i_0_40 ).
cnf(c_0_75,plain,
less(v200,v400),
i_0_51 ).
cnf(c_0_76,plain,
( leq(X1,X2)
| ~ leq(X3,X2)
| ~ leq(X1,X3) ),
i_0_38 ).
cnf(c_0_77,negated_conjecture,
leq(v400,esk4_0),
i_0_43 ).
cnf(c_0_78,plain,
( leq(X1,X2)
| X1 != X2 ),
i_0_34 ).
cnf(c_0_79,plain,
( leq(X1,X2)
| ~ in_lopen(X1,X3,X2) ),
i_0_24 ).
cnf(c_0_80,negated_conjecture,
( in_lopen(esk4_0,v0,v200)
| in_lopen(esk5_0,v0,v100)
| in_lopen(esk6_0,v0,v50) ),
i_0_44 ).
cnf(c_0_81,plain,
( less(v200,X1)
| ~ leq(v400,X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,negated_conjecture,
( leq(X1,esk4_0)
| ~ leq(X1,v400) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_83,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_78]) ).
cnf(c_0_84,plain,
less(v100,v200),
i_0_49 ).
cnf(c_0_85,negated_conjecture,
leq(v200,esk5_0),
i_0_42 ).
cnf(c_0_86,negated_conjecture,
( in_lopen(esk6_0,v0,v50)
| in_lopen(esk5_0,v0,v100)
| leq(esk4_0,v200) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_87,plain,
( less(X1,X2)
| ~ less(X3,X2)
| ~ less(X1,X3) ),
i_0_55 ).
cnf(c_0_88,negated_conjecture,
less(v200,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83])]) ).
cnf(c_0_89,plain,
( less(v100,X1)
| ~ leq(v200,X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_84]) ).
cnf(c_0_90,negated_conjecture,
( leq(X1,esk5_0)
| ~ leq(X1,v200) ),
inference(spm,[status(thm)],[c_0_76,c_0_85]) ).
cnf(c_0_91,plain,
( in_lopen(esk6_0,v0,v50)
| leq(esk4_0,v200)
| leq(esk5_0,v100) ),
inference(spm,[status(thm)],[c_0_79,c_0_86]) ).
cnf(c_0_92,plain,
~ less(X1,X1),
i_0_32 ).
cnf(c_0_93,plain,
( less(X1,esk4_0)
| ~ less(X1,v200) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_94,negated_conjecture,
less(v100,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_83])]) ).
cnf(c_0_95,plain,
( X1 = X2
| less(X1,X2)
| ~ leq(X1,X2) ),
i_0_36 ).
cnf(c_0_96,plain,
( leq(esk5_0,v100)
| leq(esk4_0,v200)
| leq(esk6_0,v50) ),
inference(spm,[status(thm)],[c_0_79,c_0_91]) ).
cnf(c_0_97,plain,
~ less(esk4_0,v200),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_98,plain,
( less(X1,esk5_0)
| ~ less(X1,v100) ),
inference(spm,[status(thm)],[c_0_87,c_0_94]) ).
cnf(c_0_99,plain,
less(v50,v100),
i_0_52 ).
cnf(c_0_100,negated_conjecture,
leq(v100,esk6_0),
i_0_41 ).
cnf(c_0_101,plain,
( X1 = X2
| ~ leq(X2,X1)
| ~ leq(X1,X2) ),
i_0_33 ).
cnf(c_0_102,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
i_0_35 ).
cnf(c_0_103,plain,
( esk4_0 = v200
| leq(esk6_0,v50)
| leq(esk5_0,v100) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]) ).
cnf(c_0_104,plain,
~ less(esk5_0,v100),
inference(spm,[status(thm)],[c_0_92,c_0_98]) ).
cnf(c_0_105,plain,
( less(v50,X1)
| ~ leq(v100,X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_99]) ).
cnf(c_0_106,negated_conjecture,
( leq(X1,esk6_0)
| ~ leq(X1,v100) ),
inference(spm,[status(thm)],[c_0_76,c_0_100]) ).
cnf(c_0_107,plain,
( X1 = X2
| ~ less(X2,X1)
| ~ leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_108,plain,
( esk4_0 = v200
| esk5_0 = v100
| leq(esk6_0,v50) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_103]),c_0_104]) ).
cnf(c_0_109,negated_conjecture,
less(v50,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_83])]) ).
cnf(c_0_110,plain,
( less(X1,v400)
| ~ less(X1,v200) ),
inference(spm,[status(thm)],[c_0_87,c_0_75]) ).
cnf(c_0_111,negated_conjecture,
( esk4_0 = v400
| less(v400,esk4_0) ),
inference(spm,[status(thm)],[c_0_95,c_0_77]) ).
cnf(c_0_112,plain,
( esk5_0 = v100
| esk4_0 = v200
| esk6_0 = v50 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109])]) ).
cnf(c_0_113,plain,
v400 != v200,
i_0_10 ).
cnf(c_0_114,plain,
~ less(v400,v200),
inference(spm,[status(thm)],[c_0_92,c_0_110]) ).
cnf(c_0_115,plain,
( less(X1,v200)
| ~ less(X1,v100) ),
inference(spm,[status(thm)],[c_0_87,c_0_84]) ).
cnf(c_0_116,negated_conjecture,
( esk5_0 = v200
| less(v200,esk5_0) ),
inference(spm,[status(thm)],[c_0_95,c_0_85]) ).
cnf(c_0_117,negated_conjecture,
( esk6_0 = v50
| esk5_0 = v100 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),c_0_114]) ).
cnf(c_0_118,plain,
v200 != v100,
i_0_12 ).
cnf(c_0_119,plain,
~ less(v200,v100),
inference(spm,[status(thm)],[c_0_92,c_0_115]) ).
cnf(c_0_120,negated_conjecture,
esk6_0 = v50,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118]),c_0_119]) ).
cnf(c_0_121,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_120]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT085+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.02 % Command : enigmatic-eprover.py %s %d 1
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Mon Sep 7 14:18:43 UTC 2026
% 0.03/0.29 % CPUTime :
% 0.08/0.34 # ENIGMATIC: Selected SinE mode:
% 0.08/0.34 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.08/0.34 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.08/0.34 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.47/2.42 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.47/2.42 # Version: 2.1pre011
% 9.47/2.42 # Preprocessing time : 0.009 s
% 9.47/2.42
% 9.47/2.42 # Proof found!
% 9.47/2.42 # SZS status Theorem
% 9.47/2.42 # SZS output start CNFRefutation
% See solution above
% 9.47/2.42 # Proof object total steps : 66
% 9.47/2.42 # Proof object clause steps : 48
% 9.47/2.42 # Proof object formula steps : 18
% 9.47/2.42 # Proof object conjectures : 20
% 9.47/2.42 # Proof object clause conjectures : 16
% 9.47/2.42 # Proof object formula conjectures : 4
% 9.47/2.42 # Proof object initial clauses used : 18
% 9.47/2.42 # Proof object initial formulas used : 18
% 9.47/2.42 # Proof object generating inferences : 28
% 9.47/2.42 # Proof object simplifying inferences : 17
% 9.47/2.42 # Training examples: 0 positive, 0 negative
% 9.47/2.42 # Parsed axioms : 61
% 9.47/2.42 # Removed by relevancy pruning/SinE : 0
% 9.47/2.42 # Initial clauses : 61
% 9.47/2.42 # Removed in clause preprocessing : 0
% 9.47/2.42 # Initial clauses in saturation : 61
% 9.47/2.42 # Processed clauses : 361
% 9.47/2.42 # ...of these trivial : 33
% 9.47/2.42 # ...subsumed : 89
% 9.47/2.42 # ...remaining for further processing : 239
% 9.47/2.42 # Other redundant clauses eliminated : 1
% 9.47/2.42 # Clauses deleted for lack of memory : 0
% 9.47/2.42 # Backward-subsumed : 1
% 9.47/2.42 # Backward-rewritten : 29
% 9.47/2.42 # Generated clauses : 1359
% 9.47/2.42 # ...of the previous two non-trivial : 1101
% 9.47/2.42 # Contextual simplify-reflections : 3
% 9.47/2.42 # Paramodulations : 1350
% 9.47/2.42 # Factorizations : 8
% 9.47/2.42 # Equation resolutions : 1
% 9.47/2.42 # Propositional unsat checks : 0
% 9.47/2.42 # Propositional unsat check successes : 0
% 9.47/2.42 # Current number of processed clauses : 208
% 9.47/2.42 # Positive orientable unit clauses : 27
% 9.47/2.42 # Positive unorientable unit clauses: 0
% 9.47/2.42 # Negative unit clauses : 31
% 9.47/2.42 # Non-unit-clauses : 150
% 9.47/2.42 # Current number of unprocessed clauses: 619
% 9.47/2.42 # ...number of literals in the above : 1766
% 9.47/2.42 # Current number of archived formulas : 0
% 9.47/2.42 # Current number of archived clauses : 30
% 9.47/2.42 # Clause-clause subsumption calls (NU) : 3200
% 9.47/2.42 # Rec. Clause-clause subsumption calls : 3021
% 9.47/2.42 # Non-unit clause-clause subsumptions : 63
% 9.47/2.42 # Unit Clause-clause subsumption calls : 761
% 9.47/2.42 # Rewrite failures with RHS unbound : 0
% 9.47/2.42 # BW rewrite match attempts : 12
% 9.47/2.42 # BW rewrite match successes : 2
% 9.47/2.42 # Condensation attempts : 0
% 9.47/2.42 # Condensation successes : 0
% 9.47/2.42 # Termbank termtop insertions : 11952
% 9.47/2.42
% 9.47/2.42 # -------------------------------------------------
% 9.47/2.42 # User time : 0.021 s
% 9.47/2.42 # System time : 0.002 s
% 9.47/2.42 # Total time : 0.023 s
% 9.47/2.42 # ...preprocessing : 0.009 s
% 9.47/2.42 # ...main loop : 0.015 s
% 9.47/2.42 # Maximum resident set size: 7424 pages
% 9.47/2.42
%------------------------------------------------------------------------------