%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT058+1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:01 AM UTC 2026
% Result : Theorem 18.95s 4.94s
% Output : CNFRefutation 18.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 50 ( 16 unt; 9 nHn; 46 RR)
% Number of literals : 94 ( 25 equ; 41 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_15) ).
cnf(i_0_23,negated_conjecture,
greater_or_equal(tau,zero),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_23) ).
cnf(i_0_12,plain,
( ~ robust_position(X1)
| ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_12) ).
cnf(i_0_25,negated_conjecture,
age(esk5_0,esk6_0) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_25) ).
cnf(i_0_21,negated_conjecture,
robust_position(esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_21) ).
cnf(i_0_19,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_19) ).
cnf(i_0_27,plain,
( X1 = X2
| greater(X1,X2)
| smaller(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_27) ).
cnf(i_0_28,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_28) ).
cnf(i_0_6,plain,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_6) ).
cnf(i_0_22,negated_conjecture,
fragile_position(esk5_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_22) ).
cnf(i_0_16,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_16) ).
cnf(i_0_24,negated_conjecture,
greater_or_equal(sigma,zero),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_24) ).
cnf(i_0_18,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-iyyfalgz/input.p',i_0_18) ).
cnf(c_0_42,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
i_0_15 ).
cnf(c_0_43,negated_conjecture,
greater_or_equal(tau,zero),
i_0_23 ).
cnf(c_0_44,plain,
( ~ robust_position(X1)
| ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau) ),
i_0_12 ).
cnf(c_0_45,negated_conjecture,
age(esk5_0,esk6_0) = zero,
i_0_25 ).
cnf(c_0_46,negated_conjecture,
robust_position(esk5_0),
i_0_21 ).
cnf(c_0_47,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
i_0_19 ).
cnf(c_0_48,plain,
( X1 = X2
| greater(X1,X2)
| smaller(X1,X2) ),
i_0_27 ).
cnf(c_0_49,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
i_0_28 ).
cnf(c_0_50,negated_conjecture,
( zero = tau
| greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,plain,
( positional_advantage(X1,X2)
| ~ fragile_position(X1)
| ~ smaller_or_equal(age(X1,X2),sigma) ),
i_0_6 ).
cnf(c_0_52,negated_conjecture,
fragile_position(esk5_0),
i_0_22 ).
cnf(c_0_53,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
i_0_16 ).
cnf(c_0_54,plain,
( ~ positional_advantage(esk5_0,esk6_0)
| ~ smaller_or_equal(zero,tau) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_55,plain,
( X1 = X2
| greater(X1,X2)
| smaller_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
( zero = tau
| ~ greater(zero,tau) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
( positional_advantage(esk5_0,esk6_0)
| ~ smaller_or_equal(zero,sigma) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_45]),c_0_52])]) ).
cnf(c_0_58,plain,
( smaller_or_equal(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_53]) ).
cnf(c_0_59,plain,
( zero = tau
| ~ positional_advantage(esk5_0,esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( positional_advantage(esk5_0,esk6_0)
| ~ greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
greater_or_equal(sigma,zero),
i_0_24 ).
cnf(c_0_62,plain,
( zero = tau
| ~ greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
( zero = sigma
| greater(sigma,zero) ),
inference(spm,[status(thm)],[c_0_42,c_0_61]) ).
cnf(c_0_64,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
i_0_18 ).
cnf(c_0_65,negated_conjecture,
( zero = sigma
| zero = tau ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_67,plain,
( zero = sigma
| ~ greater(zero,sigma) ),
inference(spm,[status(thm)],[c_0_49,c_0_63]) ).
cnf(c_0_68,plain,
( zero = sigma
| ~ positional_advantage(esk5_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_65]),c_0_66])]) ).
cnf(c_0_69,negated_conjecture,
zero = sigma,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_67]),c_0_68]) ).
cnf(c_0_70,negated_conjecture,
( zero = sigma
| tau != sigma ),
inference(ef,[status(thm)],[c_0_65]) ).
cnf(c_0_71,plain,
( ~ positional_advantage(esk5_0,esk6_0)
| ~ greater(tau,zero) ),
inference(spm,[status(thm)],[c_0_54,c_0_58]) ).
cnf(c_0_72,negated_conjecture,
positional_advantage(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_69]),c_0_66])]) ).
cnf(c_0_73,plain,
( tau != sigma
| ~ positional_advantage(esk5_0,esk6_0)
| ~ smaller_or_equal(sigma,tau) ),
inference(spm,[status(thm)],[c_0_54,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( tau = sigma
| greater(tau,sigma) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_69]),c_0_69]) ).
cnf(c_0_75,plain,
~ greater(tau,sigma),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_69]),c_0_72])]) ).
cnf(c_0_76,plain,
( tau != sigma
| ~ smaller_or_equal(sigma,tau) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_72])]) ).
cnf(c_0_77,negated_conjecture,
tau = sigma,
inference(sr,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_77]),c_0_77]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT058+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.06 % Command : enigmatic-eprover.py %s %d 1
% 0.16/0.44 % Computer : n011.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Mon Sep 7 13:31:32 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.27/0.59 # ENIGMATIC: Selected SinE mode:
% 0.27/0.59 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.27/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.27/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.27/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 18.95/4.94 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 18.95/4.94 # Version: 2.1pre011
% 18.95/4.94 # Preprocessing time : 0.027 s
% 18.95/4.94
% 18.95/4.94 # Proof found!
% 18.95/4.94 # SZS status Theorem
% 18.95/4.94 # SZS output start CNFRefutation
% See solution above
% 18.95/4.94 # Proof object total steps : 50
% 18.95/4.94 # Proof object clause steps : 37
% 18.95/4.94 # Proof object formula steps : 13
% 18.95/4.94 # Proof object conjectures : 20
% 18.95/4.94 # Proof object clause conjectures : 15
% 18.95/4.94 # Proof object formula conjectures : 5
% 18.95/4.94 # Proof object initial clauses used : 13
% 18.95/4.94 # Proof object initial formulas used : 13
% 18.95/4.94 # Proof object generating inferences : 17
% 18.95/4.94 # Proof object simplifying inferences : 25
% 18.95/4.94 # Training examples: 0 positive, 0 negative
% 18.95/4.94 # Parsed axioms : 29
% 18.95/4.94 # Removed by relevancy pruning/SinE : 0
% 18.95/4.94 # Initial clauses : 29
% 18.95/4.94 # Removed in clause preprocessing : 0
% 18.95/4.94 # Initial clauses in saturation : 29
% 18.95/4.95 # Processed clauses : 114
% 18.95/4.95 # ...of these trivial : 1
% 18.95/4.95 # ...subsumed : 19
% 18.95/4.95 # ...remaining for further processing : 94
% 18.95/4.95 # Other redundant clauses eliminated : 2
% 18.95/4.95 # Clauses deleted for lack of memory : 0
% 18.95/4.95 # Backward-subsumed : 6
% 18.95/4.95 # Backward-rewritten : 50
% 18.95/4.95 # Generated clauses : 208
% 18.95/4.95 # ...of the previous two non-trivial : 185
% 18.95/4.95 # Contextual simplify-reflections : 10
% 18.95/4.95 # Paramodulations : 200
% 18.95/4.95 # Factorizations : 5
% 18.95/4.95 # Equation resolutions : 2
% 18.95/4.95 # Propositional unsat checks : 0
% 18.95/4.95 # Propositional unsat check successes : 0
% 18.95/4.95 # Current number of processed clauses : 35
% 18.95/4.95 # Positive orientable unit clauses : 9
% 18.95/4.95 # Positive unorientable unit clauses: 0
% 18.95/4.95 # Negative unit clauses : 1
% 18.95/4.95 # Non-unit-clauses : 25
% 18.95/4.95 # Current number of unprocessed clauses: 18
% 18.95/4.95 # ...number of literals in the above : 54
% 18.95/4.95 # Current number of archived formulas : 0
% 18.95/4.95 # Current number of archived clauses : 57
% 18.95/4.95 # Clause-clause subsumption calls (NU) : 890
% 18.95/4.95 # Rec. Clause-clause subsumption calls : 577
% 18.95/4.95 # Non-unit clause-clause subsumptions : 31
% 18.95/4.95 # Unit Clause-clause subsumption calls : 50
% 18.95/4.95 # Rewrite failures with RHS unbound : 0
% 18.95/4.95 # BW rewrite match attempts : 14
% 18.95/4.95 # BW rewrite match successes : 4
% 18.95/4.95 # Condensation attempts : 0
% 18.95/4.95 # Condensation successes : 0
% 18.95/4.95 # Termbank termtop insertions : 2784
% 18.95/4.95
% 18.95/4.95 # -------------------------------------------------
% 18.95/4.95 # User time : 0.035 s
% 18.95/4.95 # System time : 0.005 s
% 18.95/4.95 # Total time : 0.040 s
% 18.95/4.95 # ...preprocessing : 0.027 s
% 18.95/4.95 # ...main loop : 0.013 s
% 18.95/4.95 # Maximum resident set size: 6400 pages
% 18.95/4.95
%------------------------------------------------------------------------------