TSTP Solution File: MGT060+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT060+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:06:52 EDT 2022
% Result : Theorem 4.61s 2.24s
% Output : CNFRefutation 4.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 46 ( 23 unt; 15 nHn; 43 RR)
% Number of literals : 98 ( 27 equ; 34 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
( has_immunity(X1,X2)
| epred1_2(X2,X1)
| ~ organization(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_1) ).
cnf(i_0_11,negated_conjecture,
organization(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_11) ).
cnf(i_0_9,negated_conjecture,
~ has_immunity(esk1_0,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_9) ).
cnf(i_0_23,plain,
( hazard_of_mortality(X1,X2) = high
| is_aligned(X1,X2)
| positional_advantage(X1,X2)
| ~ epred1_2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_23) ).
cnf(i_0_2,plain,
( hazard_of_mortality(X1,X2) = very_low
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_2) ).
cnf(i_0_10,negated_conjecture,
has_immunity(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_10) ).
cnf(i_0_25,plain,
( hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| ~ positional_advantage(X1,X2)
| ~ epred1_2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_25) ).
cnf(i_0_8,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_8) ).
cnf(i_0_22,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_22) ).
cnf(i_0_5,plain,
greater(low,very_low),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_5) ).
cnf(i_0_24,plain,
( hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2)
| ~ is_aligned(X1,X2)
| ~ epred1_2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_24) ).
cnf(i_0_7,plain,
greater(mod2,low),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_7) ).
cnf(i_0_26,plain,
( hazard_of_mortality(X1,X2) = low
| ~ is_aligned(X1,X2)
| ~ positional_advantage(X1,X2)
| ~ epred1_2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_26) ).
cnf(i_0_6,plain,
greater(high,mod2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_6) ).
cnf(i_0_4,plain,
greater(mod1,low),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-t_g_bnjw/input.p',i_0_4) ).
cnf(c_0_42,plain,
( has_immunity(X1,X2)
| epred1_2(X2,X1)
| ~ organization(X1) ),
i_0_1 ).
cnf(c_0_43,negated_conjecture,
organization(esk1_0),
i_0_11 ).
cnf(c_0_44,negated_conjecture,
~ has_immunity(esk1_0,esk3_0),
i_0_9 ).
cnf(c_0_45,negated_conjecture,
( epred1_2(X1,esk1_0)
| has_immunity(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( hazard_of_mortality(X1,X2) = high
| is_aligned(X1,X2)
| positional_advantage(X1,X2)
| ~ epred1_2(X2,X1) ),
i_0_23 ).
cnf(c_0_47,negated_conjecture,
epred1_2(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( hazard_of_mortality(X1,X2) = very_low
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
i_0_2 ).
cnf(c_0_49,negated_conjecture,
has_immunity(esk1_0,esk2_0),
i_0_10 ).
cnf(c_0_50,plain,
( hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| ~ positional_advantage(X1,X2)
| ~ epred1_2(X2,X1) ),
i_0_25 ).
cnf(c_0_51,plain,
( hazard_of_mortality(esk1_0,esk3_0) = high
| positional_advantage(esk1_0,esk3_0)
| is_aligned(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),hazard_of_mortality(esk1_0,esk2_0)),
i_0_8 ).
cnf(c_0_53,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_48,c_0_49]),c_0_43])]) ).
cnf(c_0_54,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
i_0_22 ).
cnf(c_0_55,plain,
greater(low,very_low),
i_0_5 ).
cnf(c_0_56,plain,
( hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2)
| ~ is_aligned(X1,X2)
| ~ epred1_2(X2,X1) ),
i_0_24 ).
cnf(c_0_57,plain,
( hazard_of_mortality(esk1_0,esk3_0) = high
| hazard_of_mortality(esk1_0,esk3_0) = mod1
| is_aligned(esk1_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_47])]) ).
cnf(c_0_58,plain,
greater(mod2,low),
i_0_7 ).
cnf(c_0_59,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),very_low),
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( greater(X1,very_low)
| ~ greater(X1,low) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
( hazard_of_mortality(X1,X2) = low
| ~ is_aligned(X1,X2)
| ~ positional_advantage(X1,X2)
| ~ epred1_2(X2,X1) ),
i_0_26 ).
cnf(c_0_62,plain,
( hazard_of_mortality(esk1_0,esk3_0) = mod1
| hazard_of_mortality(esk1_0,esk3_0) = high
| hazard_of_mortality(esk1_0,esk3_0) = mod2
| positional_advantage(esk1_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_47])]) ).
cnf(c_0_63,plain,
( greater(X1,low)
| ~ greater(X1,mod2) ),
inference(spm,[status(thm)],[c_0_54,c_0_58]) ).
cnf(c_0_64,plain,
greater(high,mod2),
i_0_6 ).
cnf(c_0_65,negated_conjecture,
~ greater(hazard_of_mortality(esk1_0,esk3_0),low),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
( hazard_of_mortality(esk1_0,esk3_0) = mod2
| hazard_of_mortality(esk1_0,esk3_0) = high
| hazard_of_mortality(esk1_0,esk3_0) = mod1
| hazard_of_mortality(esk1_0,esk3_0) = low ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_47])]),c_0_57]) ).
cnf(c_0_67,plain,
greater(high,low),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
( hazard_of_mortality(esk1_0,esk3_0) = low
| hazard_of_mortality(esk1_0,esk3_0) = mod1
| hazard_of_mortality(esk1_0,esk3_0) = mod2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_69,negated_conjecture,
( hazard_of_mortality(esk1_0,esk3_0) = mod1
| hazard_of_mortality(esk1_0,esk3_0) = low ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_68]),c_0_58])]) ).
cnf(c_0_70,plain,
greater(mod1,low),
i_0_4 ).
cnf(c_0_71,negated_conjecture,
hazard_of_mortality(esk1_0,esk3_0) = low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_69]),c_0_70])]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_71]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT060+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n018.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jun 9 08:03:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.61/2.24 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 4.61/2.24 # Version: 2.1pre011
% 4.61/2.24 # Preprocessing time : 0.010 s
% 4.61/2.24
% 4.61/2.24 # Proof found!
% 4.61/2.24 # SZS status Theorem
% 4.61/2.24 # SZS output start CNFRefutation
% See solution above
% 4.61/2.24 # Proof object total steps : 46
% 4.61/2.24 # Proof object clause steps : 31
% 4.61/2.24 # Proof object formula steps : 15
% 4.61/2.24 # Proof object conjectures : 17
% 4.61/2.24 # Proof object clause conjectures : 13
% 4.61/2.24 # Proof object formula conjectures : 4
% 4.61/2.24 # Proof object initial clauses used : 15
% 4.61/2.24 # Proof object initial formulas used : 15
% 4.61/2.24 # Proof object generating inferences : 14
% 4.61/2.24 # Proof object simplifying inferences : 19
% 4.61/2.24 # Training examples: 0 positive, 0 negative
% 4.61/2.24 # Parsed axioms : 26
% 4.61/2.24 # Removed by relevancy pruning/SinE : 0
% 4.61/2.24 # Initial clauses : 26
% 4.61/2.24 # Removed in clause preprocessing : 0
% 4.61/2.24 # Initial clauses in saturation : 26
% 4.61/2.24 # Processed clauses : 82
% 4.61/2.24 # ...of these trivial : 0
% 4.61/2.24 # ...subsumed : 10
% 4.61/2.24 # ...remaining for further processing : 72
% 4.61/2.24 # Other redundant clauses eliminated : 2
% 4.61/2.24 # Clauses deleted for lack of memory : 0
% 4.61/2.24 # Backward-subsumed : 3
% 4.61/2.24 # Backward-rewritten : 11
% 4.61/2.24 # Generated clauses : 154
% 4.61/2.24 # ...of the previous two non-trivial : 145
% 4.61/2.24 # Contextual simplify-reflections : 4
% 4.61/2.24 # Paramodulations : 144
% 4.61/2.24 # Factorizations : 8
% 4.61/2.24 # Equation resolutions : 2
% 4.61/2.24 # Propositional unsat checks : 0
% 4.61/2.24 # Propositional unsat check successes : 0
% 4.61/2.24 # Current number of processed clauses : 56
% 4.61/2.24 # Positive orientable unit clauses : 13
% 4.61/2.24 # Positive unorientable unit clauses: 0
% 4.61/2.24 # Negative unit clauses : 8
% 4.61/2.24 # Non-unit-clauses : 35
% 4.61/2.24 # Current number of unprocessed clauses: 49
% 4.61/2.24 # ...number of literals in the above : 154
% 4.61/2.24 # Current number of archived formulas : 0
% 4.61/2.24 # Current number of archived clauses : 14
% 4.61/2.24 # Clause-clause subsumption calls (NU) : 307
% 4.61/2.24 # Rec. Clause-clause subsumption calls : 283
% 4.61/2.24 # Non-unit clause-clause subsumptions : 13
% 4.61/2.24 # Unit Clause-clause subsumption calls : 112
% 4.61/2.24 # Rewrite failures with RHS unbound : 0
% 4.61/2.24 # BW rewrite match attempts : 4
% 4.61/2.24 # BW rewrite match successes : 2
% 4.61/2.24 # Condensation attempts : 0
% 4.61/2.24 # Condensation successes : 0
% 4.61/2.24 # Termbank termtop insertions : 1668
% 4.61/2.24
% 4.61/2.24 # -------------------------------------------------
% 4.61/2.24 # User time : 0.009 s
% 4.61/2.24 # System time : 0.004 s
% 4.61/2.24 # Total time : 0.012 s
% 4.61/2.24 # ...preprocessing : 0.010 s
% 4.61/2.24 # ...main loop : 0.003 s
% 4.61/2.24 # Maximum resident set size: 7136 pages
% 4.61/2.24
%------------------------------------------------------------------------------