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 : n027.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 : Unsatisfiable 1.66s 1.93s
% Output : Refutation 1.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : MGT064-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 12:34:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/0.98 ============================== Prover9 ===============================
% 0.71/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.98 Process 28276 was started by sandbox on n027.cluster.edu,
% 0.71/0.98 Thu Jun 9 12:34:58 2022
% 0.71/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28123_n027.cluster.edu".
% 0.71/0.98 ============================== end of head ===========================
% 0.71/0.98
% 0.71/0.98 ============================== INPUT =================================
% 0.71/0.98
% 0.71/0.98 % Reading from file /tmp/Prover9_28123_n027.cluster.edu
% 0.71/0.98
% 0.71/0.98 set(prolog_style_variables).
% 0.71/0.98 set(auto2).
% 0.71/0.98 % set(auto2) -> set(auto).
% 0.71/0.98 % set(auto) -> set(auto_inference).
% 0.71/0.98 % set(auto) -> set(auto_setup).
% 0.71/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.98 % set(auto) -> set(auto_limits).
% 0.71/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.98 % set(auto) -> set(auto_denials).
% 0.71/0.98 % set(auto) -> set(auto_process).
% 0.71/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.98 % set(auto2) -> assign(stats, some).
% 0.71/0.98 % set(auto2) -> clear(echo_input).
% 0.71/0.98 % set(auto2) -> set(quiet).
% 0.71/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.98 % set(auto2) -> clear(print_given).
% 0.71/0.98 assign(lrs_ticks,-1).
% 0.71/0.98 assign(sos_limit,10000).
% 0.71/0.98 assign(order,kbo).
% 0.71/0.98 set(lex_order_vars).
% 0.71/0.98 clear(print_given).
% 0.71/0.98
% 0.71/0.98 % formulas(sos). % not echoed (58 formulas)
% 0.71/0.98
% 0.71/0.98 ============================== end of input ==========================
% 0.71/0.98
% 0.71/0.98 % From the command line: assign(max_seconds, 300).
% 0.71/0.98
% 0.71/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.98
% 0.71/0.98 % Formulas that are not ordinary clauses:
% 0.71/0.98
% 0.71/0.98 ============================== end of process non-clausal formulas ===
% 0.71/0.98
% 0.71/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.98
% 0.71/0.98 ============================== PREDICATE ELIMINATION =================
% 0.71/0.98 1 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1_46) # label(axiom). [assumption].
% 0.71/0.98 2 organization(sk3) # label(theorem_10_74) # label(negated_conjecture). [assumption].
% 0.71/0.98 3 -has_endowment(A) | organization(A) # label(definition_1_39) # label(axiom). [assumption].
% 0.71/0.98 4 -dissimilar(A,B,C) | organization(A) # label(definition_2_47) # label(axiom). [assumption].
% 0.71/0.98 Derived: has_endowment(sk3) | -has_immunity(sk3,A). [resolve(1,a,2,a)].
% 0.71/0.98 Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D). [resolve(1,a,4,b)].
% 0.71/0.98 5 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13_54) # label(axiom). [assumption].
% 0.71/0.98 Derived: age(sk3,A) != zero | is_aligned(sk3,A). [resolve(5,a,2,a)].
% 0.71/0.98 Derived: age(A,B) != zero | is_aligned(A,B) | -has_endowment(A). [resolve(5,a,3,b)].
% 0.71/0.98 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(5,a,4,b)].
% 0.71/0.98 6 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17_63) # label(axiom). [assumption].
% 0.71/0.98 Derived: -has_immunity(sk3,A) | hazard_of_mortality(sk3,A) = very_low. [resolve(6,a,2,a)].
% 0.71/0.98 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -has_endowment(A). [resolve(6,a,3,b)].
% 0.71/0.98 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D). [resolve(6,a,4,b)].
% 0.71/0.98 7 -organization(A) | -has_immunity(A,sk1(A)) | has_immunity(A,sk1(A)) | has_endowment(A) # label(definition_1_45) # label(axiom). [assumption].
% 0.71/0.98 8 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,B,C) # label(definition_2_50) # label(axiom). [assumption].
% 0.71/0.98 9 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_51) # label(axiom). [assumption].
% 0.71/0.98 Derived: -is_aligned(sk3,A) | is_aligned(sk3,B) | dissimilar(sk3,A,B). [resolve(9,a,2,a)].
% 0.71/0.98 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -has_endowment(A). [resolve(9,a,3,b)].
% 0.71/0.98 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(9,a,4,b)].
% 0.71/0.98 10 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) # label(definition_2_52) # label(axiom). [assumption].
% 0.71/0.98 Derived: -is_aligned(sk3,A) | is_aligned(sk3,B) | dissimilar(sk3,B,A). [resolve(10,a,2,a)].
% 0.71/0.98 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -has_endowment(A). [resolve(10,a,3,b)].
% 0.71/0.98 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -dissimilar(A,D,E). [resolve(10,a,4,b)].
% 0.71/0.98 11 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,C,B) # label(definition_2_53) # label(axiom). [assumption].
% 0.71/0.98 12 -organization(A) | smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | has_endowment(A) # label(definition_1_43) # label(axiom). [assumption].
% 0.71/0.98 Derived: smaller_or_equal(age(sk3,sk1(sk3)),eta) | has_immunity(sk3,sk1(sk3)) | has_endowment(sk3). [resolve(12,a,2,a)].
% 0.71/0.98 Derived: smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | has_endowment(A) | -dissimilar(A,B,C). [resolve(12,a,4,b)].
% 0.71/0.98 13 -organization(A) | -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | has_endowment(A) # label(definition_1_44) # label(axiom). [assumption].
% 0.71/0.98 14 -organization(A) | smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | has_endowment(A) # label(definition_1_42) # label(axiom). [assumption].
% 0.71/0.98 Derived: smaller_or_equal(age(sk3,sk1(sk3)),eta) | greater(age(sk3,sk1(sk3)),eta) | has_endowment(sk3). [resolve(14,a,2,a)].
% 0.71/0.98 Derived: smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | has_endowment(A) | -dissimilar(A,B,C). [resolve(14,a,4,b)].
% 0.71/0.98 15 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15_55) # label(axiom). [assumption].
% 0.71/0.98 Derived: age(sk3,A) != zero | -greater(age(sk3,B),sigma) | dissimilar(sk3,A,B). [resolve(15,a,2,a)].
% 0.71/0.98 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -has_endowment(A). [resolve(15,a,3,b)].
% 0.71/0.98 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(15,a,4,b)].
% 0.71/0.98 16 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15_56) # label(axiom). [assumption].
% 0.71/0.98 Derived: age(sk3,A) != zero | -dissimilar(sk3,A,B) | greater(age(sk3,B),sigma). [resolve(16,a,2,a)].
% 0.71/0.98 Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -has_endowment(A). [resolve(16,a,3,b)].
% 0.71/0.98 Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E). [resolve(16,a,4,b)].
% 0.71/0.98 17 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17_64) # label(axiom). [assumption].
% 0.71/0.98 Derived: has_immunity(sk3,A) | -is_aligned(sk3,A) | -positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = low. [resolve(17,a,2,a)].
% 0.71/0.98 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -has_endowment(A). [resolve(17,a,3,b)].
% 0.71/0.98 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D). [resolve(17,a,4,b)].
% 0.71/0.98 18 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17_65) # label(axiom). [assumption].
% 0.71/0.98 Derived: has_immunity(sk3,A) | is_aligned(sk3,A) | -positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = mod1. [resolve(18,a,2,a)].
% 0.71/0.98 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -has_endowment(A). [resolve(18,a,3,b)].
% 0.71/0.98 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D). [resolve(18,a,4,b)].
% 0.71/0.98 19 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17_66) # label(axiom). [assumption].
% 0.71/0.99 Derived: has_immunity(sk3,A) | -is_aligned(sk3,A) | positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = mod2. [resolve(19,a,2,a)].
% 0.71/0.99 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -has_endowment(A). [resolve(19,a,3,b)].
% 0.71/0.99 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D). [resolve(19,a,4,b)].
% 0.71/0.99 20 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17_67) # label(axiom). [assumption].
% 0.71/0.99 Derived: has_immunity(sk3,A) | is_aligned(sk3,A) | positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = high. [resolve(20,a,2,a)].
% 0.71/0.99 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -has_endowment(A). [resolve(20,a,3,b)].
% 0.71/0.99 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D). [resolve(20,a,4,b)].
% 0.71/0.99 21 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4_57) # label(axiom). [assumption].
% 0.71/0.99 22 robust_position(sk3) # label(theorem_10_75) # label(negated_conjecture). [assumption].
% 0.71/0.99 23 positional_advantage(A,sk2(A)) | greater(age(A,sk2(A)),tau) | robust_position(A) # label(definition_4_61) # label(axiom). [assumption].
% 0.71/0.99 24 smaller_or_equal(age(A,sk2(A)),tau) | greater(age(A,sk2(A)),tau) | robust_position(A) # label(definition_4_59) # label(axiom). [assumption].
% 0.71/0.99 Derived: -smaller_or_equal(age(sk3,A),tau) | -positional_advantage(sk3,A). [resolve(21,a,22,a)].
% 0.71/0.99 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | positional_advantage(A,sk2(A)) | greater(age(A,sk2(A)),tau). [resolve(21,a,23,c)].
% 0.71/0.99 Derived: -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) | smaller_or_equal(age(A,sk2(A)),tau) | greater(age(A,sk2(A)),tau). [resolve(21,a,24,c)].
% 0.71/0.99 25 -robust_position(A) | -greater(age(A,B),tau) | positional_advantage(A,B) # label(definition_4_58) # label(axiom). [assumption].
% 0.71/0.99 Derived: -greater(age(sk3,A),tau) | positional_advantage(sk3,A). [resolve(25,a,22,a)].
% 0.71/0.99 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | positional_advantage(A,sk2(A)) | greater(age(A,sk2(A)),tau). [resolve(25,a,23,c)].
% 0.71/0.99 Derived: -greater(age(A,B),tau) | positional_advantage(A,B) | smaller_or_equal(age(A,sk2(A)),tau) | greater(age(A,sk2(A)),tau). [resolve(25,a,24,c)].
% 0.71/0.99 26 positional_advantage(A,sk2(A)) | -positional_advantage(A,sk2(A)) | robust_position(A) # label(definition_4_62) # label(axiom). [assumption].
% 0.71/0.99 27 smaller_or_equal(age(A,sk2(A)),tau) | -positional_advantage(A,sk2(A)) | robust_position(A) # label(definition_4_60) # label(axiom). [assumption].
% 0.71/0.99 Derived: smaller_or_equal(age(A,sk2(A)),tau) | -positional_advantage(A,sk2(A)) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B). [resolve(27,c,21,a)].
% 0.71/0.99 Derived: smaller_or_equal(age(A,sk2(A)),tau) | -positional_advantage(A,sk2(A)) | -greater(age(A,B),tau) | positional_advantage(A,B). [resolve(27,c,25,a)].
% 0.71/0.99 28 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.71/0.99 29 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.71/0.99 30 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.71/0.99
% 0.71/0.99 ============================== end predicate elimination =============
% 0.71/0.99
% 0.71/0.99 Auto_denials: (non-Horn, no changes).
% 0.71/0.99
% 0.71/0.99 Term ordering decisions:
% 0.71/0.99 Function symbol KB weights: sk3=1. tau=1. zero=1. sigma=1. eta=1. low=1. mod1=1. mod2=1. high=1. very_low=1. sk6=1. sk4=1. sk5=1. sk7=1. age=1. hazard_of_mortality=1. sk2=1. sk1=1.
% 0.71/0.99
% 0.71/0.99 ============================== end of process initial clauses ========
% 0.71/0.99
% 0.71/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.99
% 0.71/0.99 ============================== end of clauses for search =============
% 1.66/1.93
% 1.66/1.93 ============================== SEARCH ================================
% 1.66/1.93
% 1.66/1.93 % Starting search at 0.02 seconds.
% 1.66/1.93
% 1.66/1.93 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 100 (0.00 of 0.24 sec).
% 1.66/1.93
% 1.66/1.93 Low Water (keep): wt=15.000, iters=3371
% 1.66/1.93
% 1.66/1.93 ============================== PROOF =================================
% 1.66/1.93 % SZS status Unsatisfiable
% 1.66/1.93 % SZS output start Refutation
% 1.66/1.93
% 1.66/1.93 % Proof 1 at 0.93 (+ 0.03) seconds.
% 1.66/1.93 % Length of proof is 94.
% 1.66/1.93 % Level of proof is 13.
% 1.66/1.93 % Maximum clause weight is 21.000.
% 1.66/1.93 % Given clauses 1543.
% 1.66/1.93
% 1.66/1.93 1 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1_46) # label(axiom). [assumption].
% 1.66/1.93 2 organization(sk3) # label(theorem_10_74) # label(negated_conjecture). [assumption].
% 1.66/1.93 4 -dissimilar(A,B,C) | organization(A) # label(definition_2_47) # label(axiom). [assumption].
% 1.66/1.93 5 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13_54) # label(axiom). [assumption].
% 1.66/1.93 9 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_51) # label(axiom). [assumption].
% 1.66/1.93 15 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15_55) # label(axiom). [assumption].
% 1.66/1.93 16 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15_56) # label(axiom). [assumption].
% 1.66/1.93 17 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17_64) # label(axiom). [assumption].
% 1.66/1.93 18 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17_65) # label(axiom). [assumption].
% 1.66/1.93 19 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17_66) # label(axiom). [assumption].
% 1.66/1.93 21 -robust_position(A) | -smaller_or_equal(age(A,B),tau) | -positional_advantage(A,B) # label(definition_4_57) # label(axiom). [assumption].
% 1.66/1.93 22 robust_position(sk3) # label(theorem_10_75) # label(negated_conjecture). [assumption].
% 1.66/1.93 25 -robust_position(A) | -greater(age(A,B),tau) | positional_advantage(A,B) # label(definition_4_58) # label(axiom). [assumption].
% 1.66/1.93 32 greater(mod1,low) # label(assumption_18b_69) # label(axiom). [assumption].
% 1.66/1.93 36 greater(mod2,mod1) # label(assumption_19_73) # label(axiom). [assumption].
% 1.66/1.93 38 greater(tau,zero) # label(theorem_10_79) # label(negated_conjecture). [assumption].
% 1.66/1.93 39 greater(sigma,tau) # label(theorem_10_80) # label(negated_conjecture). [assumption].
% 1.66/1.93 40 age(sk3,sk4) = zero # label(theorem_10_77) # label(negated_conjecture). [assumption].
% 1.66/1.93 41 smaller_or_equal(age(sk3,sk5),tau) # label(theorem_10_81) # label(negated_conjecture). [assumption].
% 1.66/1.93 42 greater(age(sk3,sk6),tau) # label(theorem_10_82) # label(negated_conjecture). [assumption].
% 1.66/1.93 43 smaller_or_equal(age(sk3,sk6),sigma) # label(theorem_10_83) # label(negated_conjecture). [assumption].
% 1.66/1.93 44 greater(age(sk3,sk7),sigma) # label(theorem_10_84) # label(negated_conjecture). [assumption].
% 1.66/1.93 45 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 1.66/1.93 46 -has_endowment(sk3) # label(theorem_10_76) # label(negated_conjecture). [assumption].
% 1.66/1.93 47 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict_9) # label(axiom). [assumption].
% 1.66/1.93 49 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2_49) # label(axiom). [assumption].
% 1.66/1.93 50 -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) # label(theorem_10_85) # label(negated_conjecture). [assumption].
% 1.66/1.93 51 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 1.66/1.93 53 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 1.66/1.93 54 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 1.66/1.93 55 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 1.66/1.93 56 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive_10) # label(axiom). [assumption].
% 1.66/1.93 59 has_endowment(sk3) | -has_immunity(sk3,A). [resolve(1,a,2,a)].
% 1.66/1.93 60 -has_immunity(sk3,A). [copy(59),unit_del(a,46)].
% 1.66/1.93 62 age(sk3,A) != zero | is_aligned(sk3,A). [resolve(5,a,2,a)].
% 1.66/1.93 67 -is_aligned(sk3,A) | is_aligned(sk3,B) | dissimilar(sk3,A,B). [resolve(9,a,2,a)].
% 1.66/1.93 78 age(sk3,A) != zero | -greater(age(sk3,B),sigma) | dissimilar(sk3,A,B). [resolve(15,a,2,a)].
% 1.66/1.93 83 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E). [resolve(16,a,4,b)].
% 1.66/1.93 84 has_immunity(sk3,A) | -is_aligned(sk3,A) | -positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = low. [resolve(17,a,2,a)].
% 1.66/1.93 85 -is_aligned(sk3,A) | -positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = low. [copy(84),unit_del(a,60)].
% 1.66/1.93 88 has_immunity(sk3,A) | is_aligned(sk3,A) | -positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = mod1. [resolve(18,a,2,a)].
% 1.66/1.93 89 is_aligned(sk3,A) | -positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = mod1. [copy(88),unit_del(a,60)].
% 1.66/1.93 92 has_immunity(sk3,A) | -is_aligned(sk3,A) | positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = mod2. [resolve(19,a,2,a)].
% 1.66/1.93 93 -is_aligned(sk3,A) | positional_advantage(sk3,A) | hazard_of_mortality(sk3,A) = mod2. [copy(92),unit_del(a,60)].
% 1.66/1.93 100 -smaller_or_equal(age(sk3,A),tau) | -positional_advantage(sk3,A). [resolve(21,a,22,a)].
% 1.66/1.93 103 -greater(age(sk3,A),tau) | positional_advantage(sk3,A). [resolve(25,a,22,a)].
% 1.66/1.93 108 -greater(A,A). [factor(47,a,b)].
% 1.66/1.93 111 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma). [factor(83,b,d)].
% 1.66/1.93 127 greater(A,B) | B = A | greater(B,A). [resolve(53,a,45,a)].
% 1.66/1.93 131 smaller(zero,tau). [resolve(54,a,38,a)].
% 1.66/1.93 133 smaller(mod1,mod2). [resolve(54,a,36,a)].
% 1.66/1.93 137 smaller(low,mod1). [resolve(54,a,32,a)].
% 1.66/1.93 139 smaller(age(sk3,sk6),sigma) | age(sk3,sk6) = sigma. [resolve(55,a,43,a)].
% 1.66/1.93 141 -greater(sigma,A) | greater(age(sk3,sk7),A). [resolve(56,a,44,a)].
% 1.66/1.93 161 -greater(A,mod1) | greater(A,low). [resolve(56,b,32,a)].
% 1.66/1.93 163 is_aligned(sk3,sk4). [resolve(62,a,40,a)].
% 1.66/1.93 165 age(sk3,A) != zero | dissimilar(sk3,A,sk7). [resolve(78,b,44,a)].
% 1.66/1.93 167 -positional_advantage(sk3,sk5). [resolve(100,a,41,a)].
% 1.66/1.93 168 -smaller_or_equal(zero,tau) | -positional_advantage(sk3,sk4). [para(40(a,1),100(a,1))].
% 1.66/1.93 169 positional_advantage(sk3,sk6). [resolve(103,a,42,a)].
% 1.66/1.93 170 -smaller(A,A). [ur(53,b,108,a)].
% 1.66/1.93 180 smaller_or_equal(zero,tau). [resolve(131,a,51,a)].
% 1.66/1.93 181 -positional_advantage(sk3,sk4). [back_unit_del(168),unit_del(a,180)].
% 1.66/1.93 197 -greater(age(sk3,sk5),tau). [ur(103,b,167,a)].
% 1.66/1.93 200 hazard_of_mortality(sk3,sk4) = mod2. [resolve(163,a,93,a),unit_del(a,181)].
% 1.66/1.93 202 is_aligned(sk3,A) | dissimilar(sk3,sk4,A). [resolve(163,a,67,a)].
% 1.66/1.93 205 -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) != mod2. [back_rewrite(50),rewrite([200(20)])].
% 1.66/1.93 207 -is_aligned(sk3,sk6) | hazard_of_mortality(sk3,sk6) = low. [resolve(169,a,85,b)].
% 1.66/1.93 235 age(sk3,sk6) = sigma | greater(sigma,age(sk3,sk6)). [resolve(139,a,53,a)].
% 1.66/1.93 252 greater(age(sk3,sk7),tau). [resolve(141,a,39,a)].
% 1.66/1.93 257 -greater(age(sk3,sk5),sigma). [ur(56,b,39,a,c,197,a)].
% 1.66/1.93 262 positional_advantage(sk3,sk7). [resolve(252,a,103,a)].
% 1.66/1.93 267 is_aligned(sk3,sk7) | hazard_of_mortality(sk3,sk7) = mod1. [resolve(262,a,89,b)].
% 1.66/1.93 276 -dissimilar(sk3,sk4,sk5). [ur(111,a,40,a,c,257,a)].
% 1.66/1.93 316 greater(A,low) | greater(mod1,A) | mod1 = A. [resolve(161,a,127,c),flip(c)].
% 1.66/1.93 327 dissimilar(sk3,sk4,sk7). [resolve(165,a,40,a)].
% 1.66/1.93 328 -is_aligned(sk3,sk7). [resolve(327,a,49,a),unit_del(a,163)].
% 1.66/1.93 329 hazard_of_mortality(sk3,sk7) = mod1. [back_unit_del(267),unit_del(a,328)].
% 1.66/1.93 330 -smaller(hazard_of_mortality(sk3,sk6),mod1) | -smaller(mod1,hazard_of_mortality(sk3,sk5)) | hazard_of_mortality(sk3,sk5) != mod2. [back_rewrite(205),rewrite([329(6),329(8)])].
% 1.66/1.93 339 is_aligned(sk3,sk5). [resolve(202,b,276,a)].
% 1.66/1.93 340 is_aligned(sk3,A) | greater(age(sk3,A),sigma). [resolve(202,b,111,b),rewrite([40(5)]),xx(b)].
% 1.66/1.93 341 hazard_of_mortality(sk3,sk5) = mod2. [resolve(339,a,93,a),unit_del(a,167)].
% 1.66/1.93 347 -smaller(hazard_of_mortality(sk3,sk6),mod1). [back_rewrite(330),rewrite([341(9),341(11)]),xx(c),unit_del(b,133)].
% 1.66/1.93 351 -greater(mod1,hazard_of_mortality(sk3,sk6)). [ur(54,b,347,a)].
% 1.66/1.93 367 greater(age(sk3,sk6),sigma) | hazard_of_mortality(sk3,sk6) = low. [resolve(340,a,207,a)].
% 1.66/1.93 723 greater(hazard_of_mortality(sk3,sk6),low) | hazard_of_mortality(sk3,sk6) = mod1. [resolve(316,b,351,a),flip(b)].
% 1.66/1.93 1202 age(sk3,sk6) = sigma | -greater(age(sk3,sk6),sigma). [resolve(235,b,47,b)].
% 1.66/1.93 2016 hazard_of_mortality(sk3,sk6) = low | smaller(sigma,age(sk3,sk6)). [resolve(367,a,54,a)].
% 1.66/1.93 5711 hazard_of_mortality(sk3,sk6) = mod1 | smaller(low,hazard_of_mortality(sk3,sk6)). [resolve(723,a,54,a)].
% 1.66/1.93 5984 age(sk3,sk6) = sigma | hazard_of_mortality(sk3,sk6) = low. [resolve(1202,b,367,a)].
% 1.66/1.93 6025 age(sk3,sk6) = sigma. [para(5984(b,1),347(a,1)),unit_del(b,137)].
% 1.66/1.93 6322 hazard_of_mortality(sk3,sk6) = low. [back_rewrite(2016),rewrite([6025(9)]),unit_del(b,170)].
% 1.66/1.93 6327 mod1 = low. [back_rewrite(5711),rewrite([6322(3),6322(7)]),flip(a),unit_del(b,170)].
% 1.66/1.93 6602 $F. [back_rewrite(137),rewrite([6327(2)]),unit_del(a,170)].
% 1.66/1.93
% 1.66/1.93 % SZS output end Refutation
% 1.66/1.93 ============================== end of proof ==========================
% 1.66/1.93
% 1.66/1.93 ============================== STATISTICS ============================
% 1.66/1.93
% 1.66/1.93 Given=1543. Generated=34222. Kept=6564. proofs=1.
% 1.66/1.93 Usable=884. Sos=2055. Demods=7. Limbo=275, Disabled=3452. Hints=0.
% 1.66/1.93 Megabytes=6.38.
% 1.66/1.93 User_CPU=0.93, System_CPU=0.03, Wall_clock=1.
% 1.66/1.93
% 1.66/1.93 ============================== end of statistics =====================
% 1.66/1.93
% 1.66/1.93 ============================== end of search =========================
% 1.66/1.93
% 1.66/1.93 THEOREM PROVED
% 1.66/1.93 % SZS status Unsatisfiable
% 1.66/1.93
% 1.66/1.93 Exiting with 1 proof.
% 1.66/1.93
% 1.66/1.93 Process 28276 exit (max_proofs) Thu Jun 9 12:34:59 2022
% 1.66/1.93 Prover9 interrupted
%------------------------------------------------------------------------------