TSTP Solution File: MGT064-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT064-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:35:54 EDT 2023
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 32
% Syntax : Number of clauses : 107 ( 38 unt; 25 nHn; 99 RR)
% Number of literals : 246 ( 44 equ; 128 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 118 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(assumption_15_56,axiom,
( greater(age(X1,X3),sigma)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ dissimilar(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',assumption_15_56) ).
cnf(definition_2_47,axiom,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',definition_2_47) ).
cnf(definition_smaller_or_equal_1,axiom,
( smaller(X1,X2)
| X1 = X2
| ~ smaller_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',definition_smaller_or_equal_1) ).
cnf(theorem_10_83,negated_conjecture,
smaller_or_equal(age(sk3,sk6),sigma),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_83) ).
cnf(definition_4_57,axiom,
( ~ robust_position(X1)
| ~ smaller_or_equal(age(X1,X2),tau)
| ~ positional_advantage(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',definition_4_57) ).
cnf(theorem_10_81,negated_conjecture,
smaller_or_equal(age(sk3,sk5),tau),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_81) ).
cnf(theorem_10_75,negated_conjecture,
robust_position(sk3),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_75) ).
cnf(definition_4_58,axiom,
( positional_advantage(X1,X2)
| ~ robust_position(X1)
| ~ greater(age(X1,X2),tau) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',definition_4_58) ).
cnf(definition_2_51,axiom,
( is_aligned(X1,X3)
| dissimilar(X1,X2,X3)
| ~ organization(X1)
| ~ is_aligned(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',definition_2_51) ).
cnf(assumption_13_54,axiom,
( is_aligned(X1,X2)
| ~ organization(X1)
| age(X1,X2) != zero ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',assumption_13_54) ).
cnf(definition_smaller_7,axiom,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',definition_smaller_7) ).
cnf(meaning_postulate_greater_transitive_10,axiom,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',meaning_postulate_greater_transitive_10) ).
cnf(theorem_10_80,negated_conjecture,
greater(sigma,tau),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_80) ).
cnf(theorem_10_77,negated_conjecture,
age(sk3,sk4) = zero,
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_77) ).
cnf(theorem_10_74,negated_conjecture,
organization(sk3),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_74) ).
cnf(meaning_postulate_greater_strict_9,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',meaning_postulate_greater_strict_9) ).
cnf(definition_smaller_or_equal_2,axiom,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',definition_smaller_or_equal_2) ).
cnf(assumption_1_46,axiom,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',assumption_1_46) ).
cnf(assumption_17_66,axiom,
( has_immunity(X1,X2)
| positional_advantage(X1,X2)
| hazard_of_mortality(X1,X2) = mod2
| ~ organization(X1)
| ~ is_aligned(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',assumption_17_66) ).
cnf(theorem_10_85,negated_conjecture,
( ~ smaller(hazard_of_mortality(sk3,sk6),hazard_of_mortality(sk3,sk7))
| ~ smaller(hazard_of_mortality(sk3,sk7),hazard_of_mortality(sk3,sk5))
| hazard_of_mortality(sk3,sk5) != hazard_of_mortality(sk3,sk4) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_85) ).
cnf(definition_smaller_8,axiom,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',definition_smaller_8) ).
cnf(theorem_10_76,negated_conjecture,
~ has_endowment(sk3),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_76) ).
cnf(assumption_17_64,axiom,
( has_immunity(X1,X2)
| hazard_of_mortality(X1,X2) = low
| ~ organization(X1)
| ~ is_aligned(X1,X2)
| ~ positional_advantage(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',assumption_17_64) ).
cnf(definition_2_49,axiom,
( ~ dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',definition_2_49) ).
cnf(assumption_15_55,axiom,
( dissimilar(X1,X2,X3)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ greater(age(X1,X3),sigma) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',assumption_15_55) ).
cnf(theorem_10_79,negated_conjecture,
greater(tau,zero),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_79) ).
cnf(assumption_17_65,axiom,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| hazard_of_mortality(X1,X2) = mod1
| ~ organization(X1)
| ~ positional_advantage(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',assumption_17_65) ).
cnf(theorem_10_84,negated_conjecture,
greater(age(sk3,sk7),sigma),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_84) ).
cnf(meaning_postulate_greater_comparable_11,axiom,
( smaller(X1,X2)
| X1 = X2
| greater(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',meaning_postulate_greater_comparable_11) ).
cnf(theorem_10_82,negated_conjecture,
greater(age(sk3,sk6),tau),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',theorem_10_82) ).
cnf(assumption_18b_69,axiom,
greater(mod1,low),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',assumption_18b_69) ).
cnf(assumption_19_73,axiom,
greater(mod2,mod1),
file('/export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p',assumption_19_73) ).
cnf(c_0_32,axiom,
( greater(age(X1,X3),sigma)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ dissimilar(X1,X2,X3) ),
assumption_15_56 ).
cnf(c_0_33,axiom,
( organization(X1)
| ~ dissimilar(X1,X2,X3) ),
definition_2_47 ).
cnf(c_0_34,axiom,
( smaller(X1,X2)
| X1 = X2
| ~ smaller_or_equal(X1,X2) ),
definition_smaller_or_equal_1 ).
cnf(c_0_35,negated_conjecture,
smaller_or_equal(age(sk3,sk6),sigma),
theorem_10_83 ).
cnf(c_0_36,axiom,
( ~ robust_position(X1)
| ~ smaller_or_equal(age(X1,X2),tau)
| ~ positional_advantage(X1,X2) ),
definition_4_57 ).
cnf(c_0_37,negated_conjecture,
smaller_or_equal(age(sk3,sk5),tau),
theorem_10_81 ).
cnf(c_0_38,negated_conjecture,
robust_position(sk3),
theorem_10_75 ).
cnf(c_0_39,axiom,
( positional_advantage(X1,X2)
| ~ robust_position(X1)
| ~ greater(age(X1,X2),tau) ),
definition_4_58 ).
cnf(c_0_40,plain,
( greater(age(X1,X2),sigma)
| age(X1,X3) != zero
| ~ dissimilar(X1,X3,X2) ),
inference(csr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,axiom,
( is_aligned(X1,X3)
| dissimilar(X1,X2,X3)
| ~ organization(X1)
| ~ is_aligned(X1,X2) ),
definition_2_51 ).
cnf(c_0_42,axiom,
( is_aligned(X1,X2)
| ~ organization(X1)
| age(X1,X2) != zero ),
assumption_13_54 ).
cnf(c_0_43,axiom,
( greater(X2,X1)
| ~ smaller(X1,X2) ),
definition_smaller_7 ).
cnf(c_0_44,negated_conjecture,
( age(sk3,sk6) = sigma
| smaller(age(sk3,sk6),sigma) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,negated_conjecture,
~ positional_advantage(sk3,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_46,negated_conjecture,
( positional_advantage(sk3,X1)
| ~ greater(age(sk3,X1),tau) ),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_47,axiom,
( greater(X1,X3)
| ~ greater(X1,X2)
| ~ greater(X2,X3) ),
meaning_postulate_greater_transitive_10 ).
cnf(c_0_48,negated_conjecture,
greater(sigma,tau),
theorem_10_80 ).
cnf(c_0_49,plain,
( is_aligned(X1,X2)
| greater(age(X1,X2),sigma)
| age(X1,X3) != zero
| ~ organization(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
age(sk3,sk4) = zero,
theorem_10_77 ).
cnf(c_0_51,negated_conjecture,
organization(sk3),
theorem_10_74 ).
cnf(c_0_52,axiom,
( ~ greater(X1,X2)
| ~ greater(X2,X1) ),
meaning_postulate_greater_strict_9 ).
cnf(c_0_53,negated_conjecture,
( age(sk3,sk6) = sigma
| greater(sigma,age(sk3,sk6)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_54,negated_conjecture,
~ greater(age(sk3,sk5),tau),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_55,negated_conjecture,
( greater(X1,tau)
| ~ greater(X1,sigma) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,axiom,
( smaller_or_equal(X1,X2)
| ~ smaller(X1,X2) ),
definition_smaller_or_equal_2 ).
cnf(c_0_57,axiom,
( has_endowment(X1)
| ~ organization(X1)
| ~ has_immunity(X1,X2) ),
assumption_1_46 ).
cnf(c_0_58,axiom,
( has_immunity(X1,X2)
| positional_advantage(X1,X2)
| hazard_of_mortality(X1,X2) = mod2
| ~ organization(X1)
| ~ is_aligned(X1,X2) ),
assumption_17_66 ).
cnf(c_0_59,negated_conjecture,
( is_aligned(sk3,X1)
| greater(age(sk3,X1),sigma) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_60,negated_conjecture,
( age(sk3,sk6) = sigma
| ~ greater(age(sk3,sk6),sigma) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
( ~ smaller(hazard_of_mortality(sk3,sk6),hazard_of_mortality(sk3,sk7))
| ~ smaller(hazard_of_mortality(sk3,sk7),hazard_of_mortality(sk3,sk5))
| hazard_of_mortality(sk3,sk5) != hazard_of_mortality(sk3,sk4) ),
theorem_10_85 ).
cnf(c_0_62,axiom,
( smaller(X2,X1)
| ~ greater(X1,X2) ),
definition_smaller_8 ).
cnf(c_0_63,negated_conjecture,
~ greater(age(sk3,sk5),sigma),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_64,plain,
( ~ positional_advantage(X1,X2)
| ~ robust_position(X1)
| ~ smaller(age(X1,X2),tau) ),
inference(spm,[status(thm)],[c_0_36,c_0_56]) ).
cnf(c_0_65,plain,
( hazard_of_mortality(X1,X2) = mod2
| positional_advantage(X1,X2)
| has_endowment(X1)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_66,negated_conjecture,
is_aligned(sk3,sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_50]),c_0_51])]) ).
cnf(c_0_67,negated_conjecture,
~ has_endowment(sk3),
theorem_10_76 ).
cnf(c_0_68,axiom,
( has_immunity(X1,X2)
| hazard_of_mortality(X1,X2) = low
| ~ organization(X1)
| ~ is_aligned(X1,X2)
| ~ positional_advantage(X1,X2) ),
assumption_17_64 ).
cnf(c_0_69,negated_conjecture,
( is_aligned(sk3,X1)
| ~ greater(sigma,age(sk3,X1)) ),
inference(spm,[status(thm)],[c_0_52,c_0_59]) ).
cnf(c_0_70,negated_conjecture,
( age(sk3,sk6) = sigma
| is_aligned(sk3,sk6) ),
inference(spm,[status(thm)],[c_0_60,c_0_59]) ).
cnf(c_0_71,axiom,
( ~ dissimilar(X1,X2,X3)
| ~ is_aligned(X1,X2)
| ~ is_aligned(X1,X3) ),
definition_2_49 ).
cnf(c_0_72,axiom,
( dissimilar(X1,X2,X3)
| ~ organization(X1)
| age(X1,X2) != zero
| ~ greater(age(X1,X3),sigma) ),
assumption_15_55 ).
cnf(c_0_73,negated_conjecture,
( hazard_of_mortality(sk3,sk4) != hazard_of_mortality(sk3,sk5)
| ~ greater(hazard_of_mortality(sk3,sk5),hazard_of_mortality(sk3,sk7))
| ~ smaller(hazard_of_mortality(sk3,sk6),hazard_of_mortality(sk3,sk7)) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_74,negated_conjecture,
is_aligned(sk3,sk5),
inference(spm,[status(thm)],[c_0_63,c_0_59]) ).
cnf(c_0_75,plain,
( ~ positional_advantage(X1,X2)
| ~ robust_position(X1)
| ~ greater(tau,age(X1,X2)) ),
inference(spm,[status(thm)],[c_0_64,c_0_62]) ).
cnf(c_0_76,negated_conjecture,
( hazard_of_mortality(sk3,sk4) = mod2
| positional_advantage(sk3,sk4) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_51])]),c_0_67]) ).
cnf(c_0_77,negated_conjecture,
greater(tau,zero),
theorem_10_79 ).
cnf(c_0_78,plain,
( hazard_of_mortality(X1,X2) = low
| has_endowment(X1)
| ~ positional_advantage(X1,X2)
| ~ is_aligned(X1,X2)
| ~ organization(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_68]) ).
cnf(c_0_79,negated_conjecture,
( is_aligned(sk3,sk6)
| ~ greater(sigma,sigma) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_80,axiom,
( has_immunity(X1,X2)
| is_aligned(X1,X2)
| hazard_of_mortality(X1,X2) = mod1
| ~ organization(X1)
| ~ positional_advantage(X1,X2) ),
assumption_17_65 ).
cnf(c_0_81,negated_conjecture,
greater(age(sk3,sk7),sigma),
theorem_10_84 ).
cnf(c_0_82,axiom,
( smaller(X1,X2)
| X1 = X2
| greater(X1,X2) ),
meaning_postulate_greater_comparable_11 ).
cnf(c_0_83,plain,
( age(X1,X2) != zero
| ~ is_aligned(X1,X3)
| ~ organization(X1)
| ~ greater(age(X1,X3),sigma) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_42]) ).
cnf(c_0_84,negated_conjecture,
( hazard_of_mortality(sk3,sk4) != hazard_of_mortality(sk3,sk5)
| ~ greater(hazard_of_mortality(sk3,sk5),hazard_of_mortality(sk3,sk7))
| ~ greater(hazard_of_mortality(sk3,sk7),hazard_of_mortality(sk3,sk6)) ),
inference(spm,[status(thm)],[c_0_73,c_0_62]) ).
cnf(c_0_85,negated_conjecture,
hazard_of_mortality(sk3,sk5) = mod2,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_74]),c_0_51])]),c_0_45]),c_0_67]) ).
cnf(c_0_86,negated_conjecture,
hazard_of_mortality(sk3,sk4) = mod2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_38]),c_0_50]),c_0_77])]) ).
cnf(c_0_87,negated_conjecture,
( hazard_of_mortality(sk3,X1) = low
| ~ is_aligned(sk3,X1)
| ~ greater(age(sk3,X1),tau) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_46]),c_0_51])]),c_0_67]) ).
cnf(c_0_88,negated_conjecture,
greater(age(sk3,sk6),tau),
theorem_10_82 ).
cnf(c_0_89,negated_conjecture,
is_aligned(sk3,sk6),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_70]),c_0_79]) ).
cnf(c_0_90,plain,
( hazard_of_mortality(X1,X2) = mod1
| is_aligned(X1,X2)
| has_endowment(X1)
| ~ positional_advantage(X1,X2)
| ~ organization(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_80]) ).
cnf(c_0_91,negated_conjecture,
( greater(X1,sigma)
| ~ greater(X1,age(sk3,sk7)) ),
inference(spm,[status(thm)],[c_0_47,c_0_81]) ).
cnf(c_0_92,plain,
( X1 = X2
| greater(X1,X2)
| greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_82]) ).
cnf(c_0_93,negated_conjecture,
( age(sk3,X1) != zero
| ~ is_aligned(sk3,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_81]),c_0_51])]) ).
cnf(c_0_94,negated_conjecture,
( ~ greater(hazard_of_mortality(sk3,sk7),hazard_of_mortality(sk3,sk6))
| ~ greater(mod2,hazard_of_mortality(sk3,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_85]),c_0_86])]) ).
cnf(c_0_95,negated_conjecture,
hazard_of_mortality(sk3,sk6) = low,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]) ).
cnf(c_0_96,negated_conjecture,
( hazard_of_mortality(sk3,X1) = mod1
| is_aligned(sk3,X1)
| ~ greater(age(sk3,X1),tau) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_46]),c_0_51])]),c_0_67]) ).
cnf(c_0_97,negated_conjecture,
( age(sk3,sk7) = X1
| greater(age(sk3,sk7),X1)
| greater(X1,sigma) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_98,negated_conjecture,
~ is_aligned(sk3,sk7),
inference(spm,[status(thm)],[c_0_93,c_0_50]) ).
cnf(c_0_99,negated_conjecture,
~ greater(tau,sigma),
inference(spm,[status(thm)],[c_0_52,c_0_48]) ).
cnf(c_0_100,negated_conjecture,
( ~ greater(hazard_of_mortality(sk3,sk7),low)
| ~ greater(mod2,hazard_of_mortality(sk3,sk7)) ),
inference(rw,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_101,negated_conjecture,
( age(sk3,sk7) = tau
| hazard_of_mortality(sk3,sk7) = mod1 ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_98]),c_0_99]) ).
cnf(c_0_102,axiom,
greater(mod1,low),
assumption_18b_69 ).
cnf(c_0_103,axiom,
greater(mod2,mod1),
assumption_19_73 ).
cnf(c_0_104,negated_conjecture,
~ greater(sigma,age(sk3,sk7)),
inference(spm,[status(thm)],[c_0_52,c_0_81]) ).
cnf(c_0_105,negated_conjecture,
age(sk3,sk7) = tau,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),c_0_103])]) ).
cnf(c_0_106,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : MGT064-1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n023.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 00:44:37 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.QpFAA17jH8/E---3.1_27694.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # new_bool_1 with pid 27774 completed with status 0
% 0.15/0.44 # Result found by new_bool_1
% 0.15/0.44 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # SAT001_MinMin_p005000_rr_RG with pid 27778 completed with status 0
% 0.15/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.44 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Unsatisfiable
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 58
% 0.15/0.44 # Removed by relevancy pruning/SinE : 15
% 0.15/0.44 # Initial clauses : 43
% 0.15/0.44 # Removed in clause preprocessing : 2
% 0.15/0.44 # Initial clauses in saturation : 41
% 0.15/0.44 # Processed clauses : 497
% 0.15/0.44 # ...of these trivial : 2
% 0.15/0.44 # ...subsumed : 203
% 0.15/0.44 # ...remaining for further processing : 292
% 0.15/0.44 # Other redundant clauses eliminated : 1
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 8
% 0.15/0.44 # Backward-rewritten : 48
% 0.15/0.44 # Generated clauses : 784
% 0.15/0.44 # ...of the previous two non-redundant : 667
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 4
% 0.15/0.44 # Paramodulations : 780
% 0.15/0.44 # Factorizations : 3
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 1
% 0.15/0.44 # Total rewrite steps : 292
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 194
% 0.15/0.44 # Positive orientable unit clauses : 23
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 15
% 0.15/0.44 # Non-unit-clauses : 156
% 0.15/0.44 # Current number of unprocessed clauses: 231
% 0.15/0.44 # ...number of literals in the above : 910
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 97
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 5118
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 3284
% 0.15/0.44 # Non-unit clause-clause subsumptions : 129
% 0.15/0.44 # Unit Clause-clause subsumption calls : 55
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 7
% 0.15/0.44 # BW rewrite match successes : 5
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 10069
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.025 s
% 0.15/0.44 # System time : 0.002 s
% 0.15/0.44 # Total time : 0.027 s
% 0.15/0.44 # Maximum resident set size: 1800 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.026 s
% 0.15/0.44 # System time : 0.004 s
% 0.15/0.44 # Total time : 0.030 s
% 0.15/0.44 # Maximum resident set size: 1732 pages
% 0.15/0.44 % E---3.1 exiting
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------