TSTP Solution File: MGT050+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT050+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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.67s 0.99s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : MGT050+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 10:54:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.67/0.98 ============================== Prover9 ===============================
% 0.67/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.98 Process 3552 was started by sandbox2 on n022.cluster.edu,
% 0.67/0.98 Thu Jun 9 10:54:05 2022
% 0.67/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3399_n022.cluster.edu".
% 0.67/0.98 ============================== end of head ===========================
% 0.67/0.98
% 0.67/0.98 ============================== INPUT =================================
% 0.67/0.98
% 0.67/0.98 % Reading from file /tmp/Prover9_3399_n022.cluster.edu
% 0.67/0.98
% 0.67/0.98 set(prolog_style_variables).
% 0.67/0.98 set(auto2).
% 0.67/0.98 % set(auto2) -> set(auto).
% 0.67/0.98 % set(auto) -> set(auto_inference).
% 0.67/0.98 % set(auto) -> set(auto_setup).
% 0.67/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.98 % set(auto) -> set(auto_limits).
% 0.67/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.98 % set(auto) -> set(auto_denials).
% 0.67/0.98 % set(auto) -> set(auto_process).
% 0.67/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.98 % set(auto2) -> assign(stats, some).
% 0.67/0.98 % set(auto2) -> clear(echo_input).
% 0.67/0.98 % set(auto2) -> set(quiet).
% 0.67/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.98 % set(auto2) -> clear(print_given).
% 0.67/0.98 assign(lrs_ticks,-1).
% 0.67/0.98 assign(sos_limit,10000).
% 0.67/0.98 assign(order,kbo).
% 0.67/0.98 set(lex_order_vars).
% 0.67/0.98 clear(print_given).
% 0.67/0.98
% 0.67/0.98 % formulas(sos). % not echoed (14 formulas)
% 0.67/0.98
% 0.67/0.98 ============================== end of input ==========================
% 0.67/0.98
% 0.67/0.98 % From the command line: assign(max_seconds, 300).
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.98
% 0.67/0.98 % Formulas that are not ordinary clauses:
% 0.67/0.98 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.67/0.98 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.67/0.98 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.98 4 (all X all Y -(greater(X,Y) & greater(Y,X))) # label(meaning_postulate_greater_strict) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.98 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.67/0.98 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.67/0.98 7 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.98 8 (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.67/0.98 9 (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.67/0.98 10 (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.67/0.98 11 (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.67/0.98 12 (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.67/0.98 13 (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.67/0.98 14 -(all X all T0 all T (organization(X) & -has_endowment(X) & greater(age(X,T),age(X,T0)) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(theorem_3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.67/0.98
% 0.67/0.98 ============================== end of process non-clausal formulas ===
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.98
% 0.67/0.98 ============================== PREDICATE ELIMINATION =================
% 0.67/0.98 15 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(7)].
% 0.67/0.98 16 organization(c1) # label(theorem_3) # label(negated_conjecture). [clausify(14)].
% 0.67/0.98 Derived: has_endowment(c1) | -has_immunity(c1,A). [resolve(15,a,16,a)].
% 0.67/0.98 17 -organization(A) | stock_of_knowledge(A,B) = stock_of_knowledge(A,C) # label(assumption_10) # label(axiom). [clausify(11)].
% 0.67/0.98 Derived: stock_of_knowledge(c1,A) = stock_of_knowledge(c1,B). [resolve(17,a,16,a)].
% 0.67/0.98 18 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11) # label(axiom). [clausify(12)].
% 0.67/0.98 Derived: external_ties(c1,A) = external_ties(c1,B). [resolve(18,a,16,a)].
% 0.67/0.98 19 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6) # label(axiom). [clausify(10)].
% 0.67/0.98 Derived: -greater(external_ties(c1,A),external_ties(c1,B)) | greater(position(c1,A),position(c1,B)). [resolve(19,a,16,a)].
% 0.67/0.98 20 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom). [clausify(10)].
% 0.67/0.98 Derived: external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(20,a,16,a)].
% 0.67/0.98 21 -organization(A) | -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) # label(assumption_12) # label(axiom). [clausify(13)].
% 0.67/0.98 Derived: -greater(age(c1,A),age(c1,B)) | greater(internal_friction(c1,A),internal_friction(c1,B)). [resolve(21,a,16,a)].
% 0.67/0.98 22 -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(9)].
% 0.67/0.98 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(22,a,16,a)].
% 0.67/0.98 23 -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(9)].
% 0.67/0.98 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(23,a,16,a)].
% 0.67/0.98 24 -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(9)].
% 0.67/0.98 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(24,a,16,a)].
% 0.67/0.98 25 -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(8)].
% 0.67/0.98 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(25,a,16,a)].
% 0.67/0.98 26 -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(8)].
% 0.67/0.98 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(26,a,16,a)].
% 0.67/0.98 27 -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(8)].
% 0.67/0.98 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(27,a,16,a)].
% 0.67/0.98 28 smaller_or_equal(A,B) | -smaller(A,B) # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.67/0.98 29 smaller(A,B) | B = A | greater(A,B) # label(meaning_postulate_greater_comparable) # label(axiom). [clausify(6)].
% 0.67/0.98 Derived: smaller_or_equal(A,B) | B = A | greater(A,B). [resolve(28,b,29,a)].
% 0.67/0.98 30 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.67/0.98 Derived: greater(A,B) | A = B | greater(B,A). [resolve(30,a,29,a)].
% 0.67/0.98 31 smaller(A,B) | -greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.67/0.98 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(31,a,28,b)].
% 0.67/0.98 32 -smaller_or_equal(A,B) | smaller(A,B) | B = A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.67/0.98 Derived: -smaller_or_equal(A,B) | B = A | greater(B,A). [resolve(32,b,30,a)].
% 0.67/0.98 33 -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(23,a,16,a)].
% 0.67/0.98 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(33,c,28,b)].
% 0.67/0.98 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(33,c,30,a)].
% 0.67/0.98 34 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(25,a,16,a)].
% 0.67/0.98 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(34,e,28,b)].
% 0.67/0.98 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(34,e,30,a)].
% 0.67/0.98 35 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(26,a,16,a)].
% 0.67/0.98 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(35,e,28,b)].
% 0.67/0.99 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(35,e,30,a)].
% 0.67/0.99
% 0.67/0.99 ============================== end predicate elimination =============
% 0.67/0.99
% 0.67/0.99 Auto_denials: (non-Horn, no changes).
% 0.67/0.99
% 0.67/0.99 Term ordering decisions:
% 0.67/0.99 Function symbol KB weights: c1=1. c2=1. c3=1. capability=1. position=1. hazard_of_mortality=1. internal_friction=1. stock_of_knowledge=1. external_ties=1. age=1.
% 0.67/0.99
% 0.67/0.99 ============================== end of process initial clauses ========
% 0.67/0.99
% 0.67/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.67/0.99
% 0.67/0.99 ============================== end of clauses for search =============
% 0.67/0.99
% 0.67/0.99 ============================== SEARCH ================================
% 0.67/0.99
% 0.67/0.99 % Starting search at 0.02 seconds.
% 0.67/0.99
% 0.67/0.99 ============================== PROOF =================================
% 0.67/0.99 % SZS status Theorem
% 0.67/0.99 % SZS output start Refutation
% 0.67/0.99
% 0.67/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.67/0.99 % Length of proof is 46.
% 0.67/0.99 % Level of proof is 7.
% 0.67/0.99 % Maximum clause weight is 21.000.
% 0.67/0.99 % Given clauses 55.
% 0.67/0.99
% 0.67/0.99 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.67/0.99 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.67/0.99 3 (all X all Y (smaller(X,Y) <-> greater(Y,X))) # label(definition_smaller) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.99 7 (all X all T (organization(X) & -has_endowment(X) -> -has_immunity(X,T))) # label(assumption_1) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.99 8 (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.67/0.99 9 (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.67/0.99 10 (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.67/0.99 11 (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.67/0.99 12 (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.67/0.99 13 (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.67/0.99 14 -(all X all T0 all T (organization(X) & -has_endowment(X) & greater(age(X,T),age(X,T0)) -> greater(hazard_of_mortality(X,T),hazard_of_mortality(X,T0)))) # label(theorem_3) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.67/0.99 15 -organization(A) | has_endowment(A) | -has_immunity(A,B) # label(assumption_1) # label(axiom). [clausify(7)].
% 0.67/0.99 16 organization(c1) # label(theorem_3) # label(negated_conjecture). [clausify(14)].
% 0.67/0.99 17 -organization(A) | stock_of_knowledge(A,B) = stock_of_knowledge(A,C) # label(assumption_10) # label(axiom). [clausify(11)].
% 0.67/0.99 18 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11) # label(axiom). [clausify(12)].
% 0.67/0.99 20 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6) # label(axiom). [clausify(10)].
% 0.67/0.99 21 -organization(A) | -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) # label(assumption_12) # label(axiom). [clausify(13)].
% 0.67/0.99 23 -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(9)].
% 0.67/0.99 25 -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(8)].
% 0.67/0.99 30 -smaller(A,B) | greater(B,A) # label(definition_smaller) # label(axiom). [clausify(3)].
% 0.67/0.99 33 -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(23,a,16,a)].
% 0.67/0.99 34 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(25,a,16,a)].
% 0.67/0.99 36 greater(age(c1,c3),age(c1,c2)) # label(theorem_3) # label(negated_conjecture). [clausify(14)].
% 0.67/0.99 37 -has_endowment(c1) # label(theorem_3) # label(negated_conjecture). [clausify(14)].
% 0.67/0.99 39 -greater(hazard_of_mortality(c1,c3),hazard_of_mortality(c1,c2)) # label(theorem_3) # label(negated_conjecture). [clausify(14)].
% 0.67/0.99 40 smaller_or_equal(A,B) | B != A # label(definition_smaller_or_equal) # label(axiom). [clausify(1)].
% 0.67/0.99 42 greater_or_equal(A,B) | B != A # label(definition_greater_or_equal) # label(axiom). [clausify(2)].
% 0.67/0.99 45 has_endowment(c1) | -has_immunity(c1,A). [resolve(15,a,16,a)].
% 0.67/0.99 46 -has_immunity(c1,A). [copy(45),unit_del(a,37)].
% 0.67/0.99 47 stock_of_knowledge(c1,A) = stock_of_knowledge(c1,B). [resolve(17,a,16,a)].
% 0.67/0.99 48 external_ties(c1,A) = external_ties(c1,B). [resolve(18,a,16,a)].
% 0.67/0.99 50 external_ties(c1,A) != external_ties(c1,B) | position(c1,A) = position(c1,B). [resolve(20,a,16,a)].
% 0.67/0.99 51 position(c1,A) = position(c1,B). [copy(50),unit_del(a,48)].
% 0.67/0.99 52 -greater(age(c1,A),age(c1,B)) | greater(internal_friction(c1,A),internal_friction(c1,B)). [resolve(21,a,16,a)].
% 0.67/0.99 63 -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(33,c,30,a)].
% 0.67/0.99 66 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(34,e,30,a)].
% 0.67/0.99 67 -greater(capability(c1,A),capability(c1,B)) | -greater_or_equal(position(c1,A),position(c1,B)) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [copy(66),unit_del(a,46),unit_del(b,46)].
% 0.67/0.99 73 stock_of_knowledge(c1,A) = c_0. [new_symbol(47)].
% 0.67/0.99 74 -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(63),rewrite([73(2),73(3)])].
% 0.67/0.99 77 smaller_or_equal(A,A). [xx_res(40,b)].
% 0.67/0.99 79 -greater(internal_friction(c1,A),internal_friction(c1,B)) | greater(capability(c1,B),capability(c1,A)). [back_unit_del(74),unit_del(a,77)].
% 0.67/0.99 88 greater_or_equal(position(c1,A),position(c1,B)). [resolve(51,a,42,b)].
% 0.67/0.99 90 -greater(capability(c1,A),capability(c1,B)) | greater(hazard_of_mortality(c1,B),hazard_of_mortality(c1,A)). [back_unit_del(67),unit_del(b,88)].
% 0.67/0.99 92 greater(internal_friction(c1,c3),internal_friction(c1,c2)). [resolve(52,a,36,a)].
% 0.67/0.99 112 greater(capability(c1,c2),capability(c1,c3)). [resolve(79,a,92,a)].
% 0.67/0.99 133 $F. [resolve(90,a,112,a),unit_del(a,39)].
% 0.67/0.99
% 0.67/0.99 % SZS output end Refutation
% 0.67/0.99 ============================== end of proof ==========================
% 0.67/0.99
% 0.67/0.99 ============================== STATISTICS ============================
% 0.67/0.99
% 0.67/0.99 Given=55. Generated=198. Kept=89. proofs=1.
% 0.67/0.99 Usable=50. Sos=19. Demods=1. Limbo=0, Disabled=69. Hints=0.
% 0.67/0.99 Megabytes=0.17.
% 0.67/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.67/0.99
% 0.67/0.99 ============================== end of statistics =====================
% 0.67/0.99
% 0.67/0.99 ============================== end of search =========================
% 0.67/0.99
% 0.67/0.99 THEOREM PROVED
% 0.67/0.99 % SZS status Theorem
% 0.67/0.99
% 0.67/0.99 Exiting with 1 proof.
% 0.67/0.99
% 0.67/0.99 Process 3552 exit (max_proofs) Thu Jun 9 10:54:05 2022
% 0.67/0.99 Prover9 interrupted
%------------------------------------------------------------------------------