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:10 EDT 2022
% Result : Unsatisfiable 0.51s 0.83s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : MGT061-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Thu Jun 9 08:56:52 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.51/0.81 ============================== Prover9 ===============================
% 0.51/0.81 Prover9 (32) version 2009-11A, November 2009.
% 0.51/0.81 Process 2617 was started by sandbox on n032.cluster.edu,
% 0.51/0.81 Thu Jun 9 08:56:53 2022
% 0.51/0.81 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2464_n032.cluster.edu".
% 0.51/0.81 ============================== end of head ===========================
% 0.51/0.81
% 0.51/0.81 ============================== INPUT =================================
% 0.51/0.81
% 0.51/0.81 % Reading from file /tmp/Prover9_2464_n032.cluster.edu
% 0.51/0.81
% 0.51/0.81 set(prolog_style_variables).
% 0.51/0.81 set(auto2).
% 0.51/0.81 % set(auto2) -> set(auto).
% 0.51/0.81 % set(auto) -> set(auto_inference).
% 0.51/0.81 % set(auto) -> set(auto_setup).
% 0.51/0.81 % set(auto_setup) -> set(predicate_elim).
% 0.51/0.81 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.51/0.81 % set(auto) -> set(auto_limits).
% 0.51/0.81 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.51/0.81 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.51/0.81 % set(auto) -> set(auto_denials).
% 0.51/0.81 % set(auto) -> set(auto_process).
% 0.51/0.81 % set(auto2) -> assign(new_constants, 1).
% 0.51/0.81 % set(auto2) -> assign(fold_denial_max, 3).
% 0.51/0.81 % set(auto2) -> assign(max_weight, "200.000").
% 0.51/0.81 % set(auto2) -> assign(max_hours, 1).
% 0.51/0.81 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.51/0.81 % set(auto2) -> assign(max_seconds, 0).
% 0.51/0.81 % set(auto2) -> assign(max_minutes, 5).
% 0.51/0.81 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.51/0.81 % set(auto2) -> set(sort_initial_sos).
% 0.51/0.81 % set(auto2) -> assign(sos_limit, -1).
% 0.51/0.81 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.51/0.81 % set(auto2) -> assign(max_megs, 400).
% 0.51/0.81 % set(auto2) -> assign(stats, some).
% 0.51/0.81 % set(auto2) -> clear(echo_input).
% 0.51/0.81 % set(auto2) -> set(quiet).
% 0.51/0.81 % set(auto2) -> clear(print_initial_clauses).
% 0.51/0.81 % set(auto2) -> clear(print_given).
% 0.51/0.81 assign(lrs_ticks,-1).
% 0.51/0.81 assign(sos_limit,10000).
% 0.51/0.81 assign(order,kbo).
% 0.51/0.81 set(lex_order_vars).
% 0.51/0.81 clear(print_given).
% 0.51/0.81
% 0.51/0.81 % formulas(sos). % not echoed (46 formulas)
% 0.51/0.81
% 0.51/0.81 ============================== end of input ==========================
% 0.51/0.81
% 0.51/0.81 % From the command line: assign(max_seconds, 300).
% 0.51/0.81
% 0.51/0.81 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.51/0.81
% 0.51/0.81 % Formulas that are not ordinary clauses:
% 0.51/0.81
% 0.51/0.81 ============================== end of process non-clausal formulas ===
% 0.51/0.81
% 0.51/0.81 ============================== PROCESS INITIAL CLAUSES ===============
% 0.51/0.81
% 0.51/0.81 ============================== PREDICATE ELIMINATION =================
% 0.51/0.81 1 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1_39) # label(axiom). [assumption].
% 0.51/0.81 2 organization(sk2) # label(theorem_7_66) # label(negated_conjecture). [assumption].
% 0.51/0.81 3 -dissimilar(A,B,C) | organization(A) # label(definition_2_40) # label(axiom). [assumption].
% 0.51/0.81 Derived: has_endowment(sk2) | -has_immunity(sk2,A). [resolve(1,a,2,a)].
% 0.51/0.81 Derived: has_endowment(A) | -has_immunity(A,B) | -dissimilar(A,C,D). [resolve(1,a,3,b)].
% 0.51/0.81 4 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13_47) # label(axiom). [assumption].
% 0.51/0.81 Derived: age(sk2,A) != zero | is_aligned(sk2,A). [resolve(4,a,2,a)].
% 0.51/0.81 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(4,a,3,b)].
% 0.51/0.81 5 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17_56) # label(axiom). [assumption].
% 0.51/0.81 Derived: -has_immunity(sk2,A) | hazard_of_mortality(sk2,A) = very_low. [resolve(5,a,2,a)].
% 0.51/0.81 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D). [resolve(5,a,3,b)].
% 0.51/0.81 6 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,B,C) # label(definition_2_43) # label(axiom). [assumption].
% 0.51/0.81 7 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_44) # label(axiom). [assumption].
% 0.51/0.81 Derived: -is_aligned(sk2,A) | is_aligned(sk2,B) | dissimilar(sk2,A,B). [resolve(7,a,2,a)].
% 0.51/0.81 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(7,a,3,b)].
% 0.51/0.81 8 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) # label(definition_2_45) # label(axiom). [assumption].
% 0.51/0.81 Derived: -is_aligned(sk2,A) | is_aligned(sk2,B) | dissimilar(sk2,B,A). [resolve(8,a,2,a)].
% 0.51/0.81 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -dissimilar(A,D,E). [resolve(8,a,3,b)].
% 0.51/0.81 9 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,C,B) # label(definition_2_46) # label(axiom). [assumption].
% 0.51/0.81 10 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15_48) # label(axiom). [assumption].
% 0.51/0.81 Derived: age(sk2,A) != zero | -greater(age(sk2,B),sigma) | dissimilar(sk2,A,B). [resolve(10,a,2,a)].
% 0.51/0.81 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(10,a,3,b)].
% 0.51/0.81 11 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15_49) # label(axiom). [assumption].
% 0.51/0.81 Derived: age(sk2,A) != zero | -dissimilar(sk2,A,B) | greater(age(sk2,B),sigma). [resolve(11,a,2,a)].
% 0.51/0.81 Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E). [resolve(11,a,3,b)].
% 0.51/0.81 12 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17_57) # label(axiom). [assumption].
% 0.51/0.81 Derived: has_immunity(sk2,A) | -is_aligned(sk2,A) | -positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = low. [resolve(12,a,2,a)].
% 0.51/0.81 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D). [resolve(12,a,3,b)].
% 0.51/0.81 13 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17_58) # label(axiom). [assumption].
% 0.51/0.81 Derived: has_immunity(sk2,A) | is_aligned(sk2,A) | -positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = mod1. [resolve(13,a,2,a)].
% 0.51/0.81 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D). [resolve(13,a,3,b)].
% 0.51/0.81 14 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17_59) # label(axiom). [assumption].
% 0.51/0.81 Derived: has_immunity(sk2,A) | -is_aligned(sk2,A) | positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = mod2. [resolve(14,a,2,a)].
% 0.51/0.81 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D). [resolve(14,a,3,b)].
% 0.51/0.81 15 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17_60) # label(axiom). [assumption].
% 0.51/0.81 Derived: has_immunity(sk2,A) | is_aligned(sk2,A) | positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = high. [resolve(15,a,2,a)].
% 0.51/0.81 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D). [resolve(15,a,3,b)].
% 0.51/0.81 16 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3_51) # label(axiom). [assumption].
% 0.51/0.81 17 fragile_position(sk2) # label(theorem_7_67) # label(negated_conjecture). [assumption].
% 0.51/0.81 18 smaller_or_equal(age(A,sk1(A)),sigma) | positional_advantage(A,sk1(A)) | fragile_position(A) # label(definition_3_53) # label(axiom). [assumption].
% 0.51/0.81 19 smaller_or_equal(age(A,sk1(A)),sigma) | greater(age(A,sk1(A)),sigma) | fragile_position(A) # label(definition_3_52) # label(axiom). [assumption].
% 0.51/0.81 Derived: -greater(age(sk2,A),sigma) | -positional_advantage(sk2,A). [resolve(16,a,17,a)].
% 0.51/0.81 Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | smaller_or_equal(age(A,sk1(A)),sigma) | positional_advantage(A,sk1(A)). [resolve(16,a,18,c)].
% 0.51/0.81 Derived: -greater(age(A,B),sigma) | -positional_advantage(A,B) | smaller_or_equal(age(A,sk1(A)),sigma) | greater(age(A,sk1(A)),sigma). [resolve(16,a,19,c)].
% 0.51/0.81 20 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3_50) # label(axiom). [assumption].
% 0.51/0.81 Derived: -smaller_or_equal(age(sk2,A),sigma) | positional_advantage(sk2,A). [resolve(20,a,17,a)].
% 0.51/0.81 Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | smaller_or_equal(age(A,sk1(A)),sigma) | positional_advantage(A,sk1(A)). [resolve(20,a,18,c)].
% 0.51/0.83 Derived: -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) | smaller_or_equal(age(A,sk1(A)),sigma) | greater(age(A,sk1(A)),sigma). [resolve(20,a,19,c)].
% 0.51/0.83 21 -positional_advantage(A,sk1(A)) | positional_advantage(A,sk1(A)) | fragile_position(A) # label(definition_3_55) # label(axiom). [assumption].
% 0.51/0.83 22 -positional_advantage(A,sk1(A)) | greater(age(A,sk1(A)),sigma) | fragile_position(A) # label(definition_3_54) # label(axiom). [assumption].
% 0.51/0.83 Derived: -positional_advantage(A,sk1(A)) | greater(age(A,sk1(A)),sigma) | -greater(age(A,B),sigma) | -positional_advantage(A,B). [resolve(22,c,16,a)].
% 0.51/0.83 Derived: -positional_advantage(A,sk1(A)) | greater(age(A,sk1(A)),sigma) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B). [resolve(22,c,20,a)].
% 0.51/0.83 23 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.51/0.83 24 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.51/0.83 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(23,a,24,a)].
% 0.51/0.83 25 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.51/0.83 Derived: greater(A,B) | B = A | greater(B,A). [resolve(25,a,24,a)].
% 0.51/0.83 26 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.51/0.83 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(26,b,23,a)].
% 0.51/0.83 27 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.51/0.83 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(27,b,25,a)].
% 0.51/0.83 28 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.51/0.83 29 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.51/0.83 30 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.51/0.83
% 0.51/0.83 ============================== end predicate elimination =============
% 0.51/0.83
% 0.51/0.83 Auto_denials: (non-Horn, no changes).
% 0.51/0.83
% 0.51/0.83 Term ordering decisions:
% 0.51/0.83
% 0.51/0.83 % Assigning unary symbol sk1 kb_weight 0 and highest precedence (22).
% 0.51/0.83 Function symbol KB weights: sk2=1. sigma=1. zero=1. low=1. high=1. mod1=1. mod2=1. very_low=1. sk3=1. sk4=1. sk5=1. age=1. hazard_of_mortality=1. sk1=0.
% 0.51/0.83
% 0.51/0.83 ============================== end of process initial clauses ========
% 0.51/0.83
% 0.51/0.83 ============================== CLAUSES FOR SEARCH ====================
% 0.51/0.83
% 0.51/0.83 ============================== end of clauses for search =============
% 0.51/0.83
% 0.51/0.83 ============================== SEARCH ================================
% 0.51/0.83
% 0.51/0.83 % Starting search at 0.01 seconds.
% 0.51/0.83
% 0.51/0.83 ============================== PROOF =================================
% 0.51/0.83 % SZS status Unsatisfiable
% 0.51/0.83 % SZS output start Refutation
% 0.51/0.83
% 0.51/0.83 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.51/0.83 % Length of proof is 70.
% 0.51/0.83 % Level of proof is 8.
% 0.51/0.83 % Maximum clause weight is 21.000.
% 0.51/0.83 % Given clauses 127.
% 0.51/0.83
% 0.51/0.83 1 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1_39) # label(axiom). [assumption].
% 0.51/0.83 2 organization(sk2) # label(theorem_7_66) # label(negated_conjecture). [assumption].
% 0.51/0.83 3 -dissimilar(A,B,C) | organization(A) # label(definition_2_40) # label(axiom). [assumption].
% 0.51/0.83 4 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13_47) # label(axiom). [assumption].
% 0.51/0.83 7 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_44) # label(axiom). [assumption].
% 0.51/0.83 10 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15_48) # label(axiom). [assumption].
% 0.51/0.83 11 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15_49) # label(axiom). [assumption].
% 0.51/0.83 12 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17_57) # label(axiom). [assumption].
% 0.51/0.83 15 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17_60) # label(axiom). [assumption].
% 0.51/0.83 16 -fragile_position(A) | -greater(age(A,B),sigma) | -positional_advantage(A,B) # label(definition_3_51) # label(axiom). [assumption].
% 0.51/0.83 17 fragile_position(sk2) # label(theorem_7_67) # label(negated_conjecture). [assumption].
% 0.51/0.83 20 -fragile_position(A) | -smaller_or_equal(age(A,B),sigma) | positional_advantage(A,B) # label(definition_3_50) # label(axiom). [assumption].
% 0.51/0.83 23 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.51/0.83 24 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.51/0.83 25 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.51/0.83 26 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.51/0.83 34 greater(high,mod2) # label(assumption_18d_64) # label(axiom). [assumption].
% 0.51/0.83 35 greater(mod2,low) # label(assumption_18e_65) # label(axiom). [assumption].
% 0.51/0.83 36 greater(sigma,zero) # label(theorem_7_70) # label(negated_conjecture). [assumption].
% 0.51/0.83 37 age(sk2,sk3) = zero # label(theorem_7_69) # label(negated_conjecture). [assumption].
% 0.51/0.83 38 smaller_or_equal(age(sk2,sk4),sigma) # label(theorem_7_71) # label(negated_conjecture). [assumption].
% 0.51/0.83 39 greater(age(sk2,sk5),sigma) # label(theorem_7_72) # label(negated_conjecture). [assumption].
% 0.51/0.83 40 -has_endowment(sk2) # label(theorem_7_68) # label(negated_conjecture). [assumption].
% 0.51/0.83 41 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict_9) # label(axiom). [assumption].
% 0.51/0.83 42 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2_42) # label(axiom). [assumption].
% 0.51/0.83 43 -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) | hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3) # label(theorem_7_73) # label(negated_conjecture). [assumption].
% 0.51/0.83 45 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive_10) # label(axiom). [assumption].
% 0.51/0.83 47 has_endowment(sk2) | -has_immunity(sk2,A). [resolve(1,a,2,a)].
% 0.51/0.83 48 -has_immunity(sk2,A). [copy(47),unit_del(a,40)].
% 0.51/0.83 50 age(sk2,A) != zero | is_aligned(sk2,A). [resolve(4,a,2,a)].
% 0.51/0.83 53 -is_aligned(sk2,A) | is_aligned(sk2,B) | dissimilar(sk2,A,B). [resolve(7,a,2,a)].
% 0.51/0.83 57 age(sk2,A) != zero | -greater(age(sk2,B),sigma) | dissimilar(sk2,A,B). [resolve(10,a,2,a)].
% 0.51/0.83 60 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E). [resolve(11,a,3,b)].
% 0.51/0.83 61 has_immunity(sk2,A) | -is_aligned(sk2,A) | -positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = low. [resolve(12,a,2,a)].
% 0.51/0.83 62 -is_aligned(sk2,A) | -positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = low. [copy(61),unit_del(a,48)].
% 0.51/0.83 70 has_immunity(sk2,A) | is_aligned(sk2,A) | positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = high. [resolve(15,a,2,a)].
% 0.51/0.83 71 is_aligned(sk2,A) | positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = high. [copy(70),unit_del(a,48)].
% 0.51/0.83 73 -greater(age(sk2,A),sigma) | -positional_advantage(sk2,A). [resolve(16,a,17,a)].
% 0.51/0.83 76 -smaller_or_equal(age(sk2,A),sigma) | positional_advantage(sk2,A). [resolve(20,a,17,a)].
% 0.51/0.83 82 greater(A,B) | B = A | greater(B,A). [resolve(25,a,24,a)].
% 0.51/0.83 83 -greater(A,B) | smaller_or_equal(B,A). [resolve(26,b,23,a)].
% 0.51/0.83 85 -greater(A,A). [factor(41,a,b)].
% 0.51/0.83 88 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma). [factor(60,b,d)].
% 0.51/0.83 91 -greater(low,mod2). [resolve(41,a,35,a)].
% 0.51/0.83 101 -greater(mod2,A) | greater(high,A). [resolve(45,a,34,a)].
% 0.51/0.83 112 is_aligned(sk2,sk3). [resolve(50,a,37,a)].
% 0.51/0.83 113 age(sk2,A) != zero | dissimilar(sk2,A,sk5). [resolve(57,b,39,a)].
% 0.51/0.83 116 -positional_advantage(sk2,sk5). [ur(73,a,39,a)].
% 0.51/0.83 117 positional_advantage(sk2,sk4). [resolve(76,a,38,a)].
% 0.51/0.83 118 -smaller_or_equal(zero,sigma) | positional_advantage(sk2,sk3). [para(37(a,1),76(a,1))].
% 0.51/0.83 126 hazard_of_mortality(sk2,sk5) = hazard_of_mortality(sk2,sk4) | greater(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk5)) | hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3). [resolve(82,a,43,a),flip(a)].
% 0.51/0.83 131 smaller_or_equal(zero,sigma). [resolve(83,a,36,a)].
% 0.51/0.83 137 positional_advantage(sk2,sk3). [back_unit_del(118),unit_del(a,131)].
% 0.51/0.83 140 -greater(low,high). [ur(45,b,34,a,c,91,a)].
% 0.51/0.83 144 is_aligned(sk2,A) | dissimilar(sk2,sk3,A). [resolve(112,a,53,a)].
% 0.51/0.83 149 -greater(age(sk2,sk4),sigma). [resolve(117,a,73,b)].
% 0.51/0.83 151 -is_aligned(sk2,sk4) | hazard_of_mortality(sk2,sk4) = low. [resolve(117,a,62,b)].
% 0.51/0.83 152 is_aligned(sk2,sk5) | hazard_of_mortality(sk2,sk5) = high. [resolve(116,a,71,b)].
% 0.51/0.83 161 hazard_of_mortality(sk2,sk3) = low. [resolve(137,a,62,b),unit_del(a,112)].
% 0.51/0.83 162 hazard_of_mortality(sk2,sk5) = hazard_of_mortality(sk2,sk4) | greater(hazard_of_mortality(sk2,sk4),hazard_of_mortality(sk2,sk5)) | hazard_of_mortality(sk2,sk4) != low. [back_rewrite(126),rewrite([161(20)])].
% 0.51/0.83 168 -dissimilar(sk2,sk3,sk4). [ur(88,a,37,a,c,149,a)].
% 0.51/0.83 178 greater(high,low). [resolve(101,a,35,a)].
% 0.51/0.83 202 dissimilar(sk2,sk3,sk5). [resolve(113,a,37,a)].
% 0.51/0.83 203 -is_aligned(sk2,sk5). [resolve(202,a,42,a),unit_del(a,112)].
% 0.51/0.83 204 hazard_of_mortality(sk2,sk5) = high. [back_unit_del(152),unit_del(a,203)].
% 0.51/0.83 206 hazard_of_mortality(sk2,sk4) = high | greater(hazard_of_mortality(sk2,sk4),high) | hazard_of_mortality(sk2,sk4) != low. [back_rewrite(162),rewrite([204(3),204(11)]),flip(a)].
% 0.51/0.83 220 is_aligned(sk2,sk4). [resolve(144,b,168,a)].
% 0.51/0.83 222 hazard_of_mortality(sk2,sk4) = low. [back_unit_del(151),unit_del(a,220)].
% 0.51/0.83 223 high = low. [back_rewrite(206),rewrite([222(3),222(6),222(9)]),flip(a),xx(c),unit_del(b,140)].
% 0.51/0.83 232 $F. [back_rewrite(178),rewrite([223(1)]),unit_del(a,85)].
% 0.51/0.83
% 0.51/0.83 % SZS output end Refutation
% 0.51/0.83 ============================== end of proof ==========================
% 0.51/0.83
% 0.51/0.83 ============================== STATISTICS ============================
% 0.51/0.83
% 0.51/0.83 Given=127. Generated=519. Kept=196. proofs=1.
% 0.51/0.83 Usable=116. Sos=32. Demods=5. Limbo=9, Disabled=119. Hints=0.
% 0.51/0.83 Megabytes=0.22.
% 0.51/0.83 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.51/0.83
% 0.51/0.83 ============================== end of statistics =====================
% 0.51/0.83
% 0.51/0.83 ============================== end of search =========================
% 0.51/0.83
% 0.51/0.83 THEOREM PROVED
% 0.51/0.83 % SZS status Unsatisfiable
% 0.51/0.83
% 0.51/0.83 Exiting with 1 proof.
% 0.51/0.83
% 0.51/0.83 Process 2617 exit (max_proofs) Thu Jun 9 08:56:53 2022
% 0.51/0.83 Prover9 interrupted
%------------------------------------------------------------------------------