TSTP Solution File: MGT065-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT065-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:12 EDT 2022
% Result : Unsatisfiable 0.73s 1.15s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT065-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.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:06:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.01 ============================== Prover9 ===============================
% 0.44/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.01 Process 16259 was started by sandbox on n021.cluster.edu,
% 0.44/1.01 Thu Jun 9 08:06:38 2022
% 0.44/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_15914_n021.cluster.edu".
% 0.44/1.01 ============================== end of head ===========================
% 0.44/1.01
% 0.44/1.01 ============================== INPUT =================================
% 0.44/1.01
% 0.44/1.01 % Reading from file /tmp/Prover9_15914_n021.cluster.edu
% 0.44/1.01
% 0.44/1.01 set(prolog_style_variables).
% 0.44/1.01 set(auto2).
% 0.44/1.01 % set(auto2) -> set(auto).
% 0.44/1.01 % set(auto) -> set(auto_inference).
% 0.44/1.01 % set(auto) -> set(auto_setup).
% 0.44/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.01 % set(auto) -> set(auto_limits).
% 0.44/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.01 % set(auto) -> set(auto_denials).
% 0.44/1.01 % set(auto) -> set(auto_process).
% 0.44/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.01 % set(auto2) -> assign(stats, some).
% 0.44/1.01 % set(auto2) -> clear(echo_input).
% 0.44/1.01 % set(auto2) -> set(quiet).
% 0.44/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.01 % set(auto2) -> clear(print_given).
% 0.44/1.01 assign(lrs_ticks,-1).
% 0.44/1.01 assign(sos_limit,10000).
% 0.44/1.01 assign(order,kbo).
% 0.44/1.01 set(lex_order_vars).
% 0.44/1.01 clear(print_given).
% 0.44/1.01
% 0.44/1.01 % formulas(sos). % not echoed (52 formulas)
% 0.44/1.01
% 0.44/1.01 ============================== end of input ==========================
% 0.44/1.01
% 0.44/1.01 % From the command line: assign(max_seconds, 300).
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.01
% 0.44/1.01 % Formulas that are not ordinary clauses:
% 0.44/1.01
% 0.44/1.01 ============================== end of process non-clausal formulas ===
% 0.44/1.01
% 0.44/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.01
% 0.44/1.01 ============================== PREDICATE ELIMINATION =================
% 0.44/1.01 1 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13_54) # label(axiom). [assumption].
% 0.44/1.01 2 organization(sk2) # label(theorem_11_67) # label(negated_conjecture). [assumption].
% 0.44/1.01 3 -has_endowment(A) | organization(A) # label(definition_1_40) # label(axiom). [assumption].
% 0.44/1.01 4 -dissimilar(A,B,C) | organization(A) # label(definition_2_47) # label(axiom). [assumption].
% 0.44/1.01 Derived: age(sk2,A) != zero | is_aligned(sk2,A). [resolve(1,a,2,a)].
% 0.44/1.01 Derived: age(A,B) != zero | is_aligned(A,B) | -has_endowment(A). [resolve(1,a,3,b)].
% 0.44/1.01 Derived: age(A,B) != zero | is_aligned(A,B) | -dissimilar(A,C,D). [resolve(1,a,4,b)].
% 0.44/1.01 5 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17_57) # label(axiom). [assumption].
% 0.44/1.01 Derived: -has_immunity(sk2,A) | hazard_of_mortality(sk2,A) = very_low. [resolve(5,a,2,a)].
% 0.44/1.01 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -has_endowment(A). [resolve(5,a,3,b)].
% 0.44/1.01 Derived: -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -dissimilar(A,C,D). [resolve(5,a,4,b)].
% 0.44/1.01 6 -organization(A) | -has_immunity(A,sk1(A)) | has_immunity(A,sk1(A)) | has_endowment(A) # label(definition_1_46) # label(axiom). [assumption].
% 0.44/1.01 7 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,B,C) # label(definition_2_50) # label(axiom). [assumption].
% 0.44/1.01 8 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) # label(definition_2_51) # label(axiom). [assumption].
% 0.44/1.01 Derived: -is_aligned(sk2,A) | is_aligned(sk2,B) | dissimilar(sk2,A,B). [resolve(8,a,2,a)].
% 0.44/1.01 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -has_endowment(A). [resolve(8,a,3,b)].
% 0.44/1.01 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(8,a,4,b)].
% 0.44/1.01 9 -organization(A) | -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) # label(definition_2_52) # label(axiom). [assumption].
% 0.44/1.01 Derived: -is_aligned(sk2,A) | is_aligned(sk2,B) | dissimilar(sk2,B,A). [resolve(9,a,2,a)].
% 0.44/1.01 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -has_endowment(A). [resolve(9,a,3,b)].
% 0.44/1.01 Derived: -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -dissimilar(A,D,E). [resolve(9,a,4,b)].
% 0.44/1.01 10 -organization(A) | -is_aligned(A,B) | is_aligned(A,B) | dissimilar(A,C,B) # label(definition_2_53) # label(axiom). [assumption].
% 0.44/1.01 11 -organization(A) | smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | has_endowment(A) # label(definition_1_44) # label(axiom). [assumption].
% 0.44/1.01 Derived: smaller_or_equal(age(sk2,sk1(sk2)),eta) | has_immunity(sk2,sk1(sk2)) | has_endowment(sk2). [resolve(11,a,2,a)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | has_endowment(A) | -dissimilar(A,B,C). [resolve(11,a,4,b)].
% 0.44/1.01 12 -organization(A) | -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | has_endowment(A) # label(definition_1_45) # label(axiom). [assumption].
% 0.44/1.01 Derived: -has_immunity(sk2,sk1(sk2)) | greater(age(sk2,sk1(sk2)),eta) | has_endowment(sk2). [resolve(12,a,2,a)].
% 0.44/1.01 Derived: -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | has_endowment(A) | -dissimilar(A,B,C). [resolve(12,a,4,b)].
% 0.44/1.01 13 -organization(A) | smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | has_endowment(A) # label(definition_1_43) # label(axiom). [assumption].
% 0.44/1.01 Derived: smaller_or_equal(age(sk2,sk1(sk2)),eta) | greater(age(sk2,sk1(sk2)),eta) | has_endowment(sk2). [resolve(13,a,2,a)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | has_endowment(A) | -dissimilar(A,B,C). [resolve(13,a,4,b)].
% 0.44/1.01 14 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15_55) # label(axiom). [assumption].
% 0.44/1.01 Derived: age(sk2,A) != zero | -greater(age(sk2,B),sigma) | dissimilar(sk2,A,B). [resolve(14,a,2,a)].
% 0.44/1.01 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -has_endowment(A). [resolve(14,a,3,b)].
% 0.44/1.01 Derived: age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -dissimilar(A,D,E). [resolve(14,a,4,b)].
% 0.44/1.01 15 -organization(A) | age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) # label(assumption_15_56) # label(axiom). [assumption].
% 0.44/1.01 Derived: age(sk2,A) != zero | -dissimilar(sk2,A,B) | greater(age(sk2,B),sigma). [resolve(15,a,2,a)].
% 0.44/1.01 Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -has_endowment(A). [resolve(15,a,3,b)].
% 0.44/1.01 Derived: age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -dissimilar(A,D,E). [resolve(15,a,4,b)].
% 0.44/1.01 16 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low # label(assumption_17_58) # label(axiom). [assumption].
% 0.44/1.01 Derived: has_immunity(sk2,A) | -is_aligned(sk2,A) | -positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = low. [resolve(16,a,2,a)].
% 0.44/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -has_endowment(A). [resolve(16,a,3,b)].
% 0.44/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -dissimilar(A,C,D). [resolve(16,a,4,b)].
% 0.44/1.01 17 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17_59) # label(axiom). [assumption].
% 0.44/1.01 Derived: has_immunity(sk2,A) | is_aligned(sk2,A) | -positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = mod1. [resolve(17,a,2,a)].
% 0.44/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -has_endowment(A). [resolve(17,a,3,b)].
% 0.44/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -dissimilar(A,C,D). [resolve(17,a,4,b)].
% 0.44/1.01 18 -organization(A) | has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 # label(assumption_17_60) # label(axiom). [assumption].
% 0.44/1.01 Derived: has_immunity(sk2,A) | -is_aligned(sk2,A) | positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = mod2. [resolve(18,a,2,a)].
% 0.44/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -has_endowment(A). [resolve(18,a,3,b)].
% 0.44/1.01 Derived: has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -dissimilar(A,C,D). [resolve(18,a,4,b)].
% 0.44/1.01 19 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17_61) # label(axiom). [assumption].
% 0.44/1.01 Derived: has_immunity(sk2,A) | is_aligned(sk2,A) | positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = high. [resolve(19,a,2,a)].
% 0.44/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -has_endowment(A). [resolve(19,a,3,b)].
% 0.44/1.01 Derived: has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -dissimilar(A,C,D). [resolve(19,a,4,b)].
% 0.44/1.01 20 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1_42) # label(axiom). [assumption].
% 0.44/1.01 21 has_endowment(sk2) # label(theorem_11_69) # label(negated_conjecture). [assumption].
% 0.44/1.01 Derived: -greater(age(sk2,A),eta) | -has_immunity(sk2,A). [resolve(20,a,21,a)].
% 0.44/1.01 22 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1_41) # label(axiom). [assumption].
% 0.44/1.01 Derived: -smaller_or_equal(age(sk2,A),eta) | has_immunity(sk2,A). [resolve(22,a,21,a)].
% 0.44/1.01 23 age(A,B) != zero | is_aligned(A,B) | -has_endowment(A). [resolve(1,a,3,b)].
% 0.44/1.01 Derived: age(sk2,A) != zero | is_aligned(sk2,A). [resolve(23,c,21,a)].
% 0.44/1.01 24 -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low | -has_endowment(A). [resolve(5,a,3,b)].
% 0.44/1.01 Derived: -has_immunity(sk2,A) | hazard_of_mortality(sk2,A) = very_low. [resolve(24,c,21,a)].
% 0.44/1.01 25 -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,B,C) | -has_endowment(A). [resolve(8,a,3,b)].
% 0.44/1.01 Derived: -is_aligned(sk2,A) | is_aligned(sk2,B) | dissimilar(sk2,A,B). [resolve(25,d,21,a)].
% 0.44/1.01 26 -is_aligned(A,B) | is_aligned(A,C) | dissimilar(A,C,B) | -has_endowment(A). [resolve(9,a,3,b)].
% 0.44/1.01 Derived: -is_aligned(sk2,A) | is_aligned(sk2,B) | dissimilar(sk2,B,A). [resolve(26,d,21,a)].
% 0.44/1.01 27 smaller_or_equal(age(sk2,sk1(sk2)),eta) | has_immunity(sk2,sk1(sk2)) | has_endowment(sk2). [resolve(11,a,2,a)].
% 0.44/1.01 28 smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | has_endowment(A) | -dissimilar(A,B,C). [resolve(11,a,4,b)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | -dissimilar(A,B,C) | -greater(age(A,D),eta) | -has_immunity(A,D). [resolve(28,c,20,a)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | -dissimilar(A,B,C) | -smaller_or_equal(age(A,D),eta) | has_immunity(A,D). [resolve(28,c,22,a)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | -dissimilar(A,B,C) | age(A,D) != zero | is_aligned(A,D). [resolve(28,c,23,c)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | -dissimilar(A,B,C) | -has_immunity(A,D) | hazard_of_mortality(A,D) = very_low. [resolve(28,c,24,c)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | -dissimilar(A,B,C) | -is_aligned(A,D) | is_aligned(A,E) | dissimilar(A,D,E). [resolve(28,c,25,d)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | -dissimilar(A,B,C) | -is_aligned(A,D) | is_aligned(A,E) | dissimilar(A,E,D). [resolve(28,c,26,d)].
% 0.44/1.01 29 -has_immunity(sk2,sk1(sk2)) | greater(age(sk2,sk1(sk2)),eta) | has_endowment(sk2). [resolve(12,a,2,a)].
% 0.44/1.01 30 -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | has_endowment(A) | -dissimilar(A,B,C). [resolve(12,a,4,b)].
% 0.44/1.01 Derived: -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -greater(age(A,D),eta) | -has_immunity(A,D). [resolve(30,c,20,a)].
% 0.44/1.01 Derived: -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -smaller_or_equal(age(A,D),eta) | has_immunity(A,D). [resolve(30,c,22,a)].
% 0.44/1.01 Derived: -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | age(A,D) != zero | is_aligned(A,D). [resolve(30,c,23,c)].
% 0.44/1.01 Derived: -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -has_immunity(A,D) | hazard_of_mortality(A,D) = very_low. [resolve(30,c,24,c)].
% 0.44/1.01 Derived: -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -is_aligned(A,D) | is_aligned(A,E) | dissimilar(A,D,E). [resolve(30,c,25,d)].
% 0.44/1.01 Derived: -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -is_aligned(A,D) | is_aligned(A,E) | dissimilar(A,E,D). [resolve(30,c,26,d)].
% 0.44/1.01 31 smaller_or_equal(age(sk2,sk1(sk2)),eta) | greater(age(sk2,sk1(sk2)),eta) | has_endowment(sk2). [resolve(13,a,2,a)].
% 0.44/1.01 32 smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | has_endowment(A) | -dissimilar(A,B,C). [resolve(13,a,4,b)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -greater(age(A,D),eta) | -has_immunity(A,D). [resolve(32,c,20,a)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -smaller_or_equal(age(A,D),eta) | has_immunity(A,D). [resolve(32,c,22,a)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | age(A,D) != zero | is_aligned(A,D). [resolve(32,c,23,c)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -has_immunity(A,D) | hazard_of_mortality(A,D) = very_low. [resolve(32,c,24,c)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -is_aligned(A,D) | is_aligned(A,E) | dissimilar(A,D,E). [resolve(32,c,25,d)].
% 0.44/1.01 Derived: smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | -dissimilar(A,B,C) | -is_aligned(A,D) | is_aligned(A,E) | dissimilar(A,E,D). [resolve(32,c,26,d)].
% 0.44/1.01 33 age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) | -has_endowment(A). [resolve(14,a,3,b)].
% 0.44/1.01 Derived: age(sk2,A) != zero | -greater(age(sk2,B),sigma) | dissimilar(sk2,A,B). [resolve(33,d,21,a)].
% 0.44/1.01 34 age(A,B) != zero | -dissimilar(A,B,C) | greater(age(A,C),sigma) | -has_endowment(A). [resolve(15,a,3,b)].
% 0.44/1.01 35 has_immunity(A,B) | -is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = low | -has_endowment(A). [resolve(16,a,3,b)].
% 0.44/1.01 Derived: has_immunity(sk2,A) | -is_aligned(sk2,A) | -positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = low. [resolve(35,e,21,a)].
% 0.44/1.01 36 has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 | -has_endowment(A). [resolve(17,a,3,b)].
% 0.44/1.01 Derived: has_immunity(sk2,A) | is_aligned(sk2,A) | -positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = mod1. [resolve(36,e,21,a)].
% 0.44/1.01 37 has_immunity(A,B) | -is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = mod2 | -has_endowment(A). [resolve(18,a,3,b)].
% 0.44/1.01 Derived: has_immunity(sk2,A) | -is_aligned(sk2,A) | positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = mod2. [resolve(37,e,21,a)].
% 0.44/1.01 38 has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high | -has_endowment(A). [resolve(19,a,3,b)].
% 0.44/1.01 Derived: has_immunity(sk2,A) | is_aligned(sk2,A) | positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = high. [resolve(38,e,21,a)].
% 0.44/1.01 39 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.44/1.01 40 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.44/1.01 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(39,a,40,a)].
% 0.44/1.01 41 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.44/1.01 Derived: greater(A,B) | B = A | greater(B,A). [resolve(41,a,40,a)].
% 0.44/1.01 42 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.44/1.01 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(42,b,39,a)].
% 0.73/1.15 43 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.73/1.15 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(43,b,41,a)].
% 0.73/1.15 44 -greater_or_equal(A,B) | greater(A,B) | A = B # label(definition_greater_or_equal_4) # label(axiom). [assumption].
% 0.73/1.15 45 -greater(A,B) | greater_or_equal(A,B) # label(definition_greater_or_equal_5) # label(axiom). [assumption].
% 0.73/1.15 46 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.73/1.15
% 0.73/1.15 ============================== end predicate elimination =============
% 0.73/1.15
% 0.73/1.15 Auto_denials: (non-Horn, no changes).
% 0.73/1.15
% 0.73/1.15 Term ordering decisions:
% 0.73/1.15
% 0.73/1.15 % Assigning unary symbol sk1 kb_weight 0 and highest precedence (23).
% 0.73/1.15 Function symbol KB weights: sk2=1. eta=1. zero=1. sigma=1. very_low=1. low=1. high=1. mod1=1. mod2=1. sk4=1. sk5=1. tau=1. sk3=1. age=1. hazard_of_mortality=1. sk1=0.
% 0.73/1.15
% 0.73/1.15 ============================== end of process initial clauses ========
% 0.73/1.15
% 0.73/1.15 ============================== CLAUSES FOR SEARCH ====================
% 0.73/1.15
% 0.73/1.15 ============================== end of clauses for search =============
% 0.73/1.15
% 0.73/1.15 ============================== SEARCH ================================
% 0.73/1.15
% 0.73/1.15 % Starting search at 0.02 seconds.
% 0.73/1.15
% 0.73/1.15 ============================== PROOF =================================
% 0.73/1.15 % SZS status Unsatisfiable
% 0.73/1.15 % SZS output start Refutation
% 0.73/1.15
% 0.73/1.15 % Proof 1 at 0.15 (+ 0.01) seconds.
% 0.73/1.15 % Length of proof is 69.
% 0.73/1.15 % Level of proof is 9.
% 0.73/1.15 % Maximum clause weight is 16.000.
% 0.73/1.15 % Given clauses 264.
% 0.73/1.15
% 0.73/1.15 1 -organization(A) | age(A,B) != zero | is_aligned(A,B) # label(assumption_13_54) # label(axiom). [assumption].
% 0.73/1.15 2 organization(sk2) # label(theorem_11_67) # label(negated_conjecture). [assumption].
% 0.73/1.15 5 -organization(A) | -has_immunity(A,B) | hazard_of_mortality(A,B) = very_low # label(assumption_17_57) # label(axiom). [assumption].
% 0.73/1.15 14 -organization(A) | age(A,B) != zero | -greater(age(A,C),sigma) | dissimilar(A,B,C) # label(assumption_15_55) # label(axiom). [assumption].
% 0.73/1.15 17 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | -positional_advantage(A,B) | hazard_of_mortality(A,B) = mod1 # label(assumption_17_59) # label(axiom). [assumption].
% 0.73/1.15 19 -organization(A) | has_immunity(A,B) | is_aligned(A,B) | positional_advantage(A,B) | hazard_of_mortality(A,B) = high # label(assumption_17_61) # label(axiom). [assumption].
% 0.73/1.15 20 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1_42) # label(axiom). [assumption].
% 0.73/1.15 21 has_endowment(sk2) # label(theorem_11_69) # label(negated_conjecture). [assumption].
% 0.73/1.15 22 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1_41) # label(axiom). [assumption].
% 0.73/1.15 39 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.73/1.15 40 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.73/1.15 41 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.73/1.15 42 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.73/1.15 47 greater(high,mod1) # label(assumption_18a_62) # label(axiom). [assumption].
% 0.73/1.15 48 greater(mod1,low) # label(assumption_18b_63) # label(axiom). [assumption].
% 0.73/1.15 49 greater(low,very_low) # label(assumption_18c_64) # label(axiom). [assumption].
% 0.73/1.15 50 greater(high,mod2) # label(assumption_18d_65) # label(axiom). [assumption].
% 0.73/1.15 51 greater(mod2,low) # label(assumption_18e_66) # label(axiom). [assumption].
% 0.73/1.15 54 greater(eta,zero) # label(theorem_11_73) # label(negated_conjecture). [assumption].
% 0.73/1.15 55 age(sk2,sk3) = zero # label(theorem_11_70) # label(negated_conjecture). [assumption].
% 0.73/1.15 58 smaller_or_equal(age(sk2,sk4),eta) # label(theorem_11_76) # label(negated_conjecture). [assumption].
% 0.73/1.15 59 greater(age(sk2,sk5),sigma) # label(theorem_11_77) # label(negated_conjecture). [assumption].
% 0.73/1.15 61 greater(age(sk2,sk5),eta) # label(theorem_11_79) # label(negated_conjecture). [assumption].
% 0.73/1.15 62 -greater(A,B) | -greater(B,A) # label(meaning_postulate_greater_strict_9) # label(axiom). [assumption].
% 0.73/1.15 63 -dissimilar(A,B,C) | -is_aligned(A,B) | -is_aligned(A,C) # label(definition_2_49) # label(axiom). [assumption].
% 0.73/1.15 64 -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) | hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3) # label(theorem_11_80) # label(negated_conjecture). [assumption].
% 0.73/1.15 65 -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) | hazard_of_mortality(sk2,sk3) != hazard_of_mortality(sk2,sk4). [copy(64),flip(b)].
% 0.73/1.15 67 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive_10) # label(axiom). [assumption].
% 0.73/1.15 69 age(sk2,A) != zero | is_aligned(sk2,A). [resolve(1,a,2,a)].
% 0.73/1.15 71 -has_immunity(sk2,A) | hazard_of_mortality(sk2,A) = very_low. [resolve(5,a,2,a)].
% 0.73/1.15 77 age(sk2,A) != zero | -greater(age(sk2,B),sigma) | dissimilar(sk2,A,B). [resolve(14,a,2,a)].
% 0.73/1.15 83 has_immunity(sk2,A) | is_aligned(sk2,A) | -positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = mod1. [resolve(17,a,2,a)].
% 0.73/1.15 87 has_immunity(sk2,A) | is_aligned(sk2,A) | positional_advantage(sk2,A) | hazard_of_mortality(sk2,A) = high. [resolve(19,a,2,a)].
% 0.73/1.15 89 -greater(age(sk2,A),eta) | -has_immunity(sk2,A). [resolve(20,a,21,a)].
% 0.73/1.15 90 -smaller_or_equal(age(sk2,A),eta) | has_immunity(sk2,A). [resolve(22,a,21,a)].
% 0.73/1.15 98 greater(A,B) | B = A | greater(B,A). [resolve(41,a,40,a)].
% 0.73/1.15 99 -greater(A,B) | smaller_or_equal(B,A). [resolve(42,b,39,a)].
% 0.73/1.15 101 -greater(A,A). [factor(62,a,b)].
% 0.73/1.15 115 -greater(mod1,high). [resolve(62,a,47,a)].
% 0.73/1.15 125 -greater(mod2,A) | greater(high,A). [resolve(67,a,50,a)].
% 0.73/1.15 127 -greater(low,A) | greater(mod1,A). [resolve(67,a,48,a)].
% 0.73/1.15 140 is_aligned(sk2,sk3). [resolve(69,a,55,a)].
% 0.73/1.15 141 age(sk2,A) != zero | dissimilar(sk2,A,sk5). [resolve(77,b,59,a)].
% 0.73/1.15 142 has_immunity(sk2,A) | is_aligned(sk2,A) | hazard_of_mortality(sk2,A) = high | hazard_of_mortality(sk2,A) = mod1. [resolve(87,c,83,c),merge(d),merge(e)].
% 0.73/1.15 143 -has_immunity(sk2,sk5). [ur(89,a,61,a)].
% 0.73/1.15 144 has_immunity(sk2,sk4). [resolve(90,a,58,a)].
% 0.73/1.15 145 -smaller_or_equal(zero,eta) | has_immunity(sk2,sk3). [para(55(a,1),90(a,1))].
% 0.73/1.15 157 smaller_or_equal(zero,eta). [resolve(99,a,54,a)].
% 0.73/1.15 165 has_immunity(sk2,sk3). [back_unit_del(145),unit_del(a,157)].
% 0.73/1.15 176 hazard_of_mortality(sk2,sk4) = very_low. [resolve(144,a,71,a)].
% 0.73/1.15 178 -greater(hazard_of_mortality(sk2,sk5),very_low) | hazard_of_mortality(sk2,sk3) != very_low. [back_rewrite(65),rewrite([176(6),176(11)])].
% 0.73/1.15 185 hazard_of_mortality(sk2,sk3) = very_low. [resolve(165,a,71,a)].
% 0.73/1.15 186 -greater(hazard_of_mortality(sk2,sk5),very_low). [back_rewrite(178),rewrite([185(8)]),xx(b)].
% 0.73/1.15 194 -greater(hazard_of_mortality(sk2,sk5),low). [ur(67,b,49,a,c,186,a)].
% 0.73/1.15 217 greater(high,low). [resolve(125,a,51,a)].
% 0.73/1.15 223 -greater(low,A) | greater(high,A). [resolve(217,a,67,a)].
% 0.73/1.15 226 greater(mod1,very_low). [resolve(127,a,49,a)].
% 0.73/1.15 229 -greater(very_low,A) | greater(mod1,A). [resolve(226,a,67,a)].
% 0.73/1.15 247 greater(high,A) | greater(A,low) | low = A. [resolve(223,a,98,c)].
% 0.73/1.15 249 greater(mod1,A) | greater(A,very_low) | very_low = A. [resolve(229,a,98,c)].
% 0.73/1.15 250 dissimilar(sk2,sk3,sk5). [resolve(141,a,55,a)].
% 0.73/1.15 251 -is_aligned(sk2,sk5). [resolve(250,a,63,a),unit_del(a,140)].
% 0.73/1.15 254 hazard_of_mortality(sk2,sk5) = high | hazard_of_mortality(sk2,sk5) = mod1. [resolve(142,a,143,a),unit_del(a,251)].
% 0.73/1.15 783 greater(high,hazard_of_mortality(sk2,sk5)) | hazard_of_mortality(sk2,sk5) = low. [resolve(247,b,194,a),flip(b)].
% 0.73/1.15 823 greater(mod1,hazard_of_mortality(sk2,sk5)) | hazard_of_mortality(sk2,sk5) = very_low. [resolve(249,b,186,a),flip(b)].
% 0.73/1.15 1268 hazard_of_mortality(sk2,sk5) = high. [para(254(b,1),186(a,1)),unit_del(b,226)].
% 0.73/1.15 1289 high = very_low. [back_rewrite(823),rewrite([1268(4),1268(6)]),unit_del(a,115)].
% 0.73/1.15 1290 low = very_low. [back_rewrite(783),rewrite([1289(1),1268(4),1289(2),1268(6),1289(4)]),flip(b),unit_del(a,101)].
% 0.73/1.15 1318 $F. [back_rewrite(217),rewrite([1289(1),1290(2)]),unit_del(a,101)].
% 0.73/1.15
% 0.73/1.15 % SZS output end Refutation
% 0.73/1.15 ============================== end of proof ==========================
% 0.73/1.15
% 0.73/1.15 ============================== STATISTICS ============================
% 0.73/1.15
% 0.73/1.15 Given=264. Generated=4131. Kept=1270. proofs=1.
% 0.73/1.15 Usable=214. Sos=563. Demods=8. Limbo=29, Disabled=585. Hints=0.
% 0.73/1.15 Megabytes=1.28.
% 0.73/1.15 User_CPU=0.15, System_CPU=0.01, Wall_clock=1.
% 0.73/1.15
% 0.73/1.15 ============================== end of statistics =====================
% 0.73/1.15
% 0.73/1.15 ============================== end of search =========================
% 0.73/1.15
% 0.73/1.15 THEOREM PROVED
% 0.73/1.15 % SZS status Unsatisfiable
% 0.73/1.15
% 0.73/1.15 Exiting with 1 proof.
% 0.73/1.15
% 0.73/1.15 Process 16259 exit (max_proofs) Thu Jun 9 08:06:39 2022
% 0.73/1.15 Prover9 interrupted
%------------------------------------------------------------------------------