%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT056+1 : TPTP v9.3.0. Released v2.4.0.
% 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:00 AM UTC 2026
% Result : Theorem 13.27s 3.90s
% Output : CNFRefutation 13.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 21 unt; 6 nHn; 44 RR)
% Number of literals : 88 ( 13 equ; 45 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( has_immunity(X1,X2)
| ~ has_endowment(X1)
| ~ smaller_or_equal(age(X1,X2),eta) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_8) ).
cnf(i_0_22,negated_conjecture,
smaller_or_equal(age(esk3_0,esk5_0),eta),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_22) ).
cnf(i_0_24,negated_conjecture,
has_endowment(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_24) ).
cnf(i_0_7,plain,
( ~ has_endowment(X1)
| ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_7) ).
cnf(i_0_21,negated_conjecture,
greater(age(esk3_0,esk6_0),eta),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_21) ).
cnf(i_0_18,negated_conjecture,
( hazard_of_mortality(esk3_0,esk5_0) != hazard_of_mortality(esk3_0,esk4_0)
| ~ greater(hazard_of_mortality(esk3_0,esk6_0),hazard_of_mortality(esk3_0,esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_18) ).
cnf(i_0_2,plain,
( has_immunity(X1,X2)
| greater(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))
| ~ organization(X1)
| ~ has_immunity(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_2) ).
cnf(i_0_25,negated_conjecture,
organization(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_25) ).
cnf(i_0_1,plain,
( hazard_of_mortality(X1,X2) = hazard_of_mortality(X1,X3)
| ~ organization(X1)
| ~ has_immunity(X1,X3)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_1) ).
cnf(i_0_23,negated_conjecture,
age(esk3_0,esk4_0) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_23) ).
cnf(i_0_16,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_16) ).
cnf(i_0_13,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_13) ).
cnf(i_0_28,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_28) ).
cnf(i_0_19,negated_conjecture,
greater(sigma,zero),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_19) ).
cnf(i_0_12,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_12) ).
cnf(i_0_20,negated_conjecture,
greater_or_equal(eta,sigma),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eoscecf5/input.p',i_0_20) ).
cnf(c_0_45,plain,
( has_immunity(X1,X2)
| ~ has_endowment(X1)
| ~ smaller_or_equal(age(X1,X2),eta) ),
i_0_8 ).
cnf(c_0_46,negated_conjecture,
smaller_or_equal(age(esk3_0,esk5_0),eta),
i_0_22 ).
cnf(c_0_47,negated_conjecture,
has_endowment(esk3_0),
i_0_24 ).
cnf(c_0_48,plain,
( ~ has_endowment(X1)
| ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta) ),
i_0_7 ).
cnf(c_0_49,negated_conjecture,
greater(age(esk3_0,esk6_0),eta),
i_0_21 ).
cnf(c_0_50,negated_conjecture,
( hazard_of_mortality(esk3_0,esk5_0) != hazard_of_mortality(esk3_0,esk4_0)
| ~ greater(hazard_of_mortality(esk3_0,esk6_0),hazard_of_mortality(esk3_0,esk5_0)) ),
i_0_18 ).
cnf(c_0_51,plain,
( has_immunity(X1,X2)
| greater(hazard_of_mortality(X1,X2),hazard_of_mortality(X1,X3))
| ~ organization(X1)
| ~ has_immunity(X1,X3) ),
i_0_2 ).
cnf(c_0_52,negated_conjecture,
organization(esk3_0),
i_0_25 ).
cnf(c_0_53,negated_conjecture,
has_immunity(esk3_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_54,negated_conjecture,
~ has_immunity(esk3_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_47])]) ).
cnf(c_0_55,negated_conjecture,
hazard_of_mortality(esk3_0,esk4_0) != hazard_of_mortality(esk3_0,esk5_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),c_0_53])]),c_0_54]) ).
cnf(c_0_56,plain,
( hazard_of_mortality(X1,X2) = hazard_of_mortality(X1,X3)
| ~ organization(X1)
| ~ has_immunity(X1,X3)
| ~ has_immunity(X1,X2) ),
i_0_1 ).
cnf(c_0_57,negated_conjecture,
age(esk3_0,esk4_0) = zero,
i_0_23 ).
cnf(c_0_58,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
i_0_16 ).
cnf(c_0_59,plain,
( smaller(X1,X2)
| ~ greater(X2,X1) ),
i_0_13 ).
cnf(c_0_60,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
i_0_28 ).
cnf(c_0_61,negated_conjecture,
greater(sigma,zero),
i_0_19 ).
cnf(c_0_62,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
i_0_12 ).
cnf(c_0_63,negated_conjecture,
greater_or_equal(eta,sigma),
i_0_20 ).
cnf(c_0_64,plain,
( hazard_of_mortality(esk3_0,X1) != hazard_of_mortality(esk3_0,esk5_0)
| ~ has_immunity(esk3_0,esk4_0)
| ~ has_immunity(esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_52])]) ).
cnf(c_0_65,negated_conjecture,
( has_immunity(esk3_0,esk4_0)
| ~ smaller_or_equal(zero,eta) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_57]),c_0_47])]) ).
cnf(c_0_66,plain,
( smaller_or_equal(X1,X2)
| ~ greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_67,negated_conjecture,
( greater(X1,zero)
| ~ greater(X1,sigma) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_68,negated_conjecture,
( sigma = eta
| greater(eta,sigma) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
~ has_immunity(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_64]),c_0_53])]) ).
cnf(c_0_70,plain,
( has_immunity(esk3_0,esk4_0)
| ~ greater(eta,zero) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,negated_conjecture,
( sigma = eta
| greater(eta,zero) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,plain,
~ greater(eta,zero),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
sigma = eta,
inference(sr,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_73]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT056+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.37 % Computer : n008.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 7 13:28:24 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.27/3.90 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 13.27/3.90 # Version: 2.1pre011
% 13.27/3.90 # Preprocessing time : 0.015 s
% 13.27/3.90
% 13.27/3.90 # Proof found!
% 13.27/3.90 # SZS status Theorem
% 13.27/3.90 # SZS output start CNFRefutation
% See solution above
% 13.27/3.90 # Proof object total steps : 46
% 13.27/3.90 # Proof object clause steps : 30
% 13.27/3.90 # Proof object formula steps : 16
% 13.27/3.90 # Proof object conjectures : 25
% 13.27/3.90 # Proof object clause conjectures : 17
% 13.27/3.90 # Proof object formula conjectures : 8
% 13.27/3.90 # Proof object initial clauses used : 16
% 13.27/3.90 # Proof object initial formulas used : 16
% 13.27/3.90 # Proof object generating inferences : 12
% 13.27/3.90 # Proof object simplifying inferences : 18
% 13.27/3.90 # Training examples: 0 positive, 0 negative
% 13.27/3.90 # Parsed axioms : 28
% 13.27/3.90 # Removed by relevancy pruning/SinE : 0
% 13.27/3.90 # Initial clauses : 28
% 13.27/3.90 # Removed in clause preprocessing : 0
% 13.27/3.90 # Initial clauses in saturation : 28
% 13.27/3.90 # Processed clauses : 56
% 13.27/3.90 # ...of these trivial : 0
% 13.27/3.90 # ...subsumed : 2
% 13.27/3.90 # ...remaining for further processing : 54
% 13.27/3.90 # Other redundant clauses eliminated : 2
% 13.27/3.90 # Clauses deleted for lack of memory : 0
% 13.27/3.90 # Backward-subsumed : 0
% 13.27/3.90 # Backward-rewritten : 8
% 13.27/3.90 # Generated clauses : 87
% 13.27/3.90 # ...of the previous two non-trivial : 73
% 13.27/3.90 # Contextual simplify-reflections : 0
% 13.27/3.90 # Paramodulations : 81
% 13.27/3.90 # Factorizations : 2
% 13.27/3.90 # Equation resolutions : 3
% 13.27/3.90 # Propositional unsat checks : 0
% 13.27/3.90 # Propositional unsat check successes : 0
% 13.27/3.90 # Current number of processed clauses : 43
% 13.27/3.90 # Positive orientable unit clauses : 9
% 13.27/3.90 # Positive unorientable unit clauses: 0
% 13.27/3.90 # Negative unit clauses : 5
% 13.27/3.90 # Non-unit-clauses : 29
% 13.27/3.90 # Current number of unprocessed clauses: 32
% 13.27/3.90 # ...number of literals in the above : 133
% 13.27/3.90 # Current number of archived formulas : 0
% 13.27/3.90 # Current number of archived clauses : 9
% 13.27/3.90 # Clause-clause subsumption calls (NU) : 213
% 13.27/3.90 # Rec. Clause-clause subsumption calls : 153
% 13.27/3.90 # Non-unit clause-clause subsumptions : 1
% 13.27/3.90 # Unit Clause-clause subsumption calls : 39
% 13.27/3.90 # Rewrite failures with RHS unbound : 0
% 13.27/3.90 # BW rewrite match attempts : 7
% 13.27/3.90 # BW rewrite match successes : 1
% 13.27/3.90 # Condensation attempts : 0
% 13.27/3.90 # Condensation successes : 0
% 13.27/3.90 # Termbank termtop insertions : 1475
% 13.27/3.90
% 13.27/3.90 # -------------------------------------------------
% 13.27/3.90 # User time : 0.016 s
% 13.27/3.90 # System time : 0.002 s
% 13.27/3.90 # Total time : 0.018 s
% 13.27/3.90 # ...preprocessing : 0.015 s
% 13.27/3.90 # ...main loop : 0.004 s
% 13.27/3.90 # Maximum resident set size: 6400 pages
% 13.27/3.90
%------------------------------------------------------------------------------