%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT059+1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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 11.70s 3.68s
% Output : CNFRefutation 11.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 11 unt; 0 nHn; 13 RR)
% Number of literals : 17 ( 6 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,plain,
( hazard_of_mortality(X1,X2) = very_low
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sw35rzr5/input.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
has_immunity(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sw35rzr5/input.p',i_0_5) ).
cnf(i_0_6,negated_conjecture,
organization(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sw35rzr5/input.p',i_0_6) ).
cnf(i_0_4,negated_conjecture,
has_immunity(esk1_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sw35rzr5/input.p',i_0_4) ).
cnf(i_0_3,negated_conjecture,
hazard_of_mortality(esk1_0,esk3_0) != hazard_of_mortality(esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sw35rzr5/input.p',i_0_3) ).
cnf(c_0_12,plain,
( hazard_of_mortality(X1,X2) = very_low
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
i_0_2 ).
cnf(c_0_13,negated_conjecture,
has_immunity(esk1_0,esk2_0),
i_0_5 ).
cnf(c_0_14,negated_conjecture,
organization(esk1_0),
i_0_6 ).
cnf(c_0_15,negated_conjecture,
has_immunity(esk1_0,esk3_0),
i_0_4 ).
cnf(c_0_16,negated_conjecture,
hazard_of_mortality(esk1_0,esk3_0) != hazard_of_mortality(esk1_0,esk2_0),
i_0_3 ).
cnf(c_0_17,negated_conjecture,
hazard_of_mortality(esk1_0,esk2_0) = very_low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_18,plain,
hazard_of_mortality(esk1_0,esk3_0) = very_low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_15]),c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT059+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.35 % Computer : n006.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 7 13:32:35 UTC 2026
% 0.12/0.35 % CPUTime :
% 0.12/0.45 # ENIGMATIC: Selected SinE mode:
% 0.21/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.70/3.68 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 11.70/3.68 # Version: 2.1pre011
% 11.70/3.68 # Preprocessing time : 0.014 s
% 11.70/3.68
% 11.70/3.68 # Proof found!
% 11.70/3.68 # SZS status Theorem
% 11.70/3.68 # SZS output start CNFRefutation
% See solution above
% 11.70/3.68 # Proof object total steps : 13
% 11.70/3.68 # Proof object clause steps : 8
% 11.70/3.68 # Proof object formula steps : 5
% 11.70/3.68 # Proof object conjectures : 10
% 11.70/3.68 # Proof object clause conjectures : 6
% 11.70/3.68 # Proof object formula conjectures : 4
% 11.70/3.68 # Proof object initial clauses used : 5
% 11.70/3.68 # Proof object initial formulas used : 5
% 11.70/3.68 # Proof object generating inferences : 2
% 11.70/3.68 # Proof object simplifying inferences : 7
% 11.70/3.68 # Training examples: 0 positive, 0 negative
% 11.70/3.68 # Parsed axioms : 10
% 11.70/3.68 # Removed by relevancy pruning/SinE : 0
% 11.70/3.68 # Initial clauses : 10
% 11.70/3.68 # Removed in clause preprocessing : 0
% 11.70/3.68 # Initial clauses in saturation : 10
% 11.70/3.68 # Processed clauses : 13
% 11.70/3.68 # ...of these trivial : 0
% 11.70/3.68 # ...subsumed : 0
% 11.70/3.68 # ...remaining for further processing : 12
% 11.70/3.68 # Other redundant clauses eliminated : 0
% 11.70/3.68 # Clauses deleted for lack of memory : 0
% 11.70/3.68 # Backward-subsumed : 0
% 11.70/3.68 # Backward-rewritten : 1
% 11.70/3.68 # Generated clauses : 7
% 11.70/3.68 # ...of the previous two non-trivial : 6
% 11.70/3.68 # Contextual simplify-reflections : 0
% 11.70/3.68 # Paramodulations : 7
% 11.70/3.68 # Factorizations : 0
% 11.70/3.68 # Equation resolutions : 0
% 11.70/3.68 # Propositional unsat checks : 0
% 11.70/3.68 # Propositional unsat check successes : 0
% 11.70/3.68 # Current number of processed clauses : 11
% 11.70/3.68 # Positive orientable unit clauses : 5
% 11.70/3.68 # Positive unorientable unit clauses: 0
% 11.70/3.68 # Negative unit clauses : 0
% 11.70/3.68 # Non-unit-clauses : 6
% 11.70/3.68 # Current number of unprocessed clauses: 3
% 11.70/3.68 # ...number of literals in the above : 10
% 11.70/3.68 # Current number of archived formulas : 0
% 11.70/3.68 # Current number of archived clauses : 1
% 11.70/3.68 # Clause-clause subsumption calls (NU) : 7
% 11.70/3.68 # Rec. Clause-clause subsumption calls : 1
% 11.70/3.68 # Non-unit clause-clause subsumptions : 0
% 11.70/3.68 # Unit Clause-clause subsumption calls : 0
% 11.70/3.68 # Rewrite failures with RHS unbound : 0
% 11.70/3.68 # BW rewrite match attempts : 1
% 11.70/3.68 # BW rewrite match successes : 1
% 11.70/3.68 # Condensation attempts : 0
% 11.70/3.68 # Condensation successes : 0
% 11.70/3.68 # Termbank termtop insertions : 302
% 11.70/3.68
% 11.70/3.68 # -------------------------------------------------
% 11.70/3.68 # User time : 0.013 s
% 11.70/3.68 # System time : 0.001 s
% 11.70/3.68 # Total time : 0.014 s
% 11.70/3.68 # ...preprocessing : 0.014 s
% 11.70/3.68 # ...main loop : 0.001 s
% 11.70/3.68 # Maximum resident set size: 6144 pages
% 11.70/3.68
%------------------------------------------------------------------------------