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 : n024.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 : Unsatisfiable 0.47s 1.05s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : MGT051-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Thu Jun 9 09:42:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.04 ============================== Prover9 ===============================
% 0.47/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.04 Process 27232 was started by sandbox2 on n024.cluster.edu,
% 0.47/1.04 Thu Jun 9 09:42:35 2022
% 0.47/1.04 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27079_n024.cluster.edu".
% 0.47/1.04 ============================== end of head ===========================
% 0.47/1.04
% 0.47/1.04 ============================== INPUT =================================
% 0.47/1.04
% 0.47/1.04 % Reading from file /tmp/Prover9_27079_n024.cluster.edu
% 0.47/1.04
% 0.47/1.04 set(prolog_style_variables).
% 0.47/1.04 set(auto2).
% 0.47/1.04 % set(auto2) -> set(auto).
% 0.47/1.04 % set(auto) -> set(auto_inference).
% 0.47/1.04 % set(auto) -> set(auto_setup).
% 0.47/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.04 % set(auto) -> set(auto_limits).
% 0.47/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.04 % set(auto) -> set(auto_denials).
% 0.47/1.04 % set(auto) -> set(auto_process).
% 0.47/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.04 % set(auto2) -> assign(stats, some).
% 0.47/1.04 % set(auto2) -> clear(echo_input).
% 0.47/1.04 % set(auto2) -> set(quiet).
% 0.47/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.04 % set(auto2) -> clear(print_given).
% 0.47/1.04 assign(lrs_ticks,-1).
% 0.47/1.04 assign(sos_limit,10000).
% 0.47/1.04 assign(order,kbo).
% 0.47/1.04 set(lex_order_vars).
% 0.47/1.04 clear(print_given).
% 0.47/1.04
% 0.47/1.04 % formulas(sos). % not echoed (38 formulas)
% 0.47/1.04
% 0.47/1.04 ============================== end of input ==========================
% 0.47/1.04
% 0.47/1.04 % From the command line: assign(max_seconds, 300).
% 0.47/1.04
% 0.47/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.04
% 0.47/1.04 % Formulas that are not ordinary clauses:
% 0.47/1.04
% 0.47/1.04 ============================== end of process non-clausal formulas ===
% 0.47/1.04
% 0.47/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.04
% 0.47/1.04 ============================== PREDICATE ELIMINATION =================
% 0.47/1.04 1 -organization(A) | stock_of_knowledge(A,B) = stock_of_knowledge(A,C) # label(assumption_10_58) # label(axiom). [assumption].
% 0.47/1.04 2 organization(sk2) # label(theorem_4_61) # label(negated_conjecture). [assumption].
% 0.47/1.04 3 -has_endowment(A) | organization(A) # label(definition_1_41) # label(axiom). [assumption].
% 0.47/1.04 Derived: stock_of_knowledge(sk2,A) = stock_of_knowledge(sk2,B). [resolve(1,a,2,a)].
% 0.47/1.04 Derived: stock_of_knowledge(A,B) = stock_of_knowledge(A,C) | -has_endowment(A). [resolve(1,a,3,b)].
% 0.47/1.04 4 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11_59) # label(axiom). [assumption].
% 0.47/1.04 Derived: external_ties(sk2,A) = external_ties(sk2,B). [resolve(4,a,2,a)].
% 0.47/1.04 Derived: external_ties(A,B) = external_ties(A,C) | -has_endowment(A). [resolve(4,a,3,b)].
% 0.47/1.04 5 -organization(A) | -has_immunity(A,sk1(A)) | has_immunity(A,sk1(A)) | has_endowment(A) # label(definition_1_47) # label(axiom). [assumption].
% 0.47/1.04 6 -organization(A) | smaller_or_equal(age(A,sk1(A)),eta) | has_immunity(A,sk1(A)) | has_endowment(A) # label(definition_1_45) # label(axiom). [assumption].
% 0.47/1.04 Derived: smaller_or_equal(age(sk2,sk1(sk2)),eta) | has_immunity(sk2,sk1(sk2)) | has_endowment(sk2). [resolve(6,a,2,a)].
% 0.47/1.04 7 -organization(A) | -has_immunity(A,sk1(A)) | greater(age(A,sk1(A)),eta) | has_endowment(A) # label(definition_1_46) # label(axiom). [assumption].
% 0.47/1.04 Derived: -has_immunity(sk2,sk1(sk2)) | greater(age(sk2,sk1(sk2)),eta) | has_endowment(sk2). [resolve(7,a,2,a)].
% 0.47/1.04 8 -organization(A) | -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) # label(assumption_2_48) # label(axiom). [assumption].
% 0.47/1.04 Derived: -has_immunity(sk2,A) | -has_immunity(sk2,B) | hazard_of_mortality(sk2,A) = hazard_of_mortality(sk2,B). [resolve(8,a,2,a)].
% 0.47/1.04 Derived: -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A). [resolve(8,a,3,b)].
% 0.47/1.04 9 -organization(A) | -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_3_49) # label(axiom). [assumption].
% 0.47/1.04 Derived: -has_immunity(sk2,A) | has_immunity(sk2,B) | greater(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(9,a,2,a)].
% 0.47/1.04 Derived: -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A). [resolve(9,a,3,b)].
% 0.47/1.04 10 -organization(A) | smaller_or_equal(age(A,sk1(A)),eta) | greater(age(A,sk1(A)),eta) | has_endowment(A) # label(definition_1_44) # label(axiom). [assumption].
% 0.47/1.04 Derived: smaller_or_equal(age(sk2,sk1(sk2)),eta) | greater(age(sk2,sk1(sk2)),eta) | has_endowment(sk2). [resolve(10,a,2,a)].
% 0.47/1.04 11 -organization(A) | -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) # label(assumption_6_56) # label(axiom). [assumption].
% 0.47/1.04 Derived: -greater(external_ties(sk2,A),external_ties(sk2,B)) | greater(position(sk2,A),position(sk2,B)). [resolve(11,a,2,a)].
% 0.47/1.04 Derived: -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) | -has_endowment(A). [resolve(11,a,3,b)].
% 0.47/1.04 12 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6_57) # label(axiom). [assumption].
% 0.47/1.04 Derived: external_ties(sk2,A) != external_ties(sk2,B) | position(sk2,A) = position(sk2,B). [resolve(12,a,2,a)].
% 0.47/1.04 Derived: external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) | -has_endowment(A). [resolve(12,a,3,b)].
% 0.47/1.04 13 -organization(A) | -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) # label(assumption_12_60) # label(axiom). [assumption].
% 0.47/1.04 Derived: -greater(age(sk2,A),age(sk2,B)) | greater(internal_friction(sk2,A),internal_friction(sk2,B)). [resolve(13,a,2,a)].
% 0.47/1.04 Derived: -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) | -has_endowment(A). [resolve(13,a,3,b)].
% 0.47/1.04 14 -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_53) # label(axiom). [assumption].
% 0.47/1.04 Derived: -greater(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -smaller_or_equal(internal_friction(sk2,A),internal_friction(sk2,B)) | greater(capability(sk2,A),capability(sk2,B)). [resolve(14,a,2,a)].
% 0.47/1.04 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(14,a,3,b)].
% 0.47/1.04 15 -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_54) # label(axiom). [assumption].
% 0.47/1.04 Derived: -smaller_or_equal(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | smaller(capability(sk2,A),capability(sk2,B)). [resolve(15,a,2,a)].
% 0.47/1.04 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(15,a,3,b)].
% 0.47/1.04 16 -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_55) # label(axiom). [assumption].
% 0.47/1.04 Derived: stock_of_knowledge(sk2,A) != stock_of_knowledge(sk2,B) | internal_friction(sk2,A) != internal_friction(sk2,B) | capability(sk2,A) = capability(sk2,B). [resolve(16,a,2,a)].
% 0.47/1.04 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(16,a,3,b)].
% 0.47/1.04 17 -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_50) # label(axiom). [assumption].
% 0.47/1.04 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | -greater(capability(sk2,B),capability(sk2,A)) | -greater_or_equal(position(sk2,B),position(sk2,A)) | smaller(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(17,a,2,a)].
% 0.47/1.04 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(17,a,3,b)].
% 0.47/1.04 18 -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_51) # label(axiom). [assumption].
% 0.47/1.04 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | -greater_or_equal(capability(sk2,B),capability(sk2,A)) | -greater(position(sk2,B),position(sk2,A)) | smaller(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(18,a,2,a)].
% 0.47/1.04 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(18,a,3,b)].
% 0.47/1.04 19 -organization(A) | has_immunity(A,B) | has_immunity(A,C) | capability(A,C) != capability(A,B) | position(A,C) != position(A,B) | hazard_of_mortality(A,C) = hazard_of_mortality(A,B) # label(assumption_4_52) # label(axiom). [assumption].
% 0.47/1.04 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | capability(sk2,B) != capability(sk2,A) | position(sk2,B) != position(sk2,A) | hazard_of_mortality(sk2,B) = hazard_of_mortality(sk2,A). [resolve(19,a,2,a)].
% 0.47/1.04 Derived: has_immunity(A,B) | has_immunity(A,C) | capability(A,C) != capability(A,B) | position(A,C) != position(A,B) | hazard_of_mortality(A,C) = hazard_of_mortality(A,B) | -has_endowment(A). [resolve(19,a,3,b)].
% 0.47/1.04 20 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1_43) # label(axiom). [assumption].
% 0.47/1.04 21 has_endowment(sk2) # label(theorem_4_62) # label(negated_conjecture). [assumption].
% 0.47/1.04 Derived: -greater(age(sk2,A),eta) | -has_immunity(sk2,A). [resolve(20,a,21,a)].
% 0.47/1.04 22 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1_42) # label(axiom). [assumption].
% 0.47/1.04 Derived: -smaller_or_equal(age(sk2,A),eta) | has_immunity(sk2,A). [resolve(22,a,21,a)].
% 0.47/1.04 23 stock_of_knowledge(A,B) = stock_of_knowledge(A,C) | -has_endowment(A). [resolve(1,a,3,b)].
% 0.47/1.04 Derived: stock_of_knowledge(sk2,A) = stock_of_knowledge(sk2,B). [resolve(23,b,21,a)].
% 0.47/1.04 24 external_ties(A,B) = external_ties(A,C) | -has_endowment(A). [resolve(4,a,3,b)].
% 0.47/1.04 Derived: external_ties(sk2,A) = external_ties(sk2,B). [resolve(24,b,21,a)].
% 0.47/1.04 25 smaller_or_equal(age(sk2,sk1(sk2)),eta) | has_immunity(sk2,sk1(sk2)) | has_endowment(sk2). [resolve(6,a,2,a)].
% 0.47/1.04 26 -has_immunity(sk2,sk1(sk2)) | greater(age(sk2,sk1(sk2)),eta) | has_endowment(sk2). [resolve(7,a,2,a)].
% 0.47/1.04 27 -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) | -has_endowment(A). [resolve(8,a,3,b)].
% 0.47/1.04 Derived: -has_immunity(sk2,A) | -has_immunity(sk2,B) | hazard_of_mortality(sk2,A) = hazard_of_mortality(sk2,B). [resolve(27,d,21,a)].
% 0.47/1.04 28 -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) | -has_endowment(A). [resolve(9,a,3,b)].
% 0.47/1.04 Derived: -has_immunity(sk2,A) | has_immunity(sk2,B) | greater(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(28,d,21,a)].
% 0.47/1.04 29 smaller_or_equal(age(sk2,sk1(sk2)),eta) | greater(age(sk2,sk1(sk2)),eta) | has_endowment(sk2). [resolve(10,a,2,a)].
% 0.47/1.04 30 -greater(external_ties(A,B),external_ties(A,C)) | greater(position(A,B),position(A,C)) | -has_endowment(A). [resolve(11,a,3,b)].
% 0.47/1.04 Derived: -greater(external_ties(sk2,A),external_ties(sk2,B)) | greater(position(sk2,A),position(sk2,B)). [resolve(30,c,21,a)].
% 0.47/1.04 31 external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) | -has_endowment(A). [resolve(12,a,3,b)].
% 0.47/1.04 Derived: external_ties(sk2,A) != external_ties(sk2,B) | position(sk2,A) = position(sk2,B). [resolve(31,c,21,a)].
% 0.47/1.04 32 -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) | -has_endowment(A). [resolve(13,a,3,b)].
% 0.47/1.04 Derived: -greater(age(sk2,A),age(sk2,B)) | greater(internal_friction(sk2,A),internal_friction(sk2,B)). [resolve(32,c,21,a)].
% 0.47/1.04 33 -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(14,a,3,b)].
% 0.47/1.04 Derived: -greater(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -smaller_or_equal(internal_friction(sk2,A),internal_friction(sk2,B)) | greater(capability(sk2,A),capability(sk2,B)). [resolve(33,d,21,a)].
% 0.47/1.04 34 -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(15,a,3,b)].
% 0.47/1.04 Derived: -smaller_or_equal(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | smaller(capability(sk2,A),capability(sk2,B)). [resolve(34,d,21,a)].
% 0.47/1.04 35 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(16,a,3,b)].
% 0.47/1.04 Derived: stock_of_knowledge(sk2,A) != stock_of_knowledge(sk2,B) | internal_friction(sk2,A) != internal_friction(sk2,B) | capability(sk2,A) = capability(sk2,B). [resolve(35,d,21,a)].
% 0.47/1.04 36 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(17,a,3,b)].
% 0.47/1.04 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | -greater(capability(sk2,B),capability(sk2,A)) | -greater_or_equal(position(sk2,B),position(sk2,A)) | smaller(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(36,f,21,a)].
% 0.47/1.04 37 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(18,a,3,b)].
% 0.47/1.04 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | -greater_or_equal(capability(sk2,B),capability(sk2,A)) | -greater(position(sk2,B),position(sk2,A)) | smaller(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(37,f,21,a)].
% 0.47/1.04 38 has_immunity(A,B) | has_immunity(A,C) | capability(A,C) != capability(A,B) | position(A,C) != position(A,B) | hazard_of_mortality(A,C) = hazard_of_mortality(A,B) | -has_endowment(A). [resolve(19,a,3,b)].
% 0.47/1.04 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | capability(sk2,B) != capability(sk2,A) | position(sk2,B) != position(sk2,A) | hazard_of_mortality(sk2,B) = hazard_of_mortality(sk2,A). [resolve(38,f,21,a)].
% 0.47/1.04 39 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.47/1.04 40 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.47/1.04 Derived: smaller_or_equal(A,B) | A = B | greater(A,B). [resolve(39,a,40,a)].
% 0.47/1.04 41 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.47/1.04 Derived: greater(A,B) | B = A | greater(B,A). [resolve(41,a,40,a)].
% 0.47/1.04 42 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.47/1.04 Derived: -greater(A,B) | smaller_or_equal(B,A). [resolve(42,b,39,a)].
% 0.47/1.04 43 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.47/1.04 Derived: -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(43,b,41,a)].
% 0.47/1.04 44 -smaller_or_equal(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | smaller(capability(sk2,A),capability(sk2,B)). [resolve(15,a,2,a)].
% 0.47/1.05 Derived: -smaller_or_equal(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | smaller_or_equal(capability(sk2,A),capability(sk2,B)). [resolve(44,c,39,a)].
% 0.47/1.05 Derived: -smaller_or_equal(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | greater(capability(sk2,B),capability(sk2,A)). [resolve(44,c,41,a)].
% 0.47/1.05 45 has_immunity(sk2,A) | has_immunity(sk2,B) | -greater(capability(sk2,B),capability(sk2,A)) | -greater_or_equal(position(sk2,B),position(sk2,A)) | smaller(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(17,a,2,a)].
% 0.47/1.05 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | -greater(capability(sk2,B),capability(sk2,A)) | -greater_or_equal(position(sk2,B),position(sk2,A)) | smaller_or_equal(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(45,e,39,a)].
% 0.47/1.05 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | -greater(capability(sk2,B),capability(sk2,A)) | -greater_or_equal(position(sk2,B),position(sk2,A)) | greater(hazard_of_mortality(sk2,A),hazard_of_mortality(sk2,B)). [resolve(45,e,41,a)].
% 0.47/1.05 46 has_immunity(sk2,A) | has_immunity(sk2,B) | -greater_or_equal(capability(sk2,B),capability(sk2,A)) | -greater(position(sk2,B),position(sk2,A)) | smaller(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(18,a,2,a)].
% 0.47/1.05 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | -greater_or_equal(capability(sk2,B),capability(sk2,A)) | -greater(position(sk2,B),position(sk2,A)) | smaller_or_equal(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(46,e,39,a)].
% 0.47/1.05 Derived: has_immunity(sk2,A) | has_immunity(sk2,B) | -greater_or_equal(capability(sk2,B),capability(sk2,A)) | -greater(position(sk2,B),position(sk2,A)) | greater(hazard_of_mortality(sk2,A),hazard_of_mortality(sk2,B)). [resolve(46,e,41,a)].
% 0.47/1.05 47 -smaller_or_equal(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | smaller(capability(sk2,A),capability(sk2,B)). [resolve(34,d,21,a)].
% 0.47/1.05 48 has_immunity(sk2,A) | has_immunity(sk2,B) | -greater(capability(sk2,B),capability(sk2,A)) | -greater_or_equal(position(sk2,B),position(sk2,A)) | smaller(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(36,f,21,a)].
% 0.47/1.05 49 has_immunity(sk2,A) | has_immunity(sk2,B) | -greater_or_equal(capability(sk2,B),capability(sk2,A)) | -greater(position(sk2,B),position(sk2,A)) | smaller(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(37,f,21,a)].
% 0.47/1.05
% 0.47/1.05 ============================== end predicate elimination =============
% 0.47/1.05
% 0.47/1.05 Auto_denials: (non-Horn, no changes).
% 0.47/1.05
% 0.47/1.05 Term ordering decisions:
% 0.47/1.05 Function symbol KB weights: sk2=1. eta=1. sk4=1. sk5=1. sk3=1. sk6=1. capability=1. hazard_of_mortality=1. position=1. internal_friction=1. stock_of_knowledge=1. external_ties=1. age=1.
% 0.47/1.05
% 0.47/1.05 ============================== end of process initial clauses ========
% 0.47/1.05
% 0.47/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.05
% 0.47/1.05 ============================== end of clauses for search =============
% 0.47/1.05
% 0.47/1.05 ============================== SEARCH ================================
% 0.47/1.05
% 0.47/1.05 % Starting search at 0.02 seconds.
% 0.47/1.05
% 0.47/1.05 ============================== PROOF =================================
% 0.47/1.05 % SZS status Unsatisfiable
% 0.47/1.05 % SZS output start Refutation
% 0.47/1.05
% 0.47/1.05 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.47/1.05 % Length of proof is 71.
% 0.47/1.05 % Level of proof is 14.
% 0.47/1.05 % Maximum clause weight is 27.000.
% 0.47/1.05 % Given clauses 86.
% 0.47/1.05
% 0.47/1.05 1 -organization(A) | stock_of_knowledge(A,B) = stock_of_knowledge(A,C) # label(assumption_10_58) # label(axiom). [assumption].
% 0.47/1.05 2 organization(sk2) # label(theorem_4_61) # label(negated_conjecture). [assumption].
% 0.47/1.05 4 -organization(A) | external_ties(A,B) = external_ties(A,C) # label(assumption_11_59) # label(axiom). [assumption].
% 0.47/1.05 8 -organization(A) | -has_immunity(A,B) | -has_immunity(A,C) | hazard_of_mortality(A,B) = hazard_of_mortality(A,C) # label(assumption_2_48) # label(axiom). [assumption].
% 0.47/1.05 9 -organization(A) | -has_immunity(A,B) | has_immunity(A,C) | greater(hazard_of_mortality(A,C),hazard_of_mortality(A,B)) # label(assumption_3_49) # label(axiom). [assumption].
% 0.47/1.05 12 -organization(A) | external_ties(A,B) != external_ties(A,C) | position(A,B) = position(A,C) # label(assumption_6_57) # label(axiom). [assumption].
% 0.47/1.05 13 -organization(A) | -greater(age(A,B),age(A,C)) | greater(internal_friction(A,B),internal_friction(A,C)) # label(assumption_12_60) # label(axiom). [assumption].
% 0.47/1.05 15 -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_54) # label(axiom). [assumption].
% 0.47/1.05 17 -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_50) # label(axiom). [assumption].
% 0.47/1.05 20 -has_endowment(A) | -greater(age(A,B),eta) | -has_immunity(A,B) # label(definition_1_43) # label(axiom). [assumption].
% 0.47/1.05 21 has_endowment(sk2) # label(theorem_4_62) # label(negated_conjecture). [assumption].
% 0.47/1.05 22 -has_endowment(A) | -smaller_or_equal(age(A,B),eta) | has_immunity(A,B) # label(definition_1_42) # label(axiom). [assumption].
% 0.47/1.05 39 -smaller(A,B) | smaller_or_equal(A,B) # label(definition_smaller_or_equal_2) # label(axiom). [assumption].
% 0.47/1.05 40 smaller(A,B) | A = B | greater(A,B) # label(meaning_postulate_greater_comparable_11) # label(axiom). [assumption].
% 0.47/1.05 41 -smaller(A,B) | greater(B,A) # label(definition_smaller_7) # label(axiom). [assumption].
% 0.47/1.05 42 -greater(A,B) | smaller(B,A) # label(definition_smaller_8) # label(axiom). [assumption].
% 0.47/1.05 43 -smaller_or_equal(A,B) | smaller(A,B) | A = B # label(definition_smaller_or_equal_1) # label(axiom). [assumption].
% 0.47/1.05 44 -smaller_or_equal(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | smaller(capability(sk2,A),capability(sk2,B)). [resolve(15,a,2,a)].
% 0.47/1.05 45 has_immunity(sk2,A) | has_immunity(sk2,B) | -greater(capability(sk2,B),capability(sk2,A)) | -greater_or_equal(position(sk2,B),position(sk2,A)) | smaller(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(17,a,2,a)].
% 0.47/1.05 50 smaller_or_equal(age(sk2,sk4),eta) # label(theorem_4_64) # label(negated_conjecture). [assumption].
% 0.47/1.05 51 greater(age(sk2,sk5),eta) # label(theorem_4_65) # label(negated_conjecture). [assumption].
% 0.47/1.05 52 smaller_or_equal(age(sk2,sk3),age(sk2,sk4)) # label(theorem_4_63) # label(negated_conjecture). [assumption].
% 0.47/1.05 53 greater(age(sk2,sk6),age(sk2,sk5)) # label(theorem_4_66) # label(negated_conjecture). [assumption].
% 0.47/1.05 55 -greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk5)) | -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) | hazard_of_mortality(sk2,sk4) != hazard_of_mortality(sk2,sk3) # label(theorem_4_67) # label(negated_conjecture). [assumption].
% 0.47/1.05 56 -greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk5)) | -greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)) | hazard_of_mortality(sk2,sk3) != hazard_of_mortality(sk2,sk4). [copy(55),flip(c)].
% 0.47/1.05 57 A != B | smaller_or_equal(A,B) # label(definition_smaller_or_equal_3) # label(axiom). [assumption].
% 0.47/1.05 59 A != B | greater_or_equal(A,B) # label(definition_greater_or_equal_6) # label(axiom). [assumption].
% 0.47/1.05 61 -greater(A,B) | -greater(B,C) | greater(A,C) # label(meaning_postulate_greater_transitive_10) # label(axiom). [assumption].
% 0.47/1.05 62 stock_of_knowledge(sk2,A) = stock_of_knowledge(sk2,B). [resolve(1,a,2,a)].
% 0.47/1.05 63 external_ties(sk2,A) = external_ties(sk2,B). [resolve(4,a,2,a)].
% 0.47/1.05 64 -has_immunity(sk2,A) | -has_immunity(sk2,B) | hazard_of_mortality(sk2,A) = hazard_of_mortality(sk2,B). [resolve(8,a,2,a)].
% 0.47/1.05 65 -has_immunity(sk2,A) | has_immunity(sk2,B) | greater(hazard_of_mortality(sk2,B),hazard_of_mortality(sk2,A)). [resolve(9,a,2,a)].
% 0.47/1.05 67 external_ties(sk2,A) != external_ties(sk2,B) | position(sk2,A) = position(sk2,B). [resolve(12,a,2,a)].
% 0.47/1.06 68 position(sk2,A) = position(sk2,B). [copy(67),unit_del(a,63)].
% 0.47/1.06 69 -greater(age(sk2,A),age(sk2,B)) | greater(internal_friction(sk2,A),internal_friction(sk2,B)). [resolve(13,a,2,a)].
% 0.47/1.06 75 -greater(age(sk2,A),eta) | -has_immunity(sk2,A). [resolve(20,a,21,a)].
% 0.47/1.06 76 -smaller_or_equal(age(sk2,A),eta) | has_immunity(sk2,A). [resolve(22,a,21,a)].
% 0.47/1.06 81 greater(A,B) | B = A | greater(B,A). [resolve(41,a,40,a)].
% 0.47/1.06 82 -greater(A,B) | smaller_or_equal(B,A). [resolve(42,b,39,a)].
% 0.47/1.06 83 -smaller_or_equal(A,B) | A = B | greater(B,A). [resolve(43,b,41,a)].
% 0.47/1.06 85 -smaller_or_equal(stock_of_knowledge(sk2,A),stock_of_knowledge(sk2,B)) | -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | greater(capability(sk2,B),capability(sk2,A)). [resolve(44,c,41,a)].
% 0.47/1.06 87 has_immunity(sk2,A) | has_immunity(sk2,B) | -greater(capability(sk2,B),capability(sk2,A)) | -greater_or_equal(position(sk2,B),position(sk2,A)) | greater(hazard_of_mortality(sk2,A),hazard_of_mortality(sk2,B)). [resolve(45,e,41,a)].
% 0.47/1.06 91 stock_of_knowledge(sk2,A) = c_0. [new_symbol(62)].
% 0.47/1.06 92 -smaller_or_equal(c_0,c_0) | -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | greater(capability(sk2,B),capability(sk2,A)). [back_rewrite(85),rewrite([91(2),91(3)])].
% 0.47/1.06 96 smaller_or_equal(A,A). [xx_res(57,a)].
% 0.47/1.06 98 -greater(internal_friction(sk2,A),internal_friction(sk2,B)) | greater(capability(sk2,B),capability(sk2,A)). [back_unit_del(92),unit_del(a,96)].
% 0.47/1.06 102 -greater(age(sk2,sk5),A) | greater(age(sk2,sk6),A). [resolve(61,a,53,a)].
% 0.47/1.06 110 greater_or_equal(position(sk2,A),position(sk2,B)). [resolve(68,a,59,a)].
% 0.47/1.06 112 has_immunity(sk2,A) | has_immunity(sk2,B) | -greater(capability(sk2,B),capability(sk2,A)) | greater(hazard_of_mortality(sk2,A),hazard_of_mortality(sk2,B)). [back_unit_del(87),unit_del(d,110)].
% 0.47/1.06 114 greater(internal_friction(sk2,sk6),internal_friction(sk2,sk5)). [resolve(69,a,53,a)].
% 0.47/1.06 115 -has_immunity(sk2,sk5). [ur(75,a,51,a)].
% 0.47/1.06 116 has_immunity(sk2,sk4). [resolve(76,a,50,a)].
% 0.47/1.06 127 smaller_or_equal(A,B) | greater(A,B) | B = A. [resolve(82,a,81,c)].
% 0.47/1.06 130 age(sk2,sk3) = age(sk2,sk4) | greater(age(sk2,sk4),age(sk2,sk3)). [resolve(83,a,52,a)].
% 0.47/1.06 136 -greater(age(sk2,sk4),eta). [resolve(116,a,75,b)].
% 0.47/1.06 137 has_immunity(sk2,A) | greater(hazard_of_mortality(sk2,A),hazard_of_mortality(sk2,sk4)). [resolve(116,a,65,a)].
% 0.47/1.06 148 greater(capability(sk2,sk5),capability(sk2,sk6)). [resolve(114,a,98,a)].
% 0.47/1.06 156 greater(age(sk2,sk6),eta). [resolve(102,a,51,a)].
% 0.47/1.06 161 -has_immunity(sk2,sk6). [ur(75,a,156,a)].
% 0.47/1.06 187 greater(hazard_of_mortality(sk2,sk5),hazard_of_mortality(sk2,sk4)). [resolve(137,a,115,a)].
% 0.47/1.06 193 -greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk5)) | hazard_of_mortality(sk2,sk3) != hazard_of_mortality(sk2,sk4). [back_unit_del(56),unit_del(b,187)].
% 0.47/1.06 194 greater(hazard_of_mortality(sk2,sk6),hazard_of_mortality(sk2,sk5)). [resolve(112,c,148,a),unit_del(a,161),unit_del(b,115)].
% 0.47/1.06 197 hazard_of_mortality(sk2,sk3) != hazard_of_mortality(sk2,sk4). [back_unit_del(193),unit_del(a,194)].
% 0.47/1.06 198 -has_immunity(sk2,sk3). [ur(64,b,116,a,c,197,a)].
% 0.47/1.06 200 -smaller_or_equal(age(sk2,sk3),eta). [ur(76,b,198,a)].
% 0.47/1.06 201 greater(age(sk2,sk3),eta) | age(sk2,sk3) = eta. [resolve(200,a,127,a),flip(b)].
% 0.47/1.06 203 age(sk2,sk3) != eta. [ur(57,b,200,a)].
% 0.47/1.06 204 greater(age(sk2,sk3),eta). [back_unit_del(201),unit_del(b,203)].
% 0.47/1.06 209 -greater(age(sk2,sk4),age(sk2,sk3)). [ur(61,b,204,a,c,136,a)].
% 0.47/1.06 210 age(sk2,sk3) = age(sk2,sk4). [back_unit_del(130),unit_del(b,209)].
% 0.47/1.06 215 $F. [back_rewrite(204),rewrite([210(3)]),unit_del(a,136)].
% 0.47/1.06
% 0.47/1.06 % SZS output end Refutation
% 0.47/1.06 ============================== end of proof ==========================
% 0.47/1.06
% 0.47/1.06 ============================== STATISTICS ============================
% 0.47/1.06
% 0.47/1.06 Given=86. Generated=365. Kept=158. proofs=1.
% 0.47/1.06 Usable=82. Sos=44. Demods=2. Limbo=5, Disabled=119. Hints=0.
% 0.47/1.06 Megabytes=0.26.
% 0.47/1.06 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.47/1.06
% 0.47/1.06 ============================== end of statistics =====================
% 0.47/1.06
% 0.47/1.06 ============================== end of search =========================
% 0.47/1.06
% 0.47/1.06 THEOREM PROVED
% 0.47/1.06 % SZS status Unsatisfiable
% 0.47/1.06
% 0.47/1.06 Exiting with 1 proof.
% 0.47/1.06
% 0.47/1.06 Process 27232 exit (max_proofs) Thu Jun 9 09:42:35 2022
% 0.47/1.06 Prover9 interrupted
%------------------------------------------------------------------------------