TSTP Solution File: MGT061+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT061+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:23:11 EDT 2022
% Result : Theorem 0.48s 0.77s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : MGT061+1 : TPTP v8.1.0. Released v2.4.0.
% 0.05/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Thu Jun 9 11:46:52 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.45/0.76 ============================== Prover9 ===============================
% 0.45/0.76 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.76 Process 22741 was started by sandbox2 on n032.cluster.edu,
% 0.45/0.76 Thu Jun 9 11:46:53 2022
% 0.45/0.76 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22588_n032.cluster.edu".
% 0.45/0.76 ============================== end of head ===========================
% 0.45/0.76
% 0.45/0.76 ============================== INPUT =================================
% 0.45/0.76
% 0.45/0.76 % Reading from file /tmp/Prover9_22588_n032.cluster.edu
% 0.45/0.76
% 0.45/0.76 set(prolog_style_variables).
% 0.45/0.76 set(auto2).
% 0.45/0.76 % set(auto2) -> set(auto).
% 0.45/0.76 % set(auto) -> set(auto_inference).
% 0.45/0.76 % set(auto) -> set(auto_setup).
% 0.45/0.76 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.76 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.76 % set(auto) -> set(auto_limits).
% 0.45/0.76 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.76 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.76 % set(auto) -> set(auto_denials).
% 0.45/0.76 % set(auto) -> set(auto_process).
% 0.45/0.76 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.76 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.76 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.76 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.76 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.76 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.76 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.76 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.76 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.76 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.76 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.76 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.76 % set(auto2) -> assign(stats, some).
% 0.45/0.76 % set(auto2) -> clear(echo_input).
% 0.45/0.76 % set(auto2) -> set(quiet).
% 0.45/0.76 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.76 % set(auto2) -> clear(print_given).
% 0.45/0.76 assign(lrs_ticks,-1).
% 0.45/0.76 assign(sos_limit,10000).
% 0.45/0.76 assign(order,kbo).
% 0.45/0.76 set(lex_order_vars).
% 0.45/0.76 clear(print_given).
% 0.45/0.76
% 0.45/0.76 % formulas(sos). % not echoed (18 formulas)
% 0.45/0.76
% 0.45/0.76 ============================== end of input ==========================
% 0.45/0.76
% 0.45/0.76 % From the command line: assign(max_seconds, 300).
% 0.45/0.76
% 0.45/0.76 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.76
% 0.45/0.76 % Formulas that are not ordinary clauses:
% 0.45/0.76 1 (all X all Y (smaller_or_equal(X,Y) <-> smaller(X,Y) | X = Y)) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 2 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(definition_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 5 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 6 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 7 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 8 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 9 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 10 (all X all T0 all T (organization(X) & age(X,T0) = zero -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 11 (all X (fragile_position(X) <-> (all T ((smaller_or_equal(age(X,T),sigma) -> positional_advantage(X,T)) & (greater(age(X,T),sigma) -> -positional_advantage(X,T)))))) # label(definition_3) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 12 (all X all T (organization(X) -> (has_immunity(X,T) -> hazard_of_mortality(X,T) = very_low) & (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1) & (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = high)))) # label(assumption_17) # label(axiom) # label(non_clause). [assumption].
% 0.45/0.76 13 -(all X all T0 all T1 all T2 (organization(X) & fragile_position(X) & -has_endowment(X) & age(X,T0) = zero & greater(sigma,zero) & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T2),sigma) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_7) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.45/0.76
% 0.45/0.76 ============================== end of process non-clausal formulas ===
% 0.45/0.76
% 0.45/0.76 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.76
% 0.45/0.76 ============================== PREDICATE ELIMINATION =================
% 0.45/0.76 14 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(7)].
% 0.45/0.76 15 organization(c1) # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.45/0.76 16 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(8)].
% 0.45/0.76 Derived: has_endowment(c1) | -has_immunity(c1,A). [resolve(14,a,15,a)].
% 0.45/0.76 Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D). [resolve(14,a,16,b)].
% 0.45/0.76 17 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(9)].
% 0.45/0.76 Derived: age(c1,A) != zero | is_aligned(c1,A). [resolve(17,a,15,a)].
% 0.45/0.76 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(17,a,16,b)].
% 0.45/0.76 18 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom). [clausify(12)].
% 0.45/0.76 Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low. [resolve(18,a,15,a)].
% 0.45/0.76 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D). [resolve(18,a,16,b)].
% 0.45/0.76 19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(8)].
% 0.45/0.76 Derived: dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(19,b,15,a)].
% 0.45/0.76 Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -dissimilar(A,D,E). [resolve(19,b,16,b)].
% 0.45/0.76 20 dissimilar(A,B,C) | -organization(A) | is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(8)].
% 0.45/0.76 Derived: dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B). [resolve(20,b,15,a)].
% 0.45/0.76 Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,D,E). [resolve(20,b,16,b)].
% 0.45/0.76 21 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(10)].
% 0.45/0.76 Derived: age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(21,a,15,a)].
% 0.45/0.76 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(21,a,16,b)].
% 0.45/0.76 22 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(10)].
% 0.45/0.76 Derived: age(c1,A) != zero | greater(age(c1,B),sigma) | -dissimilar(c1,A,B). [resolve(22,a,15,a)].
% 0.45/0.76 Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(22,a,16,b)].
% 0.45/0.76 23 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom). [clausify(12)].
% 0.45/0.76 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(23,a,15,a)].
% 0.45/0.76 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D). [resolve(23,a,16,b)].
% 0.45/0.76 24 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17) # label(axiom). [clausify(12)].
% 0.45/0.76 Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(24,a,15,a)].
% 0.45/0.76 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D). [resolve(24,a,16,b)].
% 0.45/0.76 25 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17) # label(axiom). [clausify(12)].
% 0.45/0.76 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(25,a,15,a)].
% 0.45/0.76 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D). [resolve(25,a,16,b)].
% 0.45/0.76 26 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17) # label(axiom). [clausify(12)].
% 0.45/0.76 Derived: has_immunity(c1,A) | is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high. [resolve(26,a,15,a)].
% 0.45/0.76 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D). [resolve(26,a,16,b)].
% 0.45/0.76 27 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3) # label(axiom). [clausify(11)].
% 0.45/0.76 28 fragile_position(c1) # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.45/0.76 29 fragile_position(A) | smaller_or_equal(age(A,f1(A)),sigma) | positional_advantage(A,f1(A)) # label(definition_3) # label(axiom). [clausify(11)].
% 0.45/0.76 30 fragile_position(A) | smaller_or_equal(age(A,f1(A)),sigma) | greater(age(A,f1(A)),sigma) # label(definition_3) # label(axiom). [clausify(11)].
% 0.45/0.76 Derived: -greater(age(c1,A),sigma) | -positional_advantage(c1,A). [resolve(27,a,28,a)].
% 0.45/0.76 Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),sigma) | positional_advantage(A,f1(A)). [resolve(27,a,29,a)].
% 0.45/0.76 Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),sigma) | greater(age(A,f1(A)),sigma). [resolve(27,a,30,a)].
% 0.45/0.76 31 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3) # label(axiom). [clausify(11)].
% 0.45/0.76 Derived: -smaller_or_equal(age(c1,A),sigma) | positional_advantage(c1,A). [resolve(31,a,28,a)].
% 0.45/0.76 Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),sigma) | positional_advantage(A,f1(A)). [resolve(31,a,29,a)].
% 0.45/0.76 Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | smaller_or_equal(age(A,f1(A)),sigma) | greater(age(A,f1(A)),sigma). [resolve(31,a,30,a)].
% 0.45/0.76 32 fragile_position(A) | -positional_advantage(A,f1(A)) | greater(age(A,f1(A)),sigma) # label(definition_3) # label(axiom). [clausify(11)].
% 0.45/0.76 Derived: -positional_advantage(A,f1(A)) | greater(age(A,f1(A)),sigma) | -greater(age(A,B),sigma) | -positional_advantage(A,B). [resolve(32,a,27,a)].
% 0.45/0.76 Derived: -positional_advantage(A,f1(A)) | greater(age(A,f1(A)),sigma) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B). [resolve(32,a,31,a)].
% 0.45/0.76 33 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.45/0.76 34 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.45/0.76 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(33,b,34,a)].
% 0.45/0.76 35 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.45/0.76 Derived: greater(A,B) | A = B | greater(B,A). [resolve(35,a,34,a)].
% 0.45/0.76 36 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.45/0.76 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(36,a,33,b)].
% 0.45/0.76 37 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.45/0.76 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(37,b,35,a)].
% 0.45/0.76 38 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.45/0.76 39 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.48/0.77 40 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.48/0.77
% 0.48/0.77 ============================== end predicate elimination =============
% 0.48/0.77
% 0.48/0.77 Auto_denials: (non-Horn, no changes).
% 0.48/0.77
% 0.48/0.77 Term ordering decisions:
% 0.48/0.77
% 0.48/0.77 % Assigning unary symbol f1 kb_weight 0 and highest precedence (22).
% 0.48/0.77 Function symbol KB weights: sigma=1. zero=1. low=1. high=1. mod1=1. mod2=1. very_low=1. c1=1. c2=1. c3=1. c4=1. age=1. hazard_of_mortality=1. f1=0.
% 0.48/0.77
% 0.48/0.77 ============================== end of process initial clauses ========
% 0.48/0.77
% 0.48/0.77 ============================== CLAUSES FOR SEARCH ====================
% 0.48/0.77
% 0.48/0.77 ============================== end of clauses for search =============
% 0.48/0.77
% 0.48/0.77 ============================== SEARCH ================================
% 0.48/0.77
% 0.48/0.77 % Starting search at 0.02 seconds.
% 0.48/0.77
% 0.48/0.77 ============================== PROOF =================================
% 0.48/0.77 % SZS status Theorem
% 0.48/0.77 % SZS output start Refutation
% 0.48/0.77
% 0.48/0.77 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.48/0.77 % Length of proof is 82.
% 0.48/0.77 % Level of proof is 9.
% 0.48/0.77 % Maximum clause weight is 21.000.
% 0.48/0.77 % Given clauses 127.
% 0.48/0.77
% 0.48/0.77 1 (all X all Y (smaller_or_equal(X,Y) <-> smaller(X,Y) | X = Y)) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 5 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 6 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 7 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 8 (all X all T0 all T (dissimilar(X,T0,T) <-> organization(X) & -(is_aligned(X,T0) <-> is_aligned(X,T)))) # label(definition_2) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 9 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 10 (all X all T0 all T (organization(X) & age(X,T0) = zero -> (greater(age(X,T),sigma) <-> dissimilar(X,T0,T)))) # label(assumption_15) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 11 (all X (fragile_position(X) <-> (all T ((smaller_or_equal(age(X,T),sigma) -> positional_advantage(X,T)) & (greater(age(X,T),sigma) -> -positional_advantage(X,T)))))) # label(definition_3) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 12 (all X all T (organization(X) -> (has_immunity(X,T) -> hazard_of_mortality(X,T) = very_low) & (-has_immunity(X,T) -> (is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = low) & (-is_aligned(X,T) & positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod1) & (is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = mod2) & (-is_aligned(X,T) & -positional_advantage(X,T) -> hazard_of_mortality(X,T) = high)))) # label(assumption_17) # label(axiom) # label(non_clause). [assumption].
% 0.48/0.77 13 -(all X all T0 all T1 all T2 (organization(X) & fragile_position(X) & -has_endowment(X) & age(X,T0) = zero & greater(sigma,zero) & smaller_or_equal(age(X,T1),sigma) & greater(age(X,T2),sigma) -> greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_7) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.48/0.77 14 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(7)].
% 0.48/0.77 15 organization(c1) # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.48/0.77 16 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(8)].
% 0.48/0.77 17 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(9)].
% 0.48/0.77 19 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(8)].
% 0.48/0.77 21 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(10)].
% 0.48/0.77 22 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(10)].
% 0.48/0.77 23 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17) # label(axiom). [clausify(12)].
% 0.48/0.77 26 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17) # label(axiom). [clausify(12)].
% 0.48/0.77 27 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3) # label(axiom). [clausify(11)].
% 0.48/0.77 28 fragile_position(c1) # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.48/0.77 31 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3) # label(axiom). [clausify(11)].
% 0.48/0.77 33 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.48/0.77 34 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.48/0.77 35 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.48/0.77 36 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.48/0.77 44 greater(high,mod2) # label(assumption_18d) # label(axiom). [assumption].
% 0.48/0.77 45 greater(mod2,low) # label(assumption_18e) # label(axiom). [assumption].
% 0.48/0.77 46 greater(sigma,zero) # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.48/0.77 47 age(c1,c2) = zero # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.48/0.77 48 smaller_or_equal(age(c1,c3),sigma) # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.48/0.77 49 greater(age(c1,c4),sigma) # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.48/0.77 50 -has_endowment(c1) # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.48/0.77 51 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom). [clausify(4)].
% 0.48/0.77 52 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(8)].
% 0.48/0.77 53 -greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) # label(theorem_7) # label(negated_conjecture). [clausify(13)].
% 0.48/0.77 55 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom). [clausify(5)].
% 0.48/0.77 57 has_endowment(c1) | -has_immunity(c1,A). [resolve(14,a,15,a)].
% 0.48/0.77 58 -has_immunity(c1,A). [copy(57),unit_del(a,50)].
% 0.48/0.77 60 age(c1,A) != zero | is_aligned(c1,A). [resolve(17,a,15,a)].
% 0.48/0.77 63 dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(19,b,15,a)].
% 0.48/0.77 67 age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(21,a,15,a)].
% 0.48/0.77 70 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(22,a,16,b)].
% 0.48/0.77 71 has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(23,a,15,a)].
% 0.48/0.77 72 -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [copy(71),unit_del(a,58)].
% 0.48/0.77 80 has_immunity(c1,A) | is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high. [resolve(26,a,15,a)].
% 0.48/0.77 81 is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high. [copy(80),unit_del(a,58)].
% 0.48/0.77 83 -greater(age(c1,A),sigma) | -positional_advantage(c1,A). [resolve(27,a,28,a)].
% 0.48/0.77 86 -smaller_or_equal(age(c1,A),sigma) | positional_advantage(c1,A). [resolve(31,a,28,a)].
% 0.48/0.77 92 greater(A,B) | A = B | greater(B,A). [resolve(35,a,34,a)].
% 0.48/0.77 93 -greater(A,B) | smaller_or_equal(B,A). [resolve(36,a,33,b)].
% 0.48/0.77 95 -greater(A,A). [factor(51,a,b)].
% 0.48/0.77 98 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C). [factor(70,c,d)].
% 0.48/0.78 101 -greater(low,mod2). [resolve(51,a,45,a)].
% 0.48/0.78 111 -greater(mod2,A) | greater(high,A). [resolve(55,a,44,a)].
% 0.48/0.78 122 is_aligned(c1,c2). [resolve(60,a,47,a)].
% 0.48/0.78 123 age(c1,A) != zero | dissimilar(c1,A,c4). [resolve(67,b,49,a)].
% 0.48/0.78 126 -positional_advantage(c1,c4). [ur(83,a,49,a)].
% 0.48/0.78 127 positional_advantage(c1,c3). [resolve(86,a,48,a)].
% 0.48/0.78 128 -smaller_or_equal(zero,sigma) | positional_advantage(c1,c2). [para(47(a,1),86(a,1))].
% 0.48/0.78 137 hazard_of_mortality(c1,c4) = hazard_of_mortality(c1,c3) | greater(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c4)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2). [resolve(92,a,53,a)].
% 0.48/0.78 142 smaller_or_equal(zero,sigma). [resolve(93,a,46,a)].
% 0.48/0.78 148 positional_advantage(c1,c2). [back_unit_del(128),unit_del(a,142)].
% 0.48/0.78 151 -greater(low,high). [ur(55,b,44,a,c,101,a)].
% 0.48/0.78 155 dissimilar(c1,c2,A) | is_aligned(c1,A). [resolve(122,a,63,b)].
% 0.48/0.78 160 -greater(age(c1,c3),sigma). [resolve(127,a,83,b)].
% 0.48/0.78 162 -is_aligned(c1,c3) | hazard_of_mortality(c1,c3) = low. [resolve(127,a,72,b)].
% 0.48/0.78 163 is_aligned(c1,c4) | hazard_of_mortality(c1,c4) = high. [resolve(126,a,81,b)].
% 0.48/0.78 172 hazard_of_mortality(c1,c2) = low. [resolve(148,a,72,b),unit_del(a,122)].
% 0.48/0.78 173 hazard_of_mortality(c1,c4) = hazard_of_mortality(c1,c3) | greater(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c4)) | hazard_of_mortality(c1,c3) != low. [back_rewrite(137),rewrite([172(20)])].
% 0.48/0.78 179 -dissimilar(c1,c2,c3). [ur(98,a,47,a,b,160,a)].
% 0.48/0.78 189 greater(high,low). [resolve(111,a,45,a)].
% 0.48/0.78 213 dissimilar(c1,c2,c4). [resolve(123,a,47,a)].
% 0.48/0.78 214 -is_aligned(c1,c4). [resolve(213,a,52,a),unit_del(a,122)].
% 0.48/0.78 215 hazard_of_mortality(c1,c4) = high. [back_unit_del(163),unit_del(a,214)].
% 0.48/0.78 217 hazard_of_mortality(c1,c3) = high | greater(hazard_of_mortality(c1,c3),high) | hazard_of_mortality(c1,c3) != low. [back_rewrite(173),rewrite([215(3),215(11)]),flip(a)].
% 0.48/0.78 231 is_aligned(c1,c3). [resolve(155,a,179,a)].
% 0.48/0.78 233 hazard_of_mortality(c1,c3) = low. [back_unit_del(162),unit_del(a,231)].
% 0.48/0.78 234 high = low. [back_rewrite(217),rewrite([233(3),233(6),233(9)]),flip(a),xx(c),unit_del(b,151)].
% 0.48/0.78 243 $F. [back_rewrite(189),rewrite([234(1)]),unit_del(a,95)].
% 0.48/0.78
% 0.48/0.78 % SZS output end Refutation
% 0.48/0.78 ============================== end of proof ==========================
% 0.48/0.78
% 0.48/0.78 ============================== STATISTICS ============================
% 0.48/0.78
% 0.48/0.78 Given=127. Generated=519. Kept=197. proofs=1.
% 0.48/0.78 Usable=116. Sos=32. Demods=5. Limbo=9, Disabled=117. Hints=0.
% 0.48/0.78 Megabytes=0.25.
% 0.48/0.78 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.48/0.78
% 0.48/0.78 ============================== end of statistics =====================
% 0.48/0.78
% 0.48/0.78 ============================== end of search =========================
% 0.48/0.78
% 0.48/0.78 THEOREM PROVED
% 0.48/0.78 % SZS status Theorem
% 0.48/0.78
% 0.48/0.78 Exiting with 1 proof.
% 0.48/0.78
% 0.48/0.78 Process 22741 exit (max_proofs) Thu Jun 9 11:46:53 2022
% 0.48/0.78 Prover9 interrupted
%------------------------------------------------------------------------------