TSTP Solution File: MGT051+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : MGT051+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n028.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:07 EDT 2022

% Result   : Theorem 0.45s 1.03s
% Output   : Refutation 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : MGT051+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n028.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:52:32 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.45/1.01  ============================== Prover9 ===============================
% 0.45/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.45/1.01  Process 9744 was started by sandbox2 on n028.cluster.edu,
% 0.45/1.01  Thu Jun  9 08:52:33 2022
% 0.45/1.01  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_9591_n028.cluster.edu".
% 0.45/1.01  ============================== end of head ===========================
% 0.45/1.01  
% 0.45/1.01  ============================== INPUT =================================
% 0.45/1.01  
% 0.45/1.01  % Reading from file /tmp/Prover9_9591_n028.cluster.edu
% 0.45/1.01  
% 0.45/1.01  set(prolog_style_variables).
% 0.45/1.01  set(auto2).
% 0.45/1.01      % set(auto2) -> set(auto).
% 0.45/1.01      % set(auto) -> set(auto_inference).
% 0.45/1.01      % set(auto) -> set(auto_setup).
% 0.45/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.45/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/1.01      % set(auto) -> set(auto_limits).
% 0.45/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/1.01      % set(auto) -> set(auto_denials).
% 0.45/1.01      % set(auto) -> set(auto_process).
% 0.45/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.45/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.45/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.45/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.45/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.45/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.45/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.45/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.45/1.01      % set(auto2) -> assign(stats, some).
% 0.45/1.01      % set(auto2) -> clear(echo_input).
% 0.45/1.01      % set(auto2) -> set(quiet).
% 0.45/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.45/1.01      % set(auto2) -> clear(print_given).
% 0.45/1.01  assign(lrs_ticks,-1).
% 0.45/1.01  assign(sos_limit,10000).
% 0.45/1.01  assign(order,kbo).
% 0.45/1.01  set(lex_order_vars).
% 0.45/1.01  clear(print_given).
% 0.45/1.01  
% 0.45/1.01  % formulas(sos).  % not echoed (16 formulas)
% 0.45/1.01  
% 0.45/1.01  ============================== end of input ==========================
% 0.45/1.01  
% 0.45/1.01  % From the command line: assign(max_seconds, 300).
% 0.45/1.01  
% 0.45/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/1.01  
% 0.45/1.01  % Formulas that are not ordinary clauses:
% 0.45/1.01  1 (all X all Y (smaller_or_equal(X,Y) <-> smaller(X,Y) | X = Y)) # label(definition_smaller_or_equal) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  2 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(definition_greater_or_equal) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  5 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(meaning_postulate_greater_transitive) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  6 (all X all Y (smaller(X,Y) | X = Y | greater(X,Y))) # label(meaning_postulate_greater_comparable) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  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.45/1.01  8 (all X all T0 all T (organization(X) & has_immunity(X,T0) & has_immunity(X,T) -> hazard_of_mortality(X,T0) = hazard_of_mortality(X,T))) # label(assumption_2) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  9 (all X all T0 all T (organization(X) & has_immunity(X,T0) & -has_immunity(X,T) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(assumption_3) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  10 (all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) -> (greater(capability(X,T),capability(X,T0)) & greater_or_equal(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (greater_or_equal(capability(X,T),capability(X,T0)) & greater(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (capability(X,T) = capability(X,T0) & position(X,T) = position(X,T0) -> hazard_of_mortality(X,T) = hazard_of_mortality(X,T0)))) # label(assumption_4) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  11 (all X all T0 all T (organization(X) -> (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> greater(capability(X,T),capability(X,T0))) & (smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & greater(internal_friction(X,T),internal_friction(X,T0)) -> smaller(capability(X,T),capability(X,T0))) & (stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & internal_friction(X,T) = internal_friction(X,T0) -> capability(X,T) = capability(X,T0)))) # label(assumption_5) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  12 (all X all T0 all T (organization(X) -> (greater(external_ties(X,T),external_ties(X,T0)) -> greater(position(X,T),position(X,T0))) & (external_ties(X,T) = external_ties(X,T0) -> position(X,T) = position(X,T0)))) # label(assumption_6) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  13 (all X all T0 all T (organization(X) -> stock_of_knowledge(X,T) = stock_of_knowledge(X,T0))) # label(assumption_10) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  14 (all X all T0 all T (organization(X) -> external_ties(X,T) = external_ties(X,T0))) # label(assumption_11) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  15 (all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(internal_friction(X,T),internal_friction(X,T0)))) # label(assumption_12) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.01  16 -(all X all T0 all T1 all T2 all T3 (organization(X) & has_endowment(X) & smaller_or_equal(age(X,T0),age(X,T1)) & smaller_or_equal(age(X,T1),eta) & greater(age(X,T2),eta) & greater(age(X,T3),age(X,T2)) -> greater(hazard_of_mortality(X,T3),hazard_of_mortality(X,T2)) & greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_4) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.45/1.01  
% 0.45/1.01  ============================== end of process non-clausal formulas ===
% 0.45/1.01  
% 0.45/1.01  ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/1.01  
% 0.45/1.01  ============================== PREDICATE ELIMINATION =================
% 0.45/1.01  17 -organization(A) | stock_of_knowledge(A,B) = stock_of_knowledge(A,C) # label(assumption_10) # label(axiom).  [clausify(13)].
% 0.45/1.01  18 organization(c1) # label(theorem_4) # label(negated_conjecture).  [clausify(16)].
% 0.45/1.01  19 -has_endowment(A) | organization(A) # label(definition_1) # label(axiom).  [clausify(7)].
% 0.45/1.01  Derived: stock_of_knowledge(c1,A) = stock_of_knowledge(c1,B).  [resolve(17,a,18,a)].
% 0.45/1.01  Derived: stock_of_knowledge(A,B) = stock_of_knowledge(A,C) | -has_endowment(A).  [resolve(17,a,19,b)].
% 0.45/1.01  20 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11) # label(axiom).  [clausify(14)].
% 0.45/1.01  Derived: external_ties(c1,A) = external_ties(c1,B).  [resolve(20,a,18,a)].
% 0.45/1.01  Derived: external_ties(A,B) = external_ties(A,C) | -has_endowment(A).  [resolve(20,a,19,b)].
% 0.45/1.01  21 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.45/1.01  Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)).  [resolve(21,b,18,a)].
% 0.45/1.01  22 has_endowment(A) | -organization(A) | -has_immunity(A,f1(A)) | greater(age(A,f1(A)),eta) # label(definition_1) # label(axiom).  [clausify(7)].
% 0.45/1.01  Derived: has_endowment(c1) | -has_immunity(c1,f1(c1)) | greater(age(c1,f1(c1)),eta).  [resolve(22,b,18,a)].
% 0.45/1.01  23 -organization(A) | -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) # label(assumption_2) # label(axiom).  [clausify(8)].
% 0.45/1.01  Derived: -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B).  [resolve(23,a,18,a)].
% 0.45/1.01  Derived: -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A).  [resolve(23,a,19,b)].
% 0.45/1.01  24 -organization(A) | -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_3) # label(axiom).  [clausify(9)].
% 0.45/1.01  Derived: -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(24,a,18,a)].
% 0.45/1.01  Derived: -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A).  [resolve(24,a,19,b)].
% 0.45/1.01  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.45/1.01  Derived: has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta).  [resolve(25,b,18,a)].
% 0.45/1.01  26 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6) # label(axiom).  [clausify(12)].
% 0.45/1.01  Derived: -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)).  [resolve(26,a,18,a)].
% 0.45/1.01  Derived: -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) | -has_endowment(A).  [resolve(26,a,19,b)].
% 0.45/1.01  27 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom).  [clausify(12)].
% 0.45/1.01  Derived: external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B).  [resolve(27,a,18,a)].
% 0.45/1.01  Derived: external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) | -has_endowment(A).  [resolve(27,a,19,b)].
% 0.45/1.01  28 -organization(A) | -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) # label(assumption_12) # label(axiom).  [clausify(15)].
% 0.45/1.01  Derived: -greater(age(c1,A),age(c1,B)) | greater(internal_friction(c1,A),internal_friction(c1,B)).  [resolve(28,a,18,a)].
% 0.45/1.01  Derived: -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) | -has_endowment(A).  [resolve(28,a,19,b)].
% 0.45/1.01  29 -organization(A) | -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -smaller_or_equal(internal_friction(A,B),internal_friction(A,C)) | greater(capability(A,B),capability(A,C)) # label(assumption_5) # label(axiom).  [clausify(11)].
% 0.45/1.01  Derived: -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -smaller_or_equal(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,A),capability(c1,B)).  [resolve(29,a,18,a)].
% 0.45/1.01  Derived: -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -smaller_or_equal(internal_friction(A,B),internal_friction(A,C)) | greater(capability(A,B),capability(A,C)) | -has_endowment(A).  [resolve(29,a,19,b)].
% 0.45/1.01  30 -organization(A) | -smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -greater(internal_friction(A,B),internal_friction(A,C)) | smaller(capability(A,B),capability(A,C)) # label(assumption_5) # label(axiom).  [clausify(11)].
% 0.45/1.01  Derived: -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller(capability(c1,A),capability(c1,B)).  [resolve(30,a,18,a)].
% 0.45/1.01  Derived: -smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -greater(internal_friction(A,B),internal_friction(A,C)) | smaller(capability(A,B),capability(A,C)) | -has_endowment(A).  [resolve(30,a,19,b)].
% 0.45/1.01  31 -organization(A) | stock_of_knowledge(A,B) != stock_of_knowledge(A,C) | internal_friction(A,B) != internal_friction(A,C) | capability(A,B) = capability(A,C) # label(assumption_5) # label(axiom).  [clausify(11)].
% 0.45/1.01  Derived: stock_of_knowledge(c1,A) != stock_of_knowledge(c1,B) | internal_friction(c1,A) != internal_friction(c1,B) | capability(c1,A) = capability(c1,B).  [resolve(31,a,18,a)].
% 0.45/1.01  Derived: stock_of_knowledge(A,B) != stock_of_knowledge(A,C) | internal_friction(A,B) != internal_friction(A,C) | capability(A,B) = capability(A,C) | -has_endowment(A).  [resolve(31,a,19,b)].
% 0.45/1.01  32 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | -greater_or_equal(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4) # label(axiom).  [clausify(10)].
% 0.45/1.01  Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(32,a,18,a)].
% 0.45/1.01  Derived: has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | -greater_or_equal(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A).  [resolve(32,a,19,b)].
% 0.45/1.01  33 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater_or_equal(capability(A,C),capability(A,B)) | -greater(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4) # label(axiom).  [clausify(10)].
% 0.45/1.01  Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(capability(c1,B),capability(c1,A)) | -greater(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(33,a,18,a)].
% 0.45/1.01  Derived: has_immunity(A,B) | has_immunity(A,C) | -greater_or_equal(capability(A,C),capability(A,B)) | -greater(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A).  [resolve(33,a,19,b)].
% 0.45/1.01  34 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | capability(A,B) != capability(A,C) | position(A,B) != position(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) # label(assumption_4) # label(axiom).  [clausify(10)].
% 0.45/1.01  Derived: has_immunity(c1,A) | has_immunity(c1,B) | capability(c1,A) != capability(c1,B) | position(c1,A) != position(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B).  [resolve(34,a,18,a)].
% 0.45/1.01  Derived: has_immunity(A,B) | has_immunity(A,C) | capability(A,B) != capability(A,C) | position(A,B) != position(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A).  [resolve(34,a,19,b)].
% 0.45/1.01  35 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1) # label(axiom).  [clausify(7)].
% 0.45/1.01  36 has_endowment(c1) # label(theorem_4) # label(negated_conjecture).  [clausify(16)].
% 0.45/1.01  Derived: -greater(age(c1,A),eta) | -has_immunity(c1,A).  [resolve(35,a,36,a)].
% 0.45/1.01  37 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1) # label(axiom).  [clausify(7)].
% 0.45/1.01  Derived: -smaller_or_equal(age(c1,A),eta) | has_immunity(c1,A).  [resolve(37,a,36,a)].
% 0.45/1.01  38 stock_of_knowledge(A,B) = stock_of_knowledge(A,C) | -has_endowment(A).  [resolve(17,a,19,b)].
% 0.45/1.01  Derived: stock_of_knowledge(c1,A) = stock_of_knowledge(c1,B).  [resolve(38,b,36,a)].
% 0.45/1.01  39 external_ties(A,B) = external_ties(A,C) | -has_endowment(A).  [resolve(20,a,19,b)].
% 0.45/1.01  Derived: external_ties(c1,A) = external_ties(c1,B).  [resolve(39,b,36,a)].
% 0.45/1.01  40 has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | has_immunity(c1,f1(c1)).  [resolve(21,b,18,a)].
% 0.45/1.01  41 has_endowment(c1) | -has_immunity(c1,f1(c1)) | greater(age(c1,f1(c1)),eta).  [resolve(22,b,18,a)].
% 0.45/1.01  42 -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A).  [resolve(23,a,19,b)].
% 0.45/1.01  Derived: -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B).  [resolve(42,d,36,a)].
% 0.45/1.01  43 -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A).  [resolve(24,a,19,b)].
% 0.45/1.01  Derived: -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(43,d,36,a)].
% 0.45/1.01  44 has_endowment(c1) | smaller_or_equal(age(c1,f1(c1)),eta) | greater(age(c1,f1(c1)),eta).  [resolve(25,b,18,a)].
% 0.45/1.01  45 -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) | -has_endowment(A).  [resolve(26,a,19,b)].
% 0.45/1.01  Derived: -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)).  [resolve(45,c,36,a)].
% 0.45/1.01  46 external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) | -has_endowment(A).  [resolve(27,a,19,b)].
% 0.45/1.01  Derived: external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B).  [resolve(46,c,36,a)].
% 0.45/1.02  47 -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) | -has_endowment(A).  [resolve(28,a,19,b)].
% 0.45/1.02  Derived: -greater(age(c1,A),age(c1,B)) | greater(internal_friction(c1,A),internal_friction(c1,B)).  [resolve(47,c,36,a)].
% 0.45/1.02  48 -greater(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -smaller_or_equal(internal_friction(A,B),internal_friction(A,C)) | greater(capability(A,B),capability(A,C)) | -has_endowment(A).  [resolve(29,a,19,b)].
% 0.45/1.02  Derived: -greater(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -smaller_or_equal(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,A),capability(c1,B)).  [resolve(48,d,36,a)].
% 0.45/1.02  49 -smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -greater(internal_friction(A,B),internal_friction(A,C)) | smaller(capability(A,B),capability(A,C)) | -has_endowment(A).  [resolve(30,a,19,b)].
% 0.45/1.02  Derived: -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller(capability(c1,A),capability(c1,B)).  [resolve(49,d,36,a)].
% 0.45/1.02  50 stock_of_knowledge(A,B) != stock_of_knowledge(A,C) | internal_friction(A,B) != internal_friction(A,C) | capability(A,B) = capability(A,C) | -has_endowment(A).  [resolve(31,a,19,b)].
% 0.45/1.02  Derived: stock_of_knowledge(c1,A) != stock_of_knowledge(c1,B) | internal_friction(c1,A) != internal_friction(c1,B) | capability(c1,A) = capability(c1,B).  [resolve(50,d,36,a)].
% 0.45/1.02  51 has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | -greater_or_equal(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A).  [resolve(32,a,19,b)].
% 0.45/1.02  Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(51,f,36,a)].
% 0.45/1.02  52 has_immunity(A,B) | has_immunity(A,C) | -greater_or_equal(capability(A,C),capability(A,B)) | -greater(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A).  [resolve(33,a,19,b)].
% 0.45/1.02  Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(capability(c1,B),capability(c1,A)) | -greater(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(52,f,36,a)].
% 0.45/1.02  53 has_immunity(A,B) | has_immunity(A,C) | capability(A,B) != capability(A,C) | position(A,B) != position(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A).  [resolve(34,a,19,b)].
% 0.45/1.02  Derived: has_immunity(c1,A) | has_immunity(c1,B) | capability(c1,A) != capability(c1,B) | position(c1,A) != position(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B).  [resolve(53,f,36,a)].
% 0.45/1.02  54 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
% 0.45/1.02  55 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(6)].
% 0.45/1.02  Derived: smaller_or_equal(A,B) | B = A | greater(A,B).  [resolve(54,b,55,a)].
% 0.45/1.02  56 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(3)].
% 0.45/1.02  Derived: greater(A,B) | A = B | greater(B,A).  [resolve(56,a,55,a)].
% 0.45/1.02  57 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(3)].
% 0.45/1.02  Derived: -greater(A,B) | smaller_or_equal(B,A).  [resolve(57,a,54,b)].
% 0.45/1.02  58 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
% 0.45/1.02  Derived: -smaller_or_equal(A,B) | B = A | greater(B,A).  [resolve(58,b,56,a)].
% 0.45/1.02  59 -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller(capability(c1,A),capability(c1,B)).  [resolve(30,a,18,a)].
% 0.45/1.02  Derived: -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller_or_equal(capability(c1,A),capability(c1,B)).  [resolve(59,c,54,b)].
% 0.45/1.03  Derived: -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,B),capability(c1,A)).  [resolve(59,c,56,a)].
% 0.45/1.03  60 has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(32,a,18,a)].
% 0.45/1.03  Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller_or_equal(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(60,e,54,b)].
% 0.45/1.03  Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)).  [resolve(60,e,56,a)].
% 0.45/1.03  61 has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(capability(c1,B),capability(c1,A)) | -greater(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(33,a,18,a)].
% 0.45/1.03  Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(capability(c1,B),capability(c1,A)) | -greater(position(c1,B),position(c1,A)) | smaller_or_equal(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(61,e,54,b)].
% 0.45/1.03  Derived: has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(capability(c1,B),capability(c1,A)) | -greater(position(c1,B),position(c1,A)) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)).  [resolve(61,e,56,a)].
% 0.45/1.03  62 -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller(capability(c1,A),capability(c1,B)).  [resolve(49,d,36,a)].
% 0.45/1.03  63 has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(51,f,36,a)].
% 0.45/1.03  64 has_immunity(c1,A) | has_immunity(c1,B) | -greater_or_equal(capability(c1,B),capability(c1,A)) | -greater(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(52,f,36,a)].
% 0.45/1.03  
% 0.45/1.03  ============================== end predicate elimination =============
% 0.45/1.03  
% 0.45/1.03  Auto_denials:  (non-Horn, no changes).
% 0.45/1.03  
% 0.45/1.03  Term ordering decisions:
% 0.45/1.03  Function symbol KB weights:  eta=1. c1=1. c2=1. c3=1. c4=1. c5=1. capability=1. hazard_of_mortality=1. position=1. internal_friction=1. stock_of_knowledge=1. external_ties=1. age=1.
% 0.45/1.03  
% 0.45/1.03  ============================== end of process initial clauses ========
% 0.45/1.03  
% 0.45/1.03  ============================== CLAUSES FOR SEARCH ====================
% 0.45/1.03  
% 0.45/1.03  ============================== end of clauses for search =============
% 0.45/1.03  
% 0.45/1.03  ============================== SEARCH ================================
% 0.45/1.03  
% 0.45/1.03  % Starting search at 0.02 seconds.
% 0.45/1.03  
% 0.45/1.03  ============================== PROOF =================================
% 0.45/1.03  % SZS status Theorem
% 0.45/1.03  % SZS output start Refutation
% 0.45/1.03  
% 0.45/1.03  % Proof 1 at 0.03 (+ 0.01) seconds.
% 0.45/1.03  % Length of proof is 85.
% 0.45/1.03  % Level of proof is 15.
% 0.45/1.03  % Maximum clause weight is 27.000.
% 0.45/1.03  % Given clauses 86.
% 0.45/1.03  
% 0.45/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.45/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.45/1.03  3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause).  [assumption].
% 0.45/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.45/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.45/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.45/1.03  8 (all X all T0 all T (organization(X) & has_immunity(X,T0) & has_immunity(X,T) -> hazard_of_mortality(X,T0) = hazard_of_mortality(X,T))) # label(assumption_2) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  9 (all X all T0 all T (organization(X) & has_immunity(X,T0) & -has_immunity(X,T) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(assumption_3) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  10 (all X all T0 all T (organization(X) & -has_immunity(X,T0) & -has_immunity(X,T) -> (greater(capability(X,T),capability(X,T0)) & greater_or_equal(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (greater_or_equal(capability(X,T),capability(X,T0)) & greater(position(X,T),position(X,T0)) -> smaller(hazard_of_mortality(X,T),hazard_of_mortality(X,T0))) & (capability(X,T) = capability(X,T0) & position(X,T) = position(X,T0) -> hazard_of_mortality(X,T) = hazard_of_mortality(X,T0)))) # label(assumption_4) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  11 (all X all T0 all T (organization(X) -> (greater(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & smaller_or_equal(internal_friction(X,T),internal_friction(X,T0)) -> greater(capability(X,T),capability(X,T0))) & (smaller_or_equal(stock_of_knowledge(X,T),stock_of_knowledge(X,T0)) & greater(internal_friction(X,T),internal_friction(X,T0)) -> smaller(capability(X,T),capability(X,T0))) & (stock_of_knowledge(X,T) = stock_of_knowledge(X,T0) & internal_friction(X,T) = internal_friction(X,T0) -> capability(X,T) = capability(X,T0)))) # label(assumption_5) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  12 (all X all T0 all T (organization(X) -> (greater(external_ties(X,T),external_ties(X,T0)) -> greater(position(X,T),position(X,T0))) & (external_ties(X,T) = external_ties(X,T0) -> position(X,T) = position(X,T0)))) # label(assumption_6) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  13 (all X all T0 all T (organization(X) -> stock_of_knowledge(X,T) = stock_of_knowledge(X,T0))) # label(assumption_10) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  14 (all X all T0 all T (organization(X) -> external_ties(X,T) = external_ties(X,T0))) # label(assumption_11) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  15 (all X all T0 all T (organization(X) & greater(age(X,T),age(X,T0)) -> greater(internal_friction(X,T),internal_friction(X,T0)))) # label(assumption_12) # label(axiom) # label(non_clause).  [assumption].
% 0.45/1.03  16 -(all X all T0 all T1 all T2 all T3 (organization(X) & has_endowment(X) & smaller_or_equal(age(X,T0),age(X,T1)) & smaller_or_equal(age(X,T1),eta) & greater(age(X,T2),eta) & greater(age(X,T3),age(X,T2)) -> greater(hazard_of_mortality(X,T3),hazard_of_mortality(X,T2)) & greater(hazard_of_mortality(X,T2),hazard_of_mortality(X,T1)) & hazard_of_mortality(X,T1) = hazard_of_mortality(X,T0))) # label(theorem_4) # label(negated_conjecture) # label(non_clause).  [assumption].
% 0.45/1.03  17 -organization(A) | stock_of_knowledge(A,B) = stock_of_knowledge(A,C) # label(assumption_10) # label(axiom).  [clausify(13)].
% 0.45/1.03  18 organization(c1) # label(theorem_4) # label(negated_conjecture).  [clausify(16)].
% 0.45/1.03  20 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11) # label(axiom).  [clausify(14)].
% 0.45/1.03  23 -organization(A) | -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) # label(assumption_2) # label(axiom).  [clausify(8)].
% 0.45/1.03  24 -organization(A) | -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_3) # label(axiom).  [clausify(9)].
% 0.45/1.03  27 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom).  [clausify(12)].
% 0.45/1.03  28 -organization(A) | -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) # label(assumption_12) # label(axiom).  [clausify(15)].
% 0.45/1.03  30 -organization(A) | -smaller_or_equal(stock_of_knowledge(A,B),stock_of_knowledge(A,C)) | -greater(internal_friction(A,B),internal_friction(A,C)) | smaller(capability(A,B),capability(A,C)) # label(assumption_5) # label(axiom).  [clausify(11)].
% 0.45/1.03  32 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | -greater(capability(A,C),capability(A,B)) | -greater_or_equal(position(A,C),position(A,B)) | smaller(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_4) # label(axiom).  [clausify(10)].
% 0.45/1.03  35 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1) # label(axiom).  [clausify(7)].
% 0.45/1.03  36 has_endowment(c1) # label(theorem_4) # label(negated_conjecture).  [clausify(16)].
% 0.45/1.03  37 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1) # label(axiom).  [clausify(7)].
% 0.45/1.03  54 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
% 0.45/1.03  55 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom).  [clausify(6)].
% 0.45/1.03  56 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(3)].
% 0.45/1.03  57 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom).  [clausify(3)].
% 0.45/1.03  58 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
% 0.45/1.03  59 -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | smaller(capability(c1,A),capability(c1,B)).  [resolve(30,a,18,a)].
% 0.45/1.03  60 has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | smaller(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(32,a,18,a)].
% 0.45/1.03  65 smaller_or_equal(age(c1,c3),eta) # label(theorem_4) # label(negated_conjecture).  [clausify(16)].
% 0.45/1.03  66 greater(age(c1,c4),eta) # label(theorem_4) # label(negated_conjecture).  [clausify(16)].
% 0.45/1.03  67 smaller_or_equal(age(c1,c2),age(c1,c3)) # label(theorem_4) # label(negated_conjecture).  [clausify(16)].
% 0.45/1.03  68 greater(age(c1,c5),age(c1,c4)) # label(theorem_4) # label(negated_conjecture).  [clausify(16)].
% 0.45/1.03  70 -greater(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c4)) | -greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2) # label(theorem_4) # label(negated_conjecture).  [clausify(16)].
% 0.45/1.03  71 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom).  [clausify(1)].
% 0.45/1.03  73 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom).  [clausify(2)].
% 0.45/1.03  75 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive) # label(axiom).  [clausify(5)].
% 0.45/1.03  76 stock_of_knowledge(c1,A) = stock_of_knowledge(c1,B).  [resolve(17,a,18,a)].
% 0.45/1.03  77 external_ties(c1,A) = external_ties(c1,B).  [resolve(20,a,18,a)].
% 0.45/1.03  78 -has_immunity(c1,A) | -has_immunity(c1,B) | hazard_of_mortality(c1,A) = hazard_of_mortality(c1,B).  [resolve(23,a,18,a)].
% 0.45/1.03  79 -has_immunity(c1,A) | has_immunity(c1,B) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)).  [resolve(24,a,18,a)].
% 0.45/1.03  81 external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B).  [resolve(27,a,18,a)].
% 0.45/1.03  82 position(c1,A) = position(c1,B).  [copy(81),unit_del(a,77)].
% 0.45/1.03  83 -greater(age(c1,A),age(c1,B)) | greater(internal_friction(c1,A),internal_friction(c1,B)).  [resolve(28,a,18,a)].
% 0.45/1.03  89 -greater(age(c1,A),eta) | -has_immunity(c1,A).  [resolve(35,a,36,a)].
% 0.45/1.03  90 -smaller_or_equal(age(c1,A),eta) | has_immunity(c1,A).  [resolve(37,a,36,a)].
% 0.45/1.03  95 greater(A,B) | A = B | greater(B,A).  [resolve(56,a,55,a)].
% 0.45/1.03  96 -greater(A,B) | smaller_or_equal(B,A).  [resolve(57,a,54,b)].
% 0.45/1.03  97 -smaller_or_equal(A,B) | B = A | greater(B,A).  [resolve(58,b,56,a)].
% 0.45/1.03  99 -smaller_or_equal(stock_of_knowledge(c1,A),stock_of_knowledge(c1,B)) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,B),capability(c1,A)).  [resolve(59,c,56,a)].
% 0.45/1.03  101 has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | -greater_or_equal(position(c1,B),position(c1,A)) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)).  [resolve(60,e,56,a)].
% 0.45/1.03  105 stock_of_knowledge(c1,A) = c_0.  [new_symbol(76)].
% 0.45/1.03  106 -smaller_or_equal(c_0,c_0) | -greater(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,B),capability(c1,A)).  [back_rewrite(99),rewrite([105(2),105(3)])].
% 0.45/1.03  110 smaller_or_equal(A,A).  [xx_res(71,b)].
% 0.45/1.03  112 -greater(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,B),capability(c1,A)).  [back_unit_del(106),unit_del(a,110)].
% 0.45/1.03  116 -greater(age(c1,c4),A) | greater(age(c1,c5),A).  [resolve(75,a,68,a)].
% 0.45/1.03  124 greater_or_equal(position(c1,A),position(c1,B)).  [resolve(82,a,73,b)].
% 0.45/1.03  126 has_immunity(c1,A) | has_immunity(c1,B) | -greater(capability(c1,B),capability(c1,A)) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,B)).  [back_unit_del(101),unit_del(d,124)].
% 0.45/1.03  128 greater(internal_friction(c1,c5),internal_friction(c1,c4)).  [resolve(83,a,68,a)].
% 0.45/1.03  129 -has_immunity(c1,c4).  [ur(89,a,66,a)].
% 0.45/1.03  130 has_immunity(c1,c3).  [resolve(90,a,65,a)].
% 0.45/1.03  141 smaller_or_equal(A,B) | greater(A,B) | A = B.  [resolve(96,a,95,c)].
% 0.45/1.03  144 age(c1,c3) = age(c1,c2) | greater(age(c1,c3),age(c1,c2)).  [resolve(97,a,67,a)].
% 0.45/1.03  150 -greater(age(c1,c3),eta).  [resolve(130,a,89,b)].
% 0.45/1.03  151 has_immunity(c1,A) | greater(hazard_of_mortality(c1,A),hazard_of_mortality(c1,c3)).  [resolve(130,a,79,a)].
% 0.45/1.03  162 greater(capability(c1,c4),capability(c1,c5)).  [resolve(128,a,112,a)].
% 0.45/1.03  170 greater(age(c1,c5),eta).  [resolve(116,a,66,a)].
% 0.45/1.03  175 -has_immunity(c1,c5).  [ur(89,a,170,a)].
% 0.45/1.03  201 greater(hazard_of_mortality(c1,c4),hazard_of_mortality(c1,c3)).  [resolve(151,a,129,a)].
% 0.45/1.03  207 -greater(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c4)) | hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2).  [back_unit_del(70),unit_del(b,201)].
% 0.45/1.03  208 greater(hazard_of_mortality(c1,c5),hazard_of_mortality(c1,c4)).  [resolve(126,c,162,a),unit_del(a,175),unit_del(b,129)].
% 0.45/1.03  211 hazard_of_mortality(c1,c3) != hazard_of_mortality(c1,c2).  [back_unit_del(207),unit_del(a,208)].
% 0.45/1.03  212 -has_immunity(c1,c2).  [ur(78,a,130,a,c,211,a)].
% 0.45/1.03  214 -smaller_or_equal(age(c1,c2),eta).  [ur(90,b,212,a)].
% 0.45/1.03  215 greater(age(c1,c2),eta) | age(c1,c2) = eta.  [resolve(214,a,141,a)].
% 0.45/1.03  217 age(c1,c2) != eta.  [ur(71,a,214,a),flip(a)].
% 0.45/1.03  218 greater(age(c1,c2),eta).  [back_unit_del(215),unit_del(b,217)].
% 0.45/1.03  223 -greater(age(c1,c3),age(c1,c2)).  [ur(75,b,218,a,c,150,a)].
% 0.45/1.03  224 age(c1,c3) = age(c1,c2).  [back_unit_del(144),unit_del(b,223)].
% 0.45/1.03  232 $F.  [back_rewrite(150),rewrite([224(3)]),unit_del(a,218)].
% 0.45/1.03  
% 0.45/1.03  % SZS output end Refutation
% 0.45/1.03  ============================== end of proof ==========================
% 0.45/1.03  
% 0.45/1.03  ============================== STATISTICS ============================
% 0.45/1.03  
% 0.45/1.03  Given=86. Generated=370. Kept=161. proofs=1.
% 0.45/1.03  Usable=80. Sos=41. Demods=2. Limbo=8, Disabled=123. Hints=0.
% 0.45/1.03  Megabytes=0.29.
% 0.45/1.03  User_CPU=0.03, System_CPU=0.01, Wall_clock=0.
% 0.45/1.03  
% 0.45/1.03  ============================== end of statistics =====================
% 0.45/1.03  
% 0.45/1.03  ============================== end of search =========================
% 0.45/1.03  
% 0.45/1.03  THEOREM PROVED
% 0.45/1.03  % SZS status Theorem
% 0.45/1.03  
% 0.45/1.03  Exiting with 1 proof.
% 0.45/1.03  
% 0.45/1.03  Process 9744 exit (max_proofs) Thu Jun  9 08:52:33 2022
% 0.45/1.03  Prover9 interrupted
%------------------------------------------------------------------------------