TSTP Solution File: MGT064+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT064+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% 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:23:11 EDT 2022
% Result : Theorem 1.70s 2.02s
% Output : Refutation 1.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT064+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n018.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 08:44:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.03 ============================== Prover9 ===============================
% 0.44/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.03 Process 17413 was started by sandbox2 on n018.cluster.edu,
% 0.44/1.03 Thu Jun 9 08:44:08 2022
% 0.44/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17258_n018.cluster.edu".
% 0.44/1.03 ============================== end of head ===========================
% 0.44/1.03
% 0.44/1.03 ============================== INPUT =================================
% 0.44/1.03
% 0.44/1.03 % Reading from file /tmp/Prover9_17258_n018.cluster.edu
% 0.44/1.03
% 0.44/1.03 set(prolog_style_variables).
% 0.44/1.03 set(auto2).
% 0.44/1.03 % set(auto2) -> set(auto).
% 0.44/1.03 % set(auto) -> set(auto_inference).
% 0.44/1.03 % set(auto) -> set(auto_setup).
% 0.44/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.03 % set(auto) -> set(auto_limits).
% 0.44/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.03 % set(auto) -> set(auto_denials).
% 0.44/1.03 % set(auto) -> set(auto_process).
% 0.44/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.03 % set(auto2) -> assign(stats, some).
% 0.44/1.03 % set(auto2) -> clear(echo_input).
% 0.44/1.03 % set(auto2) -> set(quiet).
% 0.44/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.03 % set(auto2) -> clear(print_given).
% 0.44/1.03 assign(lrs_ticks,-1).
% 0.44/1.03 assign(sos_limit,10000).
% 0.44/1.03 assign(order,kbo).
% 0.44/1.03 set(lex_order_vars).
% 0.44/1.03 clear(print_given).
% 0.44/1.03
% 0.44/1.03 % formulas(sos). % not echoed (20 formulas)
% 0.44/1.03
% 0.44/1.03 ============================== end of input ==========================
% 0.44/1.03
% 0.44/1.03 % From the command line: assign(max_seconds, 300).
% 0.44/1.03
% 0.44/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.03
% 0.44/1.03 % Formulas that are not ordinary clauses:
% 0.44/1.03 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.44/1.03 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.44/1.03 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 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.44/1.03 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.44/1.03 7 (all X (has_endowment(X) <-> (all T (organization(X) & (smaller_or_equal(age(X,T),eta) -> has_immunity(X,T)) & (greater(age(X,T),eta) -> -has_immunity(X,T)))))) # label(definition_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 8 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 9 (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.44/1.03 10 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 11 (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.44/1.03 12 (all X (robust_position(X) <-> (all T ((smaller_or_equal(age(X,T),tau) -> -positional_advantage(X,T)) & (greater(age(X,T),tau) -> positional_advantage(X,T)))))) # label(definition_4) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.04 13 (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.44/1.04 14 -(all X all T0 all T1 all T2 all T3 (organization(X) & robust_position(X) & -has_endowment(X) & age(X,T0) = zero & greater(sigma,zero) & greater(tau,zero) & greater(sigma,tau) & smaller_or_equal(age(X,T1),tau) & greater(age(X,T2),tau) & smaller_or_equal(age(X,T2),sigma) & greater(age(X,T3),sigma) -> smaller(hazard_of_mortality(X,T2),hazard_of_mortality(X,T3)) & smaller(hazard_of_mortality(X,T3),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_10) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.04
% 0.44/1.04 ============================== end of process non-clausal formulas ===
% 0.44/1.04
% 0.44/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.04
% 0.44/1.04 ============================== PREDICATE ELIMINATION =================
% 0.44/1.04 15 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(8)].
% 0.44/1.04 16 organization(c1) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 0.44/1.04 17 -has_endowment(A) | organization(A) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/1.04 18 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(9)].
% 0.44/1.04 Derived: has_endowment(c1) | -has_immunity(c1,A). [resolve(15,a,16,a)].
% 0.44/1.04 Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D). [resolve(15,a,18,b)].
% 0.44/1.04 19 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(10)].
% 0.44/1.04 Derived: age(c1,A) != zero | is_aligned(c1,A). [resolve(19,a,16,a)].
% 0.44/1.04 Derived: age(A,B) != zero | is_aligned(A,B) | -has_endowment(A). [resolve(19,a,17,b)].
% 0.44/1.04 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(19,a,18,b)].
% 0.44/1.04 20 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17) # label(axiom). [clausify(13)].
% 0.44/1.04 Derived: -has_immunity(c1,A) | hazard_of_mortality(c1,A) = very_low. [resolve(20,a,16,a)].
% 0.44/1.04 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -has_endowment(A). [resolve(20,a,17,b)].
% 0.44/1.04 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D). [resolve(20,a,18,b)].
% 0.44/1.04 21 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(9)].
% 0.44/1.04 Derived: dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(21,b,16,a)].
% 0.44/1.04 Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -has_endowment(A). [resolve(21,b,17,b)].
% 0.44/1.04 Derived: dissimilar(A,B,C) | -is_aligned(A,B) | is_aligned(A,C) | -dissimilar(A,D,E). [resolve(21,b,18,b)].
% 0.44/1.04 22 dissimilar(A,B,C) | -organization(A) | is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(9)].
% 0.44/1.04 Derived: dissimilar(c1,A,B) | is_aligned(c1,A) | -is_aligned(c1,B). [resolve(22,b,16,a)].
% 0.44/1.04 Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -has_endowment(A). [resolve(22,b,17,b)].
% 0.44/1.04 Derived: dissimilar(A,B,C) | is_aligned(A,B) | -is_aligned(A,C) | -dissimilar(A,D,E). [resolve(22,b,18,b)].
% 0.44/1.04 23 has_endowment(A) | -organization(A) | smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/1.04 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)). [resolve(23,b,16,a)].
% 0.44/1.04 Derived: has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | has_immunity(A,f1(A)) | -dissimilar(A,B,C). [resolve(23,b,18,b)].
% 0.44/1.04 24 has_endowment(A) | -organization(A) | -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/1.04 25 has_endowment(A) | -organization(A) | smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) # label(definition_1) # label(axiom). [clausify(7)].
% 0.44/1.04 Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta). [resolve(25,b,16,a)].
% 0.44/1.04 Derived: has_endowment(A) | smaller_or_equal(age(A,f1(A)),eta) | greater(age(A,f1(A)),eta) | -dissimilar(A,B,C). [resolve(25,b,18,b)].
% 0.44/1.04 26 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(11)].
% 0.44/1.04 Derived: age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(26,a,16,a)].
% 0.44/1.04 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -has_endowment(A). [resolve(26,a,17,b)].
% 0.44/1.04 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(26,a,18,b)].
% 0.44/1.04 27 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(11)].
% 0.44/1.04 Derived: age(c1,A) != zero | greater(age(c1,B),sigma) | -dissimilar(c1,A,B). [resolve(27,a,16,a)].
% 0.44/1.04 Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -has_endowment(A). [resolve(27,a,17,b)].
% 0.44/1.04 Derived: age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(27,a,18,b)].
% 0.44/1.04 28 -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(13)].
% 0.44/1.04 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(28,a,16,a)].
% 0.44/1.04 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -has_endowment(A). [resolve(28,a,17,b)].
% 0.44/1.04 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D). [resolve(28,a,18,b)].
% 0.44/1.04 29 -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(13)].
% 0.44/1.04 Derived: has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(29,a,16,a)].
% 0.44/1.04 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -has_endowment(A). [resolve(29,a,17,b)].
% 0.44/1.04 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D). [resolve(29,a,18,b)].
% 0.44/1.04 30 -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(13)].
% 0.44/1.04 Derived: has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(30,a,16,a)].
% 0.44/1.04 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -has_endowment(A). [resolve(30,a,17,b)].
% 0.44/1.04 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D). [resolve(30,a,18,b)].
% 0.44/1.04 31 -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(13)].
% 0.44/1.04 Derived: has_immunity(c1,A) | is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = high. [resolve(31,a,16,a)].
% 0.44/1.04 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -has_endowment(A). [resolve(31,a,17,b)].
% 0.44/1.04 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D). [resolve(31,a,18,b)].
% 0.44/1.04 32 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(12)].
% 0.44/1.04 33 robust_position(c1) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.02 34 robust_position(A) | positional_advantage(A,f2(A)) | greater(age(A,f2(A)),tau) # label(definition_4) # label(axiom). [clausify(12)].
% 1.70/2.02 35 robust_position(A) | smaller_or_equal(age(A,f2(A)),tau) | greater(age(A,f2(A)),tau) # label(definition_4) # label(axiom). [clausify(12)].
% 1.70/2.02 Derived: -smaller_or_equal(age(c1,A),tau) | -positional_advantage(c1,A). [resolve(32,a,33,a)].
% 1.70/2.02 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | positional_advantage(A,f2(A)) | greater(age(A,f2(A)),tau). [resolve(32,a,34,a)].
% 1.70/2.02 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | smaller_or_equal(age(A,f2(A)),tau) | greater(age(A,f2(A)),tau). [resolve(32,a,35,a)].
% 1.70/2.02 36 -robust_position(A) | -greater(age(A,B),tau) | positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(12)].
% 1.70/2.02 Derived: -greater(age(c1,A),tau) | positional_advantage(c1,A). [resolve(36,a,33,a)].
% 1.70/2.02 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | positional_advantage(A,f2(A)) | greater(age(A,f2(A)),tau). [resolve(36,a,34,a)].
% 1.70/2.02 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | smaller_or_equal(age(A,f2(A)),tau) | greater(age(A,f2(A)),tau). [resolve(36,a,35,a)].
% 1.70/2.02 37 robust_position(A) | smaller_or_equal(age(A,f2(A)),tau) | -positional_advantage(A,f2(A)) # label(definition_4) # label(axiom). [clausify(12)].
% 1.70/2.02 Derived: smaller_or_equal(age(A,f2(A)),tau) | -positional_advantage(A,f2(A)) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B). [resolve(37,a,32,a)].
% 1.70/2.02 Derived: smaller_or_equal(age(A,f2(A)),tau) | -positional_advantage(A,f2(A)) | -greater(age(A,B),tau) | positional_advantage(A,B). [resolve(37,a,36,a)].
% 1.70/2.02 38 -greater_or_equal(A,B) | greater(A,B) | B = A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 1.70/2.02 39 greater_or_equal(A,B) | -greater(A,B) # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 1.70/2.02 40 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 1.70/2.02
% 1.70/2.02 ============================== end predicate elimination =============
% 1.70/2.02
% 1.70/2.02 Auto_denials: (non-Horn, no changes).
% 1.70/2.02
% 1.70/2.02 Term ordering decisions:
% 1.70/2.02 Function symbol KB weights: tau=1. zero=1. sigma=1. eta=1. low=1. mod1=1. mod2=1. high=1. very_low=1. c1=1. c2=1. c3=1. c4=1. c5=1. age=1. hazard_of_mortality=1. f1=1. f2=1.
% 1.70/2.02
% 1.70/2.02 ============================== end of process initial clauses ========
% 1.70/2.02
% 1.70/2.02 ============================== CLAUSES FOR SEARCH ====================
% 1.70/2.02
% 1.70/2.02 ============================== end of clauses for search =============
% 1.70/2.02
% 1.70/2.02 ============================== SEARCH ================================
% 1.70/2.02
% 1.70/2.02 % Starting search at 0.02 seconds.
% 1.70/2.02
% 1.70/2.02 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 92 (0.00 of 0.25 sec).
% 1.70/2.02
% 1.70/2.02 Low Water (keep): wt=15.000, iters=3371
% 1.70/2.02
% 1.70/2.02 ============================== PROOF =================================
% 1.70/2.02 % SZS status Theorem
% 1.70/2.02 % SZS output start Refutation
% 1.70/2.02
% 1.70/2.02 % Proof 1 at 0.97 (+ 0.03) seconds.
% 1.70/2.02 % Length of proof is 106.
% 1.70/2.02 % Level of proof is 14.
% 1.70/2.02 % Maximum clause weight is 21.000.
% 1.70/2.02 % Given clauses 1543.
% 1.70/2.02
% 1.70/2.02 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].
% 1.70/2.02 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 1.70/2.02 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 1.70/2.02 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].
% 1.70/2.02 6 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause). [assumption].
% 1.70/2.02 8 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 1.70/2.02 9 (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].
% 1.70/2.03 10 (all X all T (organization(X) & age(X,T) = zero -> is_aligned(X,T))) # label(assumption_13) # label(axiom) # label(non_clause). [assumption].
% 1.70/2.03 11 (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].
% 1.70/2.03 12 (all X (robust_position(X) <-> (all T ((smaller_or_equal(age(X,T),tau) -> -positional_advantage(X,T)) & (greater(age(X,T),tau) -> positional_advantage(X,T)))))) # label(definition_4) # label(axiom) # label(non_clause). [assumption].
% 1.70/2.03 13 (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].
% 1.70/2.03 14 -(all X all T0 all T1 all T2 all T3 (organization(X) & robust_position(X) & -has_endowment(X) & age(X,T0) = zero & greater(sigma,zero) & greater(tau,zero) & greater(sigma,tau) & smaller_or_equal(age(X,T1),tau) & greater(age(X,T2),tau) & smaller_or_equal(age(X,T2),sigma) & greater(age(X,T3),sigma) -> smaller(hazard_of_mortality(X,T2),hazard_of_mortality(X,T3)) & smaller(hazard_of_mortality(X,T3),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_10) # label(negated_conjecture) # label(non_clause). [assumption].
% 1.70/2.03 15 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(8)].
% 1.70/2.03 16 organization(c1) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 18 -dissimilar(A,B,C) | organization(A) # label(definition_2) # label(axiom). [clausify(9)].
% 1.70/2.03 19 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13) # label(axiom). [clausify(10)].
% 1.70/2.03 21 dissimilar(A,B,C) | -organization(A) | -is_aligned(A,B) | is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(9)].
% 1.70/2.03 26 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(11)].
% 1.70/2.03 27 -organization(A) | age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) # label(assumption_15) # label(axiom). [clausify(11)].
% 1.70/2.03 28 -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(13)].
% 1.70/2.03 29 -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(13)].
% 1.70/2.03 30 -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(13)].
% 1.70/2.03 32 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(12)].
% 1.70/2.03 33 robust_position(c1) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 36 -robust_position(A) | -greater(age(A,B),tau) | positional_advantage(A,B) # label(definition_4) # label(axiom). [clausify(12)].
% 1.70/2.03 42 greater(mod1,low) # label(assumption_18b) # label(axiom). [assumption].
% 1.70/2.03 46 greater(mod2,mod1) # label(assumption_19) # label(axiom). [assumption].
% 1.70/2.03 48 greater(tau,zero) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 49 greater(sigma,tau) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 50 age(c1,c2) = zero # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 51 smaller_or_equal(age(c1,c3),tau) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 52 greater(age(c1,c4),tau) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 53 smaller_or_equal(age(c1,c4),sigma) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 54 greater(age(c1,c5),sigma) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 55 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 1.70/2.03 56 -has_endowment(c1) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 57 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict) # label(axiom). [clausify(4)].
% 1.70/2.03 59 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2) # label(axiom). [clausify(9)].
% 1.70/2.03 60 -smaller(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c5)) | -smaller(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) # label(theorem_10) # label(negated_conjecture). [clausify(14)].
% 1.70/2.03 61 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 1.70/2.03 63 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 1.70/2.03 64 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 1.70/2.03 65 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 1.70/2.03 66 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom). [clausify(5)].
% 1.70/2.03 69 has_endowment(c1) | -has_immunity(c1,A). [resolve(15,a,16,a)].
% 1.70/2.03 70 -has_immunity(c1,A). [copy(69),unit_del(a,56)].
% 1.70/2.03 72 age(c1,A) != zero | is_aligned(c1,A). [resolve(19,a,16,a)].
% 1.70/2.03 77 dissimilar(c1,A,B) | -is_aligned(c1,A) | is_aligned(c1,B). [resolve(21,b,16,a)].
% 1.70/2.03 88 age(c1,A) != zero | -greater(age(c1,B),sigma) | dissimilar(c1,A,B). [resolve(26,a,16,a)].
% 1.70/2.03 93 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(27,a,18,b)].
% 1.70/2.03 94 has_immunity(c1,A) | -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [resolve(28,a,16,a)].
% 1.70/2.03 95 -is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = low. [copy(94),unit_del(a,70)].
% 1.70/2.03 98 has_immunity(c1,A) | is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [resolve(29,a,16,a)].
% 1.70/2.03 99 is_aligned(c1,A) | -positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod1. [copy(98),unit_del(a,70)].
% 1.70/2.03 102 has_immunity(c1,A) | -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [resolve(30,a,16,a)].
% 1.70/2.03 103 -is_aligned(c1,A) | positional_advantage(c1,A) | hazard_of_mortality(c1,A) = mod2. [copy(102),unit_del(a,70)].
% 1.70/2.03 110 -smaller_or_equal(age(c1,A),tau) | -positional_advantage(c1,A). [resolve(32,a,33,a)].
% 1.70/2.03 113 -greater(age(c1,A),tau) | positional_advantage(c1,A). [resolve(36,a,33,a)].
% 1.70/2.03 118 -greater(A,A). [factor(57,a,b)].
% 1.70/2.03 121 age(A,B) != zero | greater(age(A,C),sigma) | -dissimilar(A,B,C). [factor(93,c,d)].
% 1.70/2.03 137 greater(A,B) | A = B | greater(B,A). [resolve(63,a,55,a)].
% 1.70/2.03 141 smaller(zero,tau). [resolve(64,b,48,a)].
% 1.70/2.03 143 smaller(mod1,mod2). [resolve(64,b,46,a)].
% 1.70/2.03 147 smaller(low,mod1). [resolve(64,b,42,a)].
% 1.70/2.03 149 smaller(age(c1,c4),sigma) | age(c1,c4) = sigma. [resolve(65,a,53,a),flip(b)].
% 1.70/2.03 151 -greater(sigma,A) | greater(age(c1,c5),A). [resolve(66,a,54,a)].
% 1.70/2.03 171 -greater(A,mod1) | greater(A,low). [resolve(66,b,42,a)].
% 1.70/2.03 173 is_aligned(c1,c2). [resolve(72,a,50,a)].
% 1.70/2.03 175 age(c1,A) != zero | dissimilar(c1,A,c5). [resolve(88,b,54,a)].
% 1.70/2.03 177 -positional_advantage(c1,c3). [resolve(110,a,51,a)].
% 1.70/2.03 178 -smaller_or_equal(zero,tau) | -positional_advantage(c1,c2). [para(50(a,1),110(a,1))].
% 1.70/2.03 179 positional_advantage(c1,c4). [resolve(113,a,52,a)].
% 1.70/2.03 180 -smaller(A,A). [ur(63,b,118,a)].
% 1.70/2.03 190 smaller_or_equal(zero,tau). [resolve(141,a,61,b)].
% 1.70/2.03 191 -positional_advantage(c1,c2). [back_unit_del(178),unit_del(a,190)].
% 1.70/2.03 207 -greater(age(c1,c3),tau). [ur(113,b,177,a)].
% 1.70/2.03 210 hazard_of_mortality(c1,c2) = mod2. [resolve(173,a,103,a),unit_del(a,191)].
% 1.70/2.03 212 dissimilar(c1,c2,A) | is_aligned(c1,A). [resolve(173,a,77,b)].
% 1.70/2.03 215 -smaller(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c5)) | -smaller(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != mod2. [back_rewrite(60),rewrite([210(20)])].
% 1.70/2.03 217 -is_aligned(c1,c4) | hazard_of_mortality(c1,c4) = low. [resolve(179,a,95,b)].
% 1.70/2.03 246 age(c1,c4) = sigma | greater(sigma,age(c1,c4)). [resolve(149,a,63,a)].
% 1.70/2.03 263 greater(age(c1,c5),tau). [resolve(151,a,49,a)].
% 1.70/2.03 268 -greater(age(c1,c3),sigma). [ur(66,b,49,a,c,207,a)].
% 1.70/2.03 273 positional_advantage(c1,c5). [resolve(263,a,113,a)].
% 1.70/2.03 278 is_aligned(c1,c5) | hazard_of_mortality(c1,c5) = mod1. [resolve(273,a,99,b)].
% 1.70/2.03 287 -dissimilar(c1,c2,c3). [ur(121,a,50,a,b,268,a)].
% 1.70/2.03 327 greater(A,low) | greater(mod1,A) | mod1 = A. [resolve(171,a,137,c)].
% 1.70/2.03 338 dissimilar(c1,c2,c5). [resolve(175,a,50,a)].
% 1.70/2.03 339 -is_aligned(c1,c5). [resolve(338,a,59,a),unit_del(a,173)].
% 1.70/2.03 340 hazard_of_mortality(c1,c5) = mod1. [back_unit_del(278),unit_del(a,339)].
% 1.70/2.03 341 -smaller(hazard_of_mortality(c1,c4),mod1) | -smaller(mod1,hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != mod2. [back_rewrite(215),rewrite([340(6),340(8)])].
% 1.70/2.03 350 is_aligned(c1,c3). [resolve(212,a,287,a)].
% 1.70/2.03 351 is_aligned(c1,A) | greater(age(c1,A),sigma). [resolve(212,a,121,c),rewrite([50(5)]),xx(b)].
% 1.70/2.03 352 hazard_of_mortality(c1,c3) = mod2. [resolve(350,a,103,a),unit_del(a,177)].
% 1.70/2.03 358 -smaller(hazard_of_mortality(c1,c4),mod1). [back_rewrite(341),rewrite([352(9),352(11)]),xx(c),unit_del(b,143)].
% 1.70/2.03 362 -greater(mod1,hazard_of_mortality(c1,c4)). [ur(64,a,358,a)].
% 1.70/2.03 379 greater(age(c1,c4),sigma) | hazard_of_mortality(c1,c4) = low. [resolve(351,a,217,a)].
% 1.70/2.03 735 greater(hazard_of_mortality(c1,c4),low) | hazard_of_mortality(c1,c4) = mod1. [resolve(327,b,362,a),flip(b)].
% 1.70/2.03 1214 age(c1,c4) = sigma | -greater(age(c1,c4),sigma). [resolve(246,b,57,b)].
% 1.70/2.03 2028 hazard_of_mortality(c1,c4) = low | smaller(sigma,age(c1,c4)). [resolve(379,a,64,b)].
% 1.70/2.03 5723 hazard_of_mortality(c1,c4) = mod1 | smaller(low,hazard_of_mortality(c1,c4)). [resolve(735,a,64,b)].
% 1.70/2.03 5996 age(c1,c4) = sigma | hazard_of_mortality(c1,c4) = low. [resolve(1214,b,379,a)].
% 1.70/2.03 6037 age(c1,c4) = sigma. [para(5996(b,1),358(a,1)),unit_del(b,147)].
% 1.70/2.03 6334 hazard_of_mortality(c1,c4) = low. [back_rewrite(2028),rewrite([6037(9)]),unit_del(b,180)].
% 1.70/2.03 6339 mod1 = low. [back_rewrite(5723),rewrite([6334(3),6334(7)]),flip(a),unit_del(b,180)].
% 1.70/2.03 6614 $F. [back_rewrite(147),rewrite([6339(2)]),unit_del(a,180)].
% 1.70/2.03
% 1.70/2.03 % SZS output end Refutation
% 1.70/2.03 ============================== end of proof ==========================
% 1.70/2.03
% 1.70/2.03 ============================== STATISTICS ============================
% 1.70/2.03
% 1.70/2.03 Given=1543. Generated=34222. Kept=6566. proofs=1.
% 1.70/2.03 Usable=884. Sos=2055. Demods=7. Limbo=275, Disabled=3450. Hints=0.
% 1.70/2.03 Megabytes=6.41.
% 1.70/2.03 User_CPU=0.97, System_CPU=0.03, Wall_clock=1.
% 1.70/2.03
% 1.70/2.03 ============================== end of statistics =====================
% 1.70/2.03
% 1.70/2.03 ============================== end of search =========================
% 1.70/2.03
% 1.70/2.03 THEOREM PROVED
% 1.70/2.03 % SZS status Theorem
% 1.70/2.03
% 1.70/2.03 Exiting with 1 proof.
% 1.70/2.03
% 1.70/2.03 Process 17413 exit (max_proofs) Thu Jun 9 08:44:09 2022
% 1.70/2.03 Prover9 interrupted
%------------------------------------------------------------------------------