%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT062+1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 12.66s 3.86s
% Output : CNFRefutation 12.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 24
% Syntax : Number of clauses : 77 ( 27 unt; 13 nHn; 69 RR)
% Number of literals : 176 ( 30 equ; 105 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 92 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_1) ).
cnf(i_0_5,plain,
( has_immunity(X1,X2)
| epred1_2(X2,X1)
| ~ organization(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_5) ).
cnf(i_0_39,negated_conjecture,
organization(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_39) ).
cnf(i_0_37,negated_conjecture,
~ has_endowment(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_37) ).
cnf(i_0_32,negated_conjecture,
smaller_or_equal(age(esk3_0,esk5_0),sigma),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_32) ).
cnf(i_0_33,negated_conjecture,
tau = sigma,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_33) ).
cnf(i_0_30,negated_conjecture,
( hazard_of_mortality(esk3_0,esk5_0) != hazard_of_mortality(esk3_0,esk4_0)
| ~ smaller(hazard_of_mortality(esk3_0,esk6_0),hazard_of_mortality(esk3_0,esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_30) ).
cnf(i_0_22,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_22) ).
cnf(i_0_41,plain,
( hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2)
| ~ is_aligned(X1,X2)
| ~ epred1_2(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_41) ).
cnf(i_0_18,plain,
( ~ robust_position(X1)
| ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_18) ).
cnf(i_0_38,negated_conjecture,
robust_position(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_38) ).
cnf(i_0_42,plain,
( hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| ~ positional_advantage(X1,X2)
| ~ epred1_2(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_42) ).
cnf(i_0_36,negated_conjecture,
age(esk3_0,esk4_0) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_36) ).
cnf(i_0_25,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_25) ).
cnf(i_0_4,plain,
( dissimilar(X1,X2,X3)
| age(X1,X2) != zero
| ~ organization(X1)
| ~ greater(age(X1,X3),sigma) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_4) ).
cnf(i_0_7,plain,
greater(mod2,mod1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_7) ).
cnf(i_0_34,negated_conjecture,
greater(tau,zero),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_34) ).
cnf(i_0_11,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_11) ).
cnf(i_0_2,plain,
( is_aligned(X1,X2)
| age(X1,X2) != zero
| ~ organization(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_2) ).
cnf(i_0_31,negated_conjecture,
greater(age(esk3_0,esk6_0),sigma),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_31) ).
cnf(i_0_17,plain,
( positional_advantage(X1,X2)
| ~ robust_position(X1)
| ~ greater(age(X1,X2),tau) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_17) ).
cnf(i_0_3,plain,
( greater(age(X1,X2),sigma)
| age(X1,X3) != zero
| ~ organization(X1)
| ~ dissimilar(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_3) ).
cnf(i_0_12,plain,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_12) ).
cnf(i_0_9,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X3,X2)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6gvcercm/input.p',i_0_9) ).
cnf(c_0_67,plain,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
i_0_1 ).
cnf(c_0_68,plain,
( has_immunity(X1,X2)
| epred1_2(X2,X1)
| ~ organization(X1) ),
i_0_5 ).
cnf(c_0_69,plain,
( epred1_2(X1,X2)
| has_endowment(X2)
| ~ organization(X2) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_70,negated_conjecture,
organization(esk3_0),
i_0_39 ).
cnf(c_0_71,negated_conjecture,
~ has_endowment(esk3_0),
i_0_37 ).
cnf(c_0_72,negated_conjecture,
smaller_or_equal(age(esk3_0,esk5_0),sigma),
i_0_32 ).
cnf(c_0_73,negated_conjecture,
tau = sigma,
i_0_33 ).
cnf(c_0_74,negated_conjecture,
( hazard_of_mortality(esk3_0,esk5_0) != hazard_of_mortality(esk3_0,esk4_0)
| ~ smaller(hazard_of_mortality(esk3_0,esk6_0),hazard_of_mortality(esk3_0,esk5_0)) ),
i_0_30 ).
cnf(c_0_75,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
i_0_22 ).
cnf(c_0_76,plain,
( hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2)
| ~ is_aligned(X1,X2)
| ~ epred1_2(X2,X1) ),
i_0_41 ).
cnf(c_0_77,negated_conjecture,
epred1_2(X1,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_78,plain,
( ~ robust_position(X1)
| ~ positional_advantage(X1,X2)
| ~ smaller_or_equal(age(X1,X2),tau) ),
i_0_18 ).
cnf(c_0_79,negated_conjecture,
smaller_or_equal(age(esk3_0,esk5_0),tau),
inference(rw,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_80,negated_conjecture,
robust_position(esk3_0),
i_0_38 ).
cnf(c_0_81,negated_conjecture,
( hazard_of_mortality(esk3_0,esk4_0) != hazard_of_mortality(esk3_0,esk5_0)
| ~ greater(hazard_of_mortality(esk3_0,esk5_0),hazard_of_mortality(esk3_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,plain,
( hazard_of_mortality(esk3_0,X1) = mod2
| positional_advantage(esk3_0,X1)
| ~ is_aligned(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_83,negated_conjecture,
~ positional_advantage(esk3_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_84,plain,
( hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| ~ positional_advantage(X1,X2)
| ~ epred1_2(X2,X1) ),
i_0_42 ).
cnf(c_0_85,negated_conjecture,
age(esk3_0,esk4_0) = zero,
i_0_36 ).
cnf(c_0_86,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
i_0_25 ).
cnf(c_0_87,plain,
( dissimilar(X1,X2,X3)
| age(X1,X2) != zero
| ~ organization(X1)
| ~ greater(age(X1,X3),sigma) ),
i_0_4 ).
cnf(c_0_88,negated_conjecture,
( hazard_of_mortality(esk3_0,esk4_0) != mod2
| ~ is_aligned(esk3_0,esk5_0)
| ~ greater(mod2,hazard_of_mortality(esk3_0,esk6_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]) ).
cnf(c_0_89,plain,
( hazard_of_mortality(esk3_0,X1) = mod1
| is_aligned(esk3_0,X1)
| ~ positional_advantage(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_77]) ).
cnf(c_0_90,plain,
greater(mod2,mod1),
i_0_7 ).
cnf(c_0_91,negated_conjecture,
( ~ positional_advantage(esk3_0,esk4_0)
| ~ smaller_or_equal(zero,tau) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_85]),c_0_80])]) ).
cnf(c_0_92,plain,
( smaller_or_equal(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_75]) ).
cnf(c_0_93,negated_conjecture,
greater(tau,zero),
i_0_34 ).
cnf(c_0_94,plain,
( ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3)
| ~ dissimilar(X1,X3,X2) ),
i_0_11 ).
cnf(c_0_95,plain,
( dissimilar(X1,X2,X3)
| age(X1,X2) != zero
| ~ greater(age(X1,X3),tau)
| ~ organization(X1) ),
inference(rw,[status(thm)],[c_0_87,c_0_73]) ).
cnf(c_0_96,plain,
( is_aligned(X1,X2)
| age(X1,X2) != zero
| ~ organization(X1) ),
i_0_2 ).
cnf(c_0_97,negated_conjecture,
greater(age(esk3_0,esk6_0),sigma),
i_0_31 ).
cnf(c_0_98,negated_conjecture,
( is_aligned(esk3_0,esk6_0)
| hazard_of_mortality(esk3_0,esk4_0) != mod2
| ~ positional_advantage(esk3_0,esk6_0)
| ~ is_aligned(esk3_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90])]) ).
cnf(c_0_99,negated_conjecture,
~ positional_advantage(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93])]) ).
cnf(c_0_100,plain,
( positional_advantage(X1,X2)
| ~ robust_position(X1)
| ~ greater(age(X1,X2),tau) ),
i_0_17 ).
cnf(c_0_101,plain,
( greater(age(X1,X2),sigma)
| age(X1,X3) != zero
| ~ organization(X1)
| ~ dissimilar(X1,X3,X2) ),
i_0_3 ).
cnf(c_0_102,plain,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
i_0_12 ).
cnf(c_0_103,plain,
( age(X1,X2) != zero
| ~ is_aligned(X1,X3)
| ~ greater(age(X1,X3),tau)
| ~ organization(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]) ).
cnf(c_0_104,negated_conjecture,
greater(age(esk3_0,esk6_0),tau),
inference(rw,[status(thm)],[c_0_97,c_0_73]) ).
cnf(c_0_105,plain,
( is_aligned(esk3_0,esk6_0)
| ~ positional_advantage(esk3_0,esk6_0)
| ~ is_aligned(esk3_0,esk5_0)
| ~ is_aligned(esk3_0,esk4_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_82]),c_0_99]) ).
cnf(c_0_106,negated_conjecture,
( positional_advantage(esk3_0,X1)
| ~ greater(age(esk3_0,X1),tau) ),
inference(spm,[status(thm)],[c_0_100,c_0_80]) ).
cnf(c_0_107,plain,
( greater(age(X1,X2),tau)
| age(X1,X3) != zero
| ~ dissimilar(X1,X3,X2) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_73]),c_0_102]) ).
cnf(c_0_108,plain,
( is_aligned(X1,X2)
| dissimilar(X1,X3,X2)
| ~ organization(X1)
| ~ is_aligned(X1,X3) ),
i_0_9 ).
cnf(c_0_109,negated_conjecture,
( age(esk3_0,X1) != zero
| ~ is_aligned(esk3_0,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_70])]) ).
cnf(c_0_110,negated_conjecture,
( is_aligned(esk3_0,esk6_0)
| ~ is_aligned(esk3_0,esk5_0)
| ~ is_aligned(esk3_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_104])]) ).
cnf(c_0_111,plain,
( is_aligned(X1,X2)
| greater(age(X1,X2),tau)
| age(X1,X3) != zero
| ~ organization(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_96]) ).
cnf(c_0_112,negated_conjecture,
( age(esk3_0,X1) != zero
| ~ is_aligned(esk3_0,esk5_0)
| ~ is_aligned(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_113,negated_conjecture,
( is_aligned(esk3_0,X1)
| age(esk3_0,X1) != zero ),
inference(spm,[status(thm)],[c_0_96,c_0_70]) ).
cnf(c_0_114,negated_conjecture,
~ greater(age(esk3_0,esk5_0),tau),
inference(spm,[status(thm)],[c_0_83,c_0_106]) ).
cnf(c_0_115,negated_conjecture,
( is_aligned(esk3_0,X1)
| greater(age(esk3_0,X1),tau) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_85]),c_0_70])]) ).
cnf(c_0_116,negated_conjecture,
( age(esk3_0,X1) != zero
| ~ is_aligned(esk3_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_85])]) ).
cnf(c_0_117,negated_conjecture,
is_aligned(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_118,negated_conjecture,
age(esk3_0,X1) != zero,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117])]) ).
cnf(c_0_119,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_85,c_0_118]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT062+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.34 % Computer : n020.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Mon Sep 7 13:38:15 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.12/0.44 # ENIGMATIC: Selected SinE mode:
% 0.12/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.66/3.86 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 12.66/3.86 # Version: 2.1pre011
% 12.66/3.86 # Preprocessing time : 0.009 s
% 12.66/3.86
% 12.66/3.86 # Proof found!
% 12.66/3.86 # SZS status Theorem
% 12.66/3.86 # SZS output start CNFRefutation
% See solution above
% 12.66/3.86 # Proof object total steps : 77
% 12.66/3.86 # Proof object clause steps : 53
% 12.66/3.86 # Proof object formula steps : 24
% 12.66/3.86 # Proof object conjectures : 38
% 12.66/3.86 # Proof object clause conjectures : 29
% 12.66/3.86 # Proof object formula conjectures : 9
% 12.66/3.86 # Proof object initial clauses used : 24
% 12.66/3.86 # Proof object initial formulas used : 24
% 12.66/3.86 # Proof object generating inferences : 23
% 12.66/3.86 # Proof object simplifying inferences : 29
% 12.66/3.86 # Training examples: 0 positive, 0 negative
% 12.66/3.86 # Parsed axioms : 43
% 12.66/3.86 # Removed by relevancy pruning/SinE : 0
% 12.66/3.86 # Initial clauses : 43
% 12.66/3.86 # Removed in clause preprocessing : 0
% 12.66/3.86 # Initial clauses in saturation : 43
% 12.66/3.86 # Processed clauses : 217
% 12.66/3.86 # ...of these trivial : 1
% 12.66/3.86 # ...subsumed : 66
% 12.66/3.86 # ...remaining for further processing : 150
% 12.66/3.86 # Other redundant clauses eliminated : 3
% 12.66/3.86 # Clauses deleted for lack of memory : 0
% 12.66/3.86 # Backward-subsumed : 13
% 12.66/3.86 # Backward-rewritten : 19
% 12.66/3.86 # Generated clauses : 536
% 12.66/3.86 # ...of the previous two non-trivial : 471
% 12.66/3.86 # Contextual simplify-reflections : 56
% 12.66/3.86 # Paramodulations : 518
% 12.66/3.86 # Factorizations : 14
% 12.66/3.86 # Equation resolutions : 3
% 12.66/3.86 # Propositional unsat checks : 0
% 12.66/3.86 # Propositional unsat check successes : 0
% 12.66/3.86 # Current number of processed clauses : 115
% 12.66/3.86 # Positive orientable unit clauses : 13
% 12.66/3.86 # Positive unorientable unit clauses: 0
% 12.66/3.86 # Negative unit clauses : 9
% 12.66/3.86 # Non-unit-clauses : 93
% 12.66/3.86 # Current number of unprocessed clauses: 207
% 12.66/3.86 # ...number of literals in the above : 1045
% 12.66/3.86 # Current number of archived formulas : 0
% 12.66/3.86 # Current number of archived clauses : 33
% 12.66/3.86 # Clause-clause subsumption calls (NU) : 4722
% 12.66/3.86 # Rec. Clause-clause subsumption calls : 2250
% 12.66/3.86 # Non-unit clause-clause subsumptions : 118
% 12.66/3.86 # Unit Clause-clause subsumption calls : 142
% 12.66/3.86 # Rewrite failures with RHS unbound : 0
% 12.66/3.86 # BW rewrite match attempts : 7
% 12.66/3.86 # BW rewrite match successes : 2
% 12.66/3.86 # Condensation attempts : 0
% 12.66/3.86 # Condensation successes : 0
% 12.66/3.86 # Termbank termtop insertions : 8607
% 12.66/3.86
% 12.66/3.86 # -------------------------------------------------
% 12.66/3.86 # User time : 0.019 s
% 12.66/3.86 # System time : 0.002 s
% 12.66/3.86 # Total time : 0.021 s
% 12.66/3.86 # ...preprocessing : 0.009 s
% 12.66/3.86 # ...main loop : 0.012 s
% 12.66/3.86 # Maximum resident set size: 6912 pages
% 12.66/3.86
%------------------------------------------------------------------------------