TSTP Solution File: MGT037-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT037-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:22:59 EDT 2022
% Result : Unsatisfiable 0.47s 1.02s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT037-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 08:08:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.47/1.01 ============================== Prover9 ===============================
% 0.47/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.01 Process 19644 was started by sandbox on n021.cluster.edu,
% 0.47/1.01 Thu Jun 9 08:08:08 2022
% 0.47/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_19491_n021.cluster.edu".
% 0.47/1.01 ============================== end of head ===========================
% 0.47/1.01
% 0.47/1.01 ============================== INPUT =================================
% 0.47/1.01
% 0.47/1.01 % Reading from file /tmp/Prover9_19491_n021.cluster.edu
% 0.47/1.01
% 0.47/1.01 set(prolog_style_variables).
% 0.47/1.01 set(auto2).
% 0.47/1.01 % set(auto2) -> set(auto).
% 0.47/1.01 % set(auto) -> set(auto_inference).
% 0.47/1.01 % set(auto) -> set(auto_setup).
% 0.47/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.01 % set(auto) -> set(auto_limits).
% 0.47/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.01 % set(auto) -> set(auto_denials).
% 0.47/1.01 % set(auto) -> set(auto_process).
% 0.47/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.01 % set(auto2) -> assign(stats, some).
% 0.47/1.01 % set(auto2) -> clear(echo_input).
% 0.47/1.01 % set(auto2) -> set(quiet).
% 0.47/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.01 % set(auto2) -> clear(print_given).
% 0.47/1.01 assign(lrs_ticks,-1).
% 0.47/1.01 assign(sos_limit,10000).
% 0.47/1.01 assign(order,kbo).
% 0.47/1.01 set(lex_order_vars).
% 0.47/1.01 clear(print_given).
% 0.47/1.01
% 0.47/1.01 % formulas(sos). % not echoed (27 formulas)
% 0.47/1.01
% 0.47/1.01 ============================== end of input ==========================
% 0.47/1.01
% 0.47/1.01 % From the command line: assign(max_seconds, 300).
% 0.47/1.01
% 0.47/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.01
% 0.47/1.01 % Formulas that are not ordinary clauses:
% 0.47/1.01
% 0.47/1.01 ============================== end of process non-clausal formulas ===
% 0.47/1.01
% 0.47/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.01
% 0.47/1.01 ============================== PREDICATE ELIMINATION =================
% 0.47/1.01 1 -environment(A) | -in_environment(A,B) | -decreases(resources(A,B)) | -decreases(number_of_organizations(A,B)) # label(a6_46) # label(hypothesis). [assumption].
% 0.47/1.01 2 environment(sk3) # label(prove_t6_51) # label(negated_conjecture). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | -decreases(resources(sk3,A)) | -decreases(number_of_organizations(sk3,A)). [resolve(1,a,2,a)].
% 0.47/1.01 3 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations_37) # label(axiom). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | subpopulation(first_movers,sk3,A). [resolve(3,a,2,a)].
% 0.47/1.01 4 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations_38) # label(axiom). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | subpopulation(efficient_producers,sk3,A). [resolve(4,a,2,a)].
% 0.47/1.01 5 -environment(A) | -in_environment(A,B) | -constant(resources(A,B)) | constant(number_of_organizations(A,B)) # label(a6_47) # label(hypothesis). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | -constant(resources(sk3,A)) | constant(number_of_organizations(sk3,A)). [resolve(5,a,2,a)].
% 0.47/1.01 6 -environment(A) | -in_environment(A,B) | -greater(appear(an_organisation,A),B) | number_of_organizations(A,B) = zero # label(mp_start_of_organizations_32) # label(axiom). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | -greater(appear(an_organisation,sk3),A) | number_of_organizations(sk3,A) = zero. [resolve(6,a,2,a)].
% 0.47/1.01 7 -environment(A) | -in_environment(A,B) | decreases(number_of_organizations(A,B)) | subpopulation(sk2(B,A),A,B) # label(mp_non_decreasing_33) # label(axiom). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | decreases(number_of_organizations(sk3,A)) | subpopulation(sk2(A,sk3),sk3,A). [resolve(7,a,2,a)].
% 0.47/1.01 8 -environment(A) | -in_environment(A,B) | cardinality_at_time(efficient_producers,B) = zero | greater(cardinality_at_time(efficient_producers,B),zero) # label(mp_efficient_producers_exist_40) # label(axiom). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | cardinality_at_time(efficient_producers,A) = zero | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(8,a,2,a)].
% 0.47/1.01 9 -environment(A) | -in_environment(A,B) | greater_or_equal(B,appear(an_organisation,A)) | greater(appear(an_organisation,A),B) # label(mp_environment_inequality_42) # label(axiom). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | greater_or_equal(A,appear(an_organisation,sk3)) | greater(appear(an_organisation,sk3),A). [resolve(9,a,2,a)].
% 0.47/1.01 10 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(an_organisation,A)) | greater(number_of_organizations(A,B),zero) # label(a1_45) # label(hypothesis). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | -greater_or_equal(A,appear(an_organisation,sk3)) | greater(number_of_organizations(sk3,A),zero). [resolve(10,a,2,a)].
% 0.47/1.01 11 -environment(A) | -in_environment(A,B) | decreases(number_of_organizations(A,B)) | greater(cardinality_at_time(sk2(B,A),B),zero) # label(mp_non_decreasing_34) # label(axiom). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | decreases(number_of_organizations(sk3,A)) | greater(cardinality_at_time(sk2(A,sk3),A),zero). [resolve(11,a,2,a)].
% 0.47/1.01 12 -environment(A) | -in_environment(A,B) | decreases(number_of_organizations(A,B)) | -greater(zero,growth_rate(sk2(B,A),B)) # label(mp_non_decreasing_35) # label(axiom). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | decreases(number_of_organizations(sk3,A)) | -greater(zero,growth_rate(sk2(A,sk3),A)). [resolve(12,a,2,a)].
% 0.47/1.01 13 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | in_environment(A,sk1(B,A)) # label(mp_previous_negative_growth_29) # label(axiom). [assumption].
% 0.47/1.01 Derived: -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | in_environment(sk3,sk1(A,sk3)). [resolve(13,a,2,a)].
% 0.47/1.01 14 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | greater(B,sk1(B,A)) # label(mp_previous_negative_growth_30) # label(axiom). [assumption].
% 0.47/1.01 Derived: -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | greater(A,sk1(A,sk3)). [resolve(14,a,2,a)].
% 0.47/1.01 15 -environment(A) | -subpopulation(B,A,C) | -greater(cardinality_at_time(B,C),zero) | B = efficient_producers | B = first_movers # label(a9_50) # label(hypothesis). [assumption].
% 0.47/1.01 Derived: -subpopulation(A,sk3,B) | -greater(cardinality_at_time(A,B),zero) | A = efficient_producers | A = first_movers. [resolve(15,a,2,a)].
% 0.47/1.01 16 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | -greater(equilibrium(A),B) | decreases(resources(A,B)) # label(a3_43) # label(hypothesis). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | -greater(number_of_organizations(sk3,A),zero) | -greater(equilibrium(sk3),A) | decreases(resources(sk3,A)). [resolve(16,a,2,a)].
% 0.47/1.01 17 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | greater(equilibrium(A),B) | constant(resources(A,B)) # label(a3_44) # label(hypothesis). [assumption].
% 0.47/1.01 Derived: -in_environment(sk3,A) | -greater(number_of_organizations(sk3,A),zero) | greater(equilibrium(sk3),A) | constant(resources(sk3,A)). [resolve(17,a,2,a)].
% 0.47/1.01 18 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | greater(sk1(B,A),appear(efficient_producers,A)) # label(mp_previous_negative_growth_28) # label(axiom). [assumption].
% 0.47/1.01 Derived: -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | greater(sk1(A,sk3),appear(efficient_producers,sk3)). [resolve(18,a,2,a)].
% 0.47/1.01 19 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | greater(zero,growth_rate(efficient_producers,sk1(B,A))) # label(mp_previous_negative_growth_31) # label(axiom). [assumption].
% 0.47/1.02 Derived: -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | greater(zero,growth_rate(efficient_producers,sk1(A,sk3))). [resolve(19,a,2,a)].
% 0.47/1.02 20 -environment(A) | -in_environment(A,B) | number_of_organizations(A,B) != zero | -subpopulation(C,A,B) | cardinality_at_time(C,B) = zero # label(mp_no_members_36) # label(axiom). [assumption].
% 0.47/1.02 Derived: -in_environment(sk3,A) | number_of_organizations(sk3,A) != zero | -subpopulation(B,sk3,A) | cardinality_at_time(B,A) = zero. [resolve(20,a,2,a)].
% 0.47/1.02 21 -environment(A) | -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) # label(a12_48) # label(hypothesis). [assumption].
% 0.47/1.02 Derived: -in_environment(sk3,A) | greater(zero,growth_rate(B,A)) | -greater(resilience(C),resilience(B)) | -greater(zero,growth_rate(C,A)). [resolve(21,a,2,a)].
% 0.47/1.02
% 0.47/1.02 ============================== end predicate elimination =============
% 0.47/1.02
% 0.47/1.02 Auto_denials: (non-Horn, no changes).
% 0.47/1.02
% 0.47/1.02 Term ordering decisions:
% 0.47/1.02 Function symbol KB weights: sk3=1. zero=1. efficient_producers=1. an_organisation=1. first_movers=1. sk4=1. appear=1. cardinality_at_time=1. number_of_organizations=1. growth_rate=1. sk1=1. resources=1. sk2=1. resilience=1. equilibrium=1.
% 0.47/1.02
% 0.47/1.02 ============================== end of process initial clauses ========
% 0.47/1.02
% 0.47/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.02
% 0.47/1.02 ============================== end of clauses for search =============
% 0.47/1.02
% 0.47/1.02 ============================== SEARCH ================================
% 0.47/1.02
% 0.47/1.02 % Starting search at 0.02 seconds.
% 0.47/1.02
% 0.47/1.02 ============================== PROOF =================================
% 0.47/1.02 % SZS status Unsatisfiable
% 0.47/1.02 % SZS output start Refutation
% 0.47/1.02
% 0.47/1.02 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.47/1.02 % Length of proof is 80.
% 0.47/1.02 % Level of proof is 23.
% 0.47/1.02 % Maximum clause weight is 31.000.
% 0.47/1.02 % Given clauses 93.
% 0.47/1.02
% 0.47/1.02 1 -environment(A) | -in_environment(A,B) | -decreases(resources(A,B)) | -decreases(number_of_organizations(A,B)) # label(a6_46) # label(hypothesis). [assumption].
% 0.47/1.02 2 environment(sk3) # label(prove_t6_51) # label(negated_conjecture). [assumption].
% 0.47/1.02 4 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations_38) # label(axiom). [assumption].
% 0.47/1.02 5 -environment(A) | -in_environment(A,B) | -constant(resources(A,B)) | constant(number_of_organizations(A,B)) # label(a6_47) # label(hypothesis). [assumption].
% 0.47/1.02 6 -environment(A) | -in_environment(A,B) | -greater(appear(an_organisation,A),B) | number_of_organizations(A,B) = zero # label(mp_start_of_organizations_32) # label(axiom). [assumption].
% 0.47/1.02 7 -environment(A) | -in_environment(A,B) | decreases(number_of_organizations(A,B)) | subpopulation(sk2(B,A),A,B) # label(mp_non_decreasing_33) # label(axiom). [assumption].
% 0.47/1.02 8 -environment(A) | -in_environment(A,B) | cardinality_at_time(efficient_producers,B) = zero | greater(cardinality_at_time(efficient_producers,B),zero) # label(mp_efficient_producers_exist_40) # label(axiom). [assumption].
% 0.47/1.02 9 -environment(A) | -in_environment(A,B) | greater_or_equal(B,appear(an_organisation,A)) | greater(appear(an_organisation,A),B) # label(mp_environment_inequality_42) # label(axiom). [assumption].
% 0.47/1.02 10 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(an_organisation,A)) | greater(number_of_organizations(A,B),zero) # label(a1_45) # label(hypothesis). [assumption].
% 0.47/1.02 11 -environment(A) | -in_environment(A,B) | decreases(number_of_organizations(A,B)) | greater(cardinality_at_time(sk2(B,A),B),zero) # label(mp_non_decreasing_34) # label(axiom). [assumption].
% 0.47/1.02 12 -environment(A) | -in_environment(A,B) | decreases(number_of_organizations(A,B)) | -greater(zero,growth_rate(sk2(B,A),B)) # label(mp_non_decreasing_35) # label(axiom). [assumption].
% 0.47/1.02 13 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | in_environment(A,sk1(B,A)) # label(mp_previous_negative_growth_29) # label(axiom). [assumption].
% 0.47/1.02 15 -environment(A) | -subpopulation(B,A,C) | -greater(cardinality_at_time(B,C),zero) | B = efficient_producers | B = first_movers # label(a9_50) # label(hypothesis). [assumption].
% 0.47/1.02 16 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | -greater(equilibrium(A),B) | decreases(resources(A,B)) # label(a3_43) # label(hypothesis). [assumption].
% 0.47/1.02 17 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | greater(equilibrium(A),B) | constant(resources(A,B)) # label(a3_44) # label(hypothesis). [assumption].
% 0.47/1.02 19 -environment(A) | -greater_or_equal(B,appear(efficient_producers,A)) | cardinality_at_time(efficient_producers,B) != zero | greater(zero,growth_rate(efficient_producers,sk1(B,A))) # label(mp_previous_negative_growth_31) # label(axiom). [assumption].
% 0.47/1.02 20 -environment(A) | -in_environment(A,B) | number_of_organizations(A,B) != zero | -subpopulation(C,A,B) | cardinality_at_time(C,B) = zero # label(mp_no_members_36) # label(axiom). [assumption].
% 0.47/1.02 21 -environment(A) | -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) # label(a12_48) # label(hypothesis). [assumption].
% 0.47/1.02 22 in_environment(sk3,sk4) # label(prove_t6_52) # label(negated_conjecture). [assumption].
% 0.47/1.02 23 greater(resilience(efficient_producers),resilience(first_movers)) # label(a2_49) # label(hypothesis). [assumption].
% 0.47/1.02 24 greater_or_equal(sk4,appear(efficient_producers,sk3)) # label(prove_t6_53) # label(negated_conjecture). [assumption].
% 0.47/1.02 25 -constant(A) | -decreases(A) # label(mp_constant_not_decrease_41) # label(axiom). [assumption].
% 0.47/1.02 26 -greater(cardinality_at_time(efficient_producers,sk4),zero) # label(prove_t6_54) # label(negated_conjecture). [assumption].
% 0.47/1.02 27 cardinality_at_time(A,B) != zero | -greater(zero,growth_rate(A,B)) # label(mp_empty_not_decreasing_39) # label(axiom). [assumption].
% 0.47/1.02 28 -in_environment(sk3,A) | -decreases(resources(sk3,A)) | -decreases(number_of_organizations(sk3,A)). [resolve(1,a,2,a)].
% 0.47/1.02 30 -in_environment(sk3,A) | subpopulation(efficient_producers,sk3,A). [resolve(4,a,2,a)].
% 0.47/1.02 31 -in_environment(sk3,A) | -constant(resources(sk3,A)) | constant(number_of_organizations(sk3,A)). [resolve(5,a,2,a)].
% 0.47/1.02 32 -in_environment(sk3,A) | -greater(appear(an_organisation,sk3),A) | number_of_organizations(sk3,A) = zero. [resolve(6,a,2,a)].
% 0.47/1.02 33 -in_environment(sk3,A) | decreases(number_of_organizations(sk3,A)) | subpopulation(sk2(A,sk3),sk3,A). [resolve(7,a,2,a)].
% 0.47/1.02 34 -in_environment(sk3,A) | cardinality_at_time(efficient_producers,A) = zero | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(8,a,2,a)].
% 0.47/1.02 35 -in_environment(sk3,A) | greater_or_equal(A,appear(an_organisation,sk3)) | greater(appear(an_organisation,sk3),A). [resolve(9,a,2,a)].
% 0.47/1.02 36 -in_environment(sk3,A) | -greater_or_equal(A,appear(an_organisation,sk3)) | greater(number_of_organizations(sk3,A),zero). [resolve(10,a,2,a)].
% 0.47/1.02 37 -in_environment(sk3,A) | decreases(number_of_organizations(sk3,A)) | greater(cardinality_at_time(sk2(A,sk3),A),zero). [resolve(11,a,2,a)].
% 0.47/1.02 38 -in_environment(sk3,A) | decreases(number_of_organizations(sk3,A)) | -greater(zero,growth_rate(sk2(A,sk3),A)). [resolve(12,a,2,a)].
% 0.47/1.02 39 -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | in_environment(sk3,sk1(A,sk3)). [resolve(13,a,2,a)].
% 0.47/1.02 41 -subpopulation(A,sk3,B) | -greater(cardinality_at_time(A,B),zero) | A = efficient_producers | A = first_movers. [resolve(15,a,2,a)].
% 0.47/1.02 42 -subpopulation(A,sk3,B) | -greater(cardinality_at_time(A,B),zero) | efficient_producers = A | first_movers = A. [copy(41),flip(c),flip(d)].
% 0.47/1.02 43 -in_environment(sk3,A) | -greater(number_of_organizations(sk3,A),zero) | -greater(equilibrium(sk3),A) | decreases(resources(sk3,A)). [resolve(16,a,2,a)].
% 0.47/1.02 44 -in_environment(sk3,A) | -greater(number_of_organizations(sk3,A),zero) | greater(equilibrium(sk3),A) | constant(resources(sk3,A)). [resolve(17,a,2,a)].
% 0.47/1.02 46 -greater_or_equal(A,appear(efficient_producers,sk3)) | cardinality_at_time(efficient_producers,A) != zero | greater(zero,growth_rate(efficient_producers,sk1(A,sk3))). [resolve(19,a,2,a)].
% 0.47/1.02 47 -in_environment(sk3,A) | number_of_organizations(sk3,A) != zero | -subpopulation(B,sk3,A) | cardinality_at_time(B,A) = zero. [resolve(20,a,2,a)].
% 0.47/1.02 48 -in_environment(sk3,A) | greater(zero,growth_rate(B,A)) | -greater(resilience(C),resilience(B)) | -greater(zero,growth_rate(C,A)). [resolve(21,a,2,a)].
% 0.47/1.02 55 cardinality_at_time(efficient_producers,sk4) = zero. [resolve(34,a,22,a),unit_del(b,26)].
% 0.47/1.02 60 in_environment(sk3,sk1(sk4,sk3)). [resolve(39,a,24,a),rewrite([55(3)]),xx(a)].
% 0.47/1.02 65 greater(zero,growth_rate(efficient_producers,sk1(sk4,sk3))). [resolve(46,a,24,a),rewrite([55(3)]),xx(a)].
% 0.47/1.02 69 greater(zero,growth_rate(A,sk1(sk4,sk3))) | -greater(resilience(B),resilience(A)) | -greater(zero,growth_rate(B,sk1(sk4,sk3))). [resolve(60,a,48,a)].
% 0.47/1.02 70 -greater(number_of_organizations(sk3,sk1(sk4,sk3)),zero) | greater(equilibrium(sk3),sk1(sk4,sk3)) | constant(resources(sk3,sk1(sk4,sk3))). [resolve(60,a,44,a)].
% 0.47/1.02 71 -greater(number_of_organizations(sk3,sk1(sk4,sk3)),zero) | -greater(equilibrium(sk3),sk1(sk4,sk3)) | decreases(resources(sk3,sk1(sk4,sk3))). [resolve(60,a,43,a)].
% 0.47/1.02 72 decreases(number_of_organizations(sk3,sk1(sk4,sk3))) | -greater(zero,growth_rate(sk2(sk1(sk4,sk3),sk3),sk1(sk4,sk3))). [resolve(60,a,38,a)].
% 0.47/1.02 73 decreases(number_of_organizations(sk3,sk1(sk4,sk3))) | greater(cardinality_at_time(sk2(sk1(sk4,sk3),sk3),sk1(sk4,sk3)),zero). [resolve(60,a,37,a)].
% 0.47/1.02 74 greater_or_equal(sk1(sk4,sk3),appear(an_organisation,sk3)) | greater(appear(an_organisation,sk3),sk1(sk4,sk3)). [resolve(60,a,35,a)].
% 0.47/1.02 76 decreases(number_of_organizations(sk3,sk1(sk4,sk3))) | subpopulation(sk2(sk1(sk4,sk3),sk3),sk3,sk1(sk4,sk3)). [resolve(60,a,33,a)].
% 0.47/1.02 77 -greater(appear(an_organisation,sk3),sk1(sk4,sk3)) | number_of_organizations(sk3,sk1(sk4,sk3)) = zero. [resolve(60,a,32,a)].
% 0.47/1.02 78 -constant(resources(sk3,sk1(sk4,sk3))) | constant(number_of_organizations(sk3,sk1(sk4,sk3))). [resolve(60,a,31,a)].
% 0.47/1.02 79 subpopulation(efficient_producers,sk3,sk1(sk4,sk3)). [resolve(60,a,30,a)].
% 0.47/1.02 81 -decreases(resources(sk3,sk1(sk4,sk3))) | -decreases(number_of_organizations(sk3,sk1(sk4,sk3))). [resolve(60,a,28,a)].
% 0.47/1.02 82 number_of_organizations(sk3,sk1(sk4,sk3)) != zero | cardinality_at_time(efficient_producers,sk1(sk4,sk3)) = zero. [resolve(79,a,47,c),unit_del(a,60)].
% 0.47/1.02 84 cardinality_at_time(efficient_producers,sk1(sk4,sk3)) != zero. [resolve(65,a,27,b)].
% 0.47/1.02 85 number_of_organizations(sk3,sk1(sk4,sk3)) != zero. [back_unit_del(82),unit_del(b,84)].
% 0.47/1.02 87 -greater(appear(an_organisation,sk3),sk1(sk4,sk3)). [back_unit_del(77),unit_del(b,85)].
% 0.47/1.02 88 greater_or_equal(sk1(sk4,sk3),appear(an_organisation,sk3)). [back_unit_del(74),unit_del(b,87)].
% 0.47/1.02 89 greater(number_of_organizations(sk3,sk1(sk4,sk3)),zero). [resolve(88,a,36,b),unit_del(a,60)].
% 0.47/1.02 90 -greater(equilibrium(sk3),sk1(sk4,sk3)) | decreases(resources(sk3,sk1(sk4,sk3))). [back_unit_del(71),unit_del(a,89)].
% 0.47/1.02 91 greater(equilibrium(sk3),sk1(sk4,sk3)) | constant(resources(sk3,sk1(sk4,sk3))). [back_unit_del(70),unit_del(a,89)].
% 0.47/1.02 95 constant(resources(sk3,sk1(sk4,sk3))) | decreases(resources(sk3,sk1(sk4,sk3))). [resolve(91,a,90,a)].
% 0.47/1.02 96 decreases(resources(sk3,sk1(sk4,sk3))) | constant(number_of_organizations(sk3,sk1(sk4,sk3))). [resolve(95,a,78,a)].
% 0.47/1.02 98 decreases(resources(sk3,sk1(sk4,sk3))) | -decreases(number_of_organizations(sk3,sk1(sk4,sk3))). [resolve(96,b,25,a)].
% 0.47/1.02 102 decreases(number_of_organizations(sk3,sk1(sk4,sk3))) | -greater(cardinality_at_time(sk2(sk1(sk4,sk3),sk3),sk1(sk4,sk3)),zero) | sk2(sk1(sk4,sk3),sk3) = efficient_producers | sk2(sk1(sk4,sk3),sk3) = first_movers. [resolve(76,b,42,a),flip(c),flip(d)].
% 0.47/1.02 103 greater(zero,growth_rate(first_movers,sk1(sk4,sk3))). [resolve(69,b,23,a),unit_del(b,65)].
% 0.47/1.02 116 decreases(number_of_organizations(sk3,sk1(sk4,sk3))) | sk2(sk1(sk4,sk3),sk3) = efficient_producers | sk2(sk1(sk4,sk3),sk3) = first_movers. [resolve(102,b,73,b),merge(d)].
% 0.47/1.02 117 sk2(sk1(sk4,sk3),sk3) = efficient_producers | sk2(sk1(sk4,sk3),sk3) = first_movers | decreases(resources(sk3,sk1(sk4,sk3))). [resolve(116,a,98,b)].
% 0.47/1.02 118 sk2(sk1(sk4,sk3),sk3) = efficient_producers | sk2(sk1(sk4,sk3),sk3) = first_movers | -decreases(number_of_organizations(sk3,sk1(sk4,sk3))). [resolve(117,c,81,a)].
% 0.47/1.02 119 sk2(sk1(sk4,sk3),sk3) = efficient_producers | sk2(sk1(sk4,sk3),sk3) = first_movers. [resolve(118,c,116,a),merge(c),merge(d)].
% 0.47/1.02 120 sk2(sk1(sk4,sk3),sk3) = efficient_producers | decreases(number_of_organizations(sk3,sk1(sk4,sk3))). [para(119(b,1),72(b,2,1)),unit_del(c,103)].
% 0.47/1.02 121 sk2(sk1(sk4,sk3),sk3) = efficient_producers | decreases(resources(sk3,sk1(sk4,sk3))). [resolve(120,b,98,b)].
% 0.47/1.02 122 sk2(sk1(sk4,sk3),sk3) = efficient_producers | -decreases(number_of_organizations(sk3,sk1(sk4,sk3))). [resolve(121,b,81,a)].
% 0.47/1.02 123 sk2(sk1(sk4,sk3),sk3) = efficient_producers. [resolve(122,b,120,b),merge(b)].
% 0.47/1.02 124 decreases(number_of_organizations(sk3,sk1(sk4,sk3))). [back_rewrite(72),rewrite([123(12)]),unit_del(b,65)].
% 0.47/1.02 125 decreases(resources(sk3,sk1(sk4,sk3))). [back_unit_del(98),unit_del(b,124)].
% 0.47/1.02 126 $F. [back_unit_del(81),unit_del(a,125),unit_del(b,124)].
% 0.47/1.02
% 0.47/1.02 % SZS output end Refutation
% 0.47/1.02 ============================== end of proof ==========================
% 0.47/1.02
% 0.47/1.02 ============================== STATISTICS ============================
% 0.47/1.02
% 0.47/1.02 Given=93. Generated=127. Kept=103. proofs=1.
% 0.47/1.02 Usable=75. Sos=1. Demods=2. Limbo=2, Disabled=72. Hints=0.
% 0.47/1.02 Megabytes=0.19.
% 0.47/1.02 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.47/1.02
% 0.47/1.02 ============================== end of statistics =====================
% 0.47/1.02
% 0.47/1.02 ============================== end of search =========================
% 0.47/1.02
% 0.47/1.02 THEOREM PROVED
% 0.47/1.02 % SZS status Unsatisfiable
% 0.47/1.02
% 0.47/1.02 Exiting with 1 proof.
% 0.47/1.02
% 0.47/1.02 Process 19644 exit (max_proofs) Thu Jun 9 08:08:08 2022
% 0.47/1.02 Prover9 interrupted
%------------------------------------------------------------------------------