TSTP Solution File: MGT057+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT057+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:51 EDT 2022
% Result : Theorem 7.51s 2.43s
% Output : CNFRefutation 7.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 42 ( 20 unt; 5 nHn; 36 RR)
% Number of literals : 80 ( 15 equ; 42 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( ~ has_endowment(X1)
| ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_7) ).
cnf(i_0_23,negated_conjecture,
greater(age(esk3_0,esk6_0),eta),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_23) ).
cnf(i_0_26,negated_conjecture,
has_endowment(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_26) ).
cnf(i_0_21,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/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_21) ).
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/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_2) ).
cnf(i_0_27,negated_conjecture,
organization(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_27) ).
cnf(i_0_8,plain,
( has_immunity(X1,X2)
| ~ has_endowment(X1)
| ~ smaller_or_equal(age(X1,X2),eta) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_8) ).
cnf(i_0_24,negated_conjecture,
smaller_or_equal(age(esk3_0,esk5_0),eta),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_24) ).
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/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_1) ).
cnf(i_0_25,negated_conjecture,
age(esk3_0,esk4_0) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_25) ).
cnf(i_0_16,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_16) ).
cnf(i_0_18,plain,
( X1 = X2
| greater(X1,X2)
| smaller(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_18) ).
cnf(i_0_19,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_19) ).
cnf(i_0_22,negated_conjecture,
greater(eta,zero),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_22) ).
cnf(i_0_15,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0o0nowui/input.p',i_0_15) ).
cnf(c_0_43,plain,
( ~ has_endowment(X1)
| ~ has_immunity(X1,X2)
| ~ greater(age(X1,X2),eta) ),
i_0_7 ).
cnf(c_0_44,negated_conjecture,
greater(age(esk3_0,esk6_0),eta),
i_0_23 ).
cnf(c_0_45,negated_conjecture,
has_endowment(esk3_0),
i_0_26 ).
cnf(c_0_46,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_21 ).
cnf(c_0_47,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_48,negated_conjecture,
organization(esk3_0),
i_0_27 ).
cnf(c_0_49,negated_conjecture,
~ has_immunity(esk3_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_50,plain,
( has_immunity(X1,X2)
| ~ has_endowment(X1)
| ~ smaller_or_equal(age(X1,X2),eta) ),
i_0_8 ).
cnf(c_0_51,negated_conjecture,
smaller_or_equal(age(esk3_0,esk5_0),eta),
i_0_24 ).
cnf(c_0_52,negated_conjecture,
( hazard_of_mortality(esk3_0,esk4_0) != hazard_of_mortality(esk3_0,esk5_0)
| ~ has_immunity(esk3_0,esk5_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]),c_0_49]) ).
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_50,c_0_51]),c_0_45])]) ).
cnf(c_0_54,negated_conjecture,
hazard_of_mortality(esk3_0,esk4_0) != hazard_of_mortality(esk3_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_55,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_56,negated_conjecture,
age(esk3_0,esk4_0) = zero,
i_0_25 ).
cnf(c_0_57,plain,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
i_0_16 ).
cnf(c_0_58,plain,
( X1 = X2
| greater(X1,X2)
| smaller(X1,X2) ),
i_0_18 ).
cnf(c_0_59,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_54,c_0_55]),c_0_48])]) ).
cnf(c_0_60,plain,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
i_0_19 ).
cnf(c_0_61,negated_conjecture,
greater(eta,zero),
i_0_22 ).
cnf(c_0_62,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_50,c_0_56]),c_0_45])]) ).
cnf(c_0_63,plain,
( X1 = X2
| smaller_or_equal(X1,X2)
| greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_64,plain,
~ has_immunity(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_59]),c_0_53])]) ).
cnf(c_0_65,negated_conjecture,
~ greater(zero,eta),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,plain,
( smaller_or_equal(X1,X2)
| X1 != X2 ),
i_0_15 ).
cnf(c_0_67,negated_conjecture,
zero = eta,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65]) ).
cnf(c_0_68,plain,
smaller_or_equal(X1,X1),
inference(er,[status(thm)],[c_0_66]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_67]),c_0_68])]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT057+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 12:21:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.47 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.51/2.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.51/2.43 # Version: 2.1pre011
% 7.51/2.43 # Preprocessing time : 0.010 s
% 7.51/2.43
% 7.51/2.43 # Proof found!
% 7.51/2.43 # SZS status Theorem
% 7.51/2.43 # SZS output start CNFRefutation
% See solution above
% 7.51/2.43 # Proof object total steps : 42
% 7.51/2.43 # Proof object clause steps : 27
% 7.51/2.43 # Proof object formula steps : 15
% 7.51/2.43 # Proof object conjectures : 22
% 7.51/2.43 # Proof object clause conjectures : 15
% 7.51/2.43 # Proof object formula conjectures : 7
% 7.51/2.43 # Proof object initial clauses used : 15
% 7.51/2.43 # Proof object initial formulas used : 15
% 7.51/2.43 # Proof object generating inferences : 9
% 7.51/2.43 # Proof object simplifying inferences : 22
% 7.51/2.43 # Training examples: 0 positive, 0 negative
% 7.51/2.43 # Parsed axioms : 27
% 7.51/2.43 # Removed by relevancy pruning/SinE : 0
% 7.51/2.43 # Initial clauses : 27
% 7.51/2.43 # Removed in clause preprocessing : 0
% 7.51/2.43 # Initial clauses in saturation : 27
% 7.51/2.43 # Processed clauses : 49
% 7.51/2.43 # ...of these trivial : 0
% 7.51/2.43 # ...subsumed : 3
% 7.51/2.43 # ...remaining for further processing : 46
% 7.51/2.43 # Other redundant clauses eliminated : 2
% 7.51/2.43 # Clauses deleted for lack of memory : 0
% 7.51/2.43 # Backward-subsumed : 0
% 7.51/2.43 # Backward-rewritten : 8
% 7.51/2.43 # Generated clauses : 79
% 7.51/2.43 # ...of the previous two non-trivial : 64
% 7.51/2.43 # Contextual simplify-reflections : 1
% 7.51/2.43 # Paramodulations : 74
% 7.51/2.43 # Factorizations : 2
% 7.51/2.43 # Equation resolutions : 3
% 7.51/2.43 # Propositional unsat checks : 0
% 7.51/2.43 # Propositional unsat check successes : 0
% 7.51/2.43 # Current number of processed clauses : 36
% 7.51/2.43 # Positive orientable unit clauses : 8
% 7.51/2.43 # Positive unorientable unit clauses: 0
% 7.51/2.43 # Negative unit clauses : 4
% 7.51/2.43 # Non-unit-clauses : 24
% 7.51/2.43 # Current number of unprocessed clauses: 32
% 7.51/2.43 # ...number of literals in the above : 132
% 7.51/2.43 # Current number of archived formulas : 0
% 7.51/2.43 # Current number of archived clauses : 8
% 7.51/2.43 # Clause-clause subsumption calls (NU) : 223
% 7.51/2.43 # Rec. Clause-clause subsumption calls : 158
% 7.51/2.43 # Non-unit clause-clause subsumptions : 1
% 7.51/2.43 # Unit Clause-clause subsumption calls : 32
% 7.51/2.43 # Rewrite failures with RHS unbound : 0
% 7.51/2.43 # BW rewrite match attempts : 7
% 7.51/2.43 # BW rewrite match successes : 2
% 7.51/2.43 # Condensation attempts : 0
% 7.51/2.43 # Condensation successes : 0
% 7.51/2.43 # Termbank termtop insertions : 1429
% 7.51/2.43
% 7.51/2.43 # -------------------------------------------------
% 7.51/2.43 # User time : 0.009 s
% 7.51/2.43 # System time : 0.003 s
% 7.51/2.43 # Total time : 0.012 s
% 7.51/2.43 # ...preprocessing : 0.010 s
% 7.51/2.43 # ...main loop : 0.002 s
% 7.51/2.43 # Maximum resident set size: 7132 pages
% 7.51/2.43
%------------------------------------------------------------------------------