TSTP Solution File: MGT024-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT024-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:54 EDT 2022
% Result : Unsatisfiable 0.75s 1.02s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT024-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n023.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 09:38:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.75/1.02 ============================== Prover9 ===============================
% 0.75/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.02 Process 26017 was started by sandbox on n023.cluster.edu,
% 0.75/1.02 Thu Jun 9 09:38:53 2022
% 0.75/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25635_n023.cluster.edu".
% 0.75/1.02 ============================== end of head ===========================
% 0.75/1.02
% 0.75/1.02 ============================== INPUT =================================
% 0.75/1.02
% 0.75/1.02 % Reading from file /tmp/Prover9_25635_n023.cluster.edu
% 0.75/1.02
% 0.75/1.02 set(prolog_style_variables).
% 0.75/1.02 set(auto2).
% 0.75/1.02 % set(auto2) -> set(auto).
% 0.75/1.02 % set(auto) -> set(auto_inference).
% 0.75/1.02 % set(auto) -> set(auto_setup).
% 0.75/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.02 % set(auto) -> set(auto_limits).
% 0.75/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.02 % set(auto) -> set(auto_denials).
% 0.75/1.02 % set(auto) -> set(auto_process).
% 0.75/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.02 % set(auto2) -> assign(stats, some).
% 0.75/1.02 % set(auto2) -> clear(echo_input).
% 0.75/1.02 % set(auto2) -> set(quiet).
% 0.75/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.02 % set(auto2) -> clear(print_given).
% 0.75/1.02 assign(lrs_ticks,-1).
% 0.75/1.02 assign(sos_limit,10000).
% 0.75/1.02 assign(order,kbo).
% 0.75/1.02 set(lex_order_vars).
% 0.75/1.02 clear(print_given).
% 0.75/1.02
% 0.75/1.02 % formulas(sos). % not echoed (21 formulas)
% 0.75/1.02
% 0.75/1.02 ============================== end of input ==========================
% 0.75/1.02
% 0.75/1.02 % From the command line: assign(max_seconds, 300).
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.02
% 0.75/1.02 % Formulas that are not ordinary clauses:
% 0.75/1.02
% 0.75/1.02 ============================== end of process non-clausal formulas ===
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.02
% 0.75/1.02 ============================== PREDICATE ELIMINATION =================
% 0.75/1.02 1 -environment(A) | -greater_or_equal(B,equilibrium(A)) | -greater(equilibrium(A),B) # label(mp_equilibrium_26) # label(axiom). [assumption].
% 0.75/1.02 2 environment(sk1) # label(prove_l6_39) # label(negated_conjecture). [assumption].
% 0.75/1.02 Derived: -greater_or_equal(A,equilibrium(sk1)) | -greater(equilibrium(sk1),A). [resolve(1,a,2,a)].
% 0.75/1.02 3 -environment(A) | -in_environment(A,B) | -decreases(resources(A,B)) | -decreases(number_of_organizations(A,B)) # label(a6_29) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -in_environment(sk1,A) | -decreases(resources(sk1,A)) | -decreases(number_of_organizations(sk1,A)). [resolve(3,a,2,a)].
% 0.75/1.02 4 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occur_24) # label(axiom). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | in_environment(sk1,A). [resolve(4,a,2,a)].
% 0.75/1.02 5 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater(number_of_organizations(A,B),zero) # label(mp_positive_number_of_organizations_25) # label(axiom). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | greater(number_of_organizations(sk1,A),zero). [resolve(5,a,2,a)].
% 0.75/1.02 6 -environment(A) | -in_environment(A,B) | -constant(resources(A,B)) | constant(number_of_organizations(A,B)) # label(a6_30) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -in_environment(sk1,A) | -constant(resources(sk1,A)) | constant(number_of_organizations(sk1,A)). [resolve(6,a,2,a)].
% 0.75/1.02 7 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | -greater(equilibrium(A),B) | decreases(resources(A,B)) # label(a3_27) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -in_environment(sk1,A) | -greater(number_of_organizations(sk1,A),zero) | -greater(equilibrium(sk1),A) | decreases(resources(sk1,A)). [resolve(7,a,2,a)].
% 0.75/1.02 8 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | greater(equilibrium(A),B) | constant(resources(A,B)) # label(a3_28) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -in_environment(sk1,A) | -greater(number_of_organizations(sk1,A),zero) | greater(equilibrium(sk1),A) | constant(resources(sk1,A)). [resolve(8,a,2,a)].
% 0.75/1.02 9 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(growth_rate(efficient_producers,B),zero) # label(l7_31) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(first_movers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(growth_rate(efficient_producers,A),zero). [resolve(9,a,2,a)].
% 0.75/1.02 10 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(zero,growth_rate(first_movers,B)) # label(l7_32) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(first_movers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(zero,growth_rate(first_movers,A)). [resolve(10,a,2,a)].
% 0.75/1.02 11 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(growth_rate(efficient_producers,B),zero) # label(l7_33) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(first_movers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(growth_rate(efficient_producers,A),zero). [resolve(11,a,2,a)].
% 0.75/1.02 12 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(zero,growth_rate(first_movers,B)) # label(l7_34) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(first_movers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(zero,growth_rate(first_movers,A)). [resolve(12,a,2,a)].
% 0.75/1.02 13 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(growth_rate(efficient_producers,B),zero) # label(l7_35) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(efficient_producers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(growth_rate(efficient_producers,A),zero). [resolve(13,a,2,a)].
% 0.75/1.02 14 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(zero,growth_rate(first_movers,B)) # label(l7_36) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(efficient_producers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(zero,growth_rate(first_movers,A)). [resolve(14,a,2,a)].
% 0.75/1.02 15 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(growth_rate(efficient_producers,B),zero) # label(l7_37) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(efficient_producers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(growth_rate(efficient_producers,A),zero). [resolve(15,a,2,a)].
% 0.75/1.02 16 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(zero,growth_rate(first_movers,B)) # label(l7_38) # label(hypothesis). [assumption].
% 0.75/1.02 Derived: -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(efficient_producers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(zero,growth_rate(first_movers,A)). [resolve(16,a,2,a)].
% 0.75/1.02
% 0.75/1.02 ============================== end predicate elimination =============
% 0.75/1.02
% 0.75/1.02 Auto_denials: (non-Horn, no changes).
% 0.75/1.02
% 0.75/1.02 Term ordering decisions:
% 0.75/1.02
% 0.75/1.02 % Assigning unary symbol equilibrium kb_weight 0 and highest precedence (16).
% 0.75/1.02 Function symbol KB weights: sk1=1. zero=1. efficient_producers=1. first_movers=1. sk2=1. growth_rate=1. number_of_organizations=1. resources=1. equilibrium=0.
% 0.75/1.02
% 0.75/1.02 ============================== end of process initial clauses ========
% 0.75/1.02
% 0.75/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.02
% 0.75/1.02 ============================== end of clauses for search =============
% 0.75/1.02
% 0.75/1.02 ============================== SEARCH ================================
% 0.75/1.02
% 0.75/1.02 % Starting search at 0.01 seconds.
% 0.75/1.02
% 0.75/1.02 ============================== PROOF =================================
% 0.75/1.02 % SZS status Unsatisfiable
% 0.75/1.02 % SZS output start Refutation
% 0.75/1.02
% 0.75/1.02 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.75/1.02 % Length of proof is 68.
% 0.75/1.02 % Level of proof is 14.
% 0.75/1.02 % Maximum clause weight is 24.000.
% 0.75/1.02 % Given clauses 42.
% 0.75/1.02
% 0.75/1.02 1 -environment(A) | -greater_or_equal(B,equilibrium(A)) | -greater(equilibrium(A),B) # label(mp_equilibrium_26) # label(axiom). [assumption].
% 0.75/1.02 2 environment(sk1) # label(prove_l6_39) # label(negated_conjecture). [assumption].
% 0.75/1.02 4 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occur_24) # label(axiom). [assumption].
% 0.75/1.02 5 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater(number_of_organizations(A,B),zero) # label(mp_positive_number_of_organizations_25) # label(axiom). [assumption].
% 0.75/1.02 6 -environment(A) | -in_environment(A,B) | -constant(resources(A,B)) | constant(number_of_organizations(A,B)) # label(a6_30) # label(hypothesis). [assumption].
% 0.75/1.02 8 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | greater(equilibrium(A),B) | constant(resources(A,B)) # label(a3_28) # label(hypothesis). [assumption].
% 0.75/1.02 10 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(zero,growth_rate(first_movers,B)) # label(l7_32) # label(hypothesis). [assumption].
% 0.75/1.03 11 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(growth_rate(efficient_producers,B),zero) # label(l7_33) # label(hypothesis). [assumption].
% 0.75/1.03 12 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(zero,growth_rate(first_movers,B)) # label(l7_34) # label(hypothesis). [assumption].
% 0.75/1.03 13 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(growth_rate(efficient_producers,B),zero) # label(l7_35) # label(hypothesis). [assumption].
% 0.75/1.03 14 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(zero,growth_rate(first_movers,B)) # label(l7_36) # label(hypothesis). [assumption].
% 0.75/1.03 15 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(growth_rate(efficient_producers,B),zero) # label(l7_37) # label(hypothesis). [assumption].
% 0.75/1.03 16 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(zero,growth_rate(first_movers,B)) # label(l7_38) # label(hypothesis). [assumption].
% 0.75/1.03 17 greater_or_equal(sk2,equilibrium(sk1)) # label(prove_l6_41) # label(negated_conjecture). [assumption].
% 0.75/1.03 18 subpopulations(first_movers,efficient_producers,sk1,sk2) # label(prove_l6_40) # label(negated_conjecture). [assumption].
% 0.75/1.03 19 growth_rate(first_movers,sk2) != zero | growth_rate(efficient_producers,sk2) != zero # label(prove_l6_42) # label(negated_conjecture). [assumption].
% 0.75/1.03 20 -greater(growth_rate(first_movers,sk2),zero) | -greater(zero,growth_rate(efficient_producers,sk2)) # label(prove_l6_43) # label(negated_conjecture). [assumption].
% 0.75/1.03 21 -greater(growth_rate(efficient_producers,sk2),zero) | -greater(zero,growth_rate(first_movers,sk2)) # label(prove_l6_44) # label(negated_conjecture). [assumption].
% 0.75/1.03 22 -greater_or_equal(A,equilibrium(sk1)) | -greater(equilibrium(sk1),A). [resolve(1,a,2,a)].
% 0.75/1.03 24 -subpopulations(first_movers,efficient_producers,sk1,A) | in_environment(sk1,A). [resolve(4,a,2,a)].
% 0.75/1.03 25 -subpopulations(first_movers,efficient_producers,sk1,A) | greater(number_of_organizations(sk1,A),zero). [resolve(5,a,2,a)].
% 0.75/1.03 26 -in_environment(sk1,A) | -constant(resources(sk1,A)) | constant(number_of_organizations(sk1,A)). [resolve(6,a,2,a)].
% 0.75/1.03 28 -in_environment(sk1,A) | -greater(number_of_organizations(sk1,A),zero) | greater(equilibrium(sk1),A) | constant(resources(sk1,A)). [resolve(8,a,2,a)].
% 0.75/1.03 30 -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(first_movers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(zero,growth_rate(first_movers,A)). [resolve(10,a,2,a)].
% 0.75/1.03 31 -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(first_movers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(growth_rate(efficient_producers,A),zero). [resolve(11,a,2,a)].
% 0.75/1.03 32 -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(first_movers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(zero,growth_rate(first_movers,A)). [resolve(12,a,2,a)].
% 0.75/1.03 33 -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(efficient_producers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(growth_rate(efficient_producers,A),zero). [resolve(13,a,2,a)].
% 0.75/1.03 34 -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(efficient_producers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(zero,growth_rate(first_movers,A)). [resolve(14,a,2,a)].
% 0.75/1.03 35 -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(efficient_producers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(growth_rate(efficient_producers,A),zero). [resolve(15,a,2,a)].
% 0.75/1.03 36 -subpopulations(first_movers,efficient_producers,sk1,A) | -constant(number_of_organizations(sk1,A)) | growth_rate(efficient_producers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(zero,growth_rate(first_movers,A)). [resolve(16,a,2,a)].
% 0.75/1.03 37 -greater(equilibrium(sk1),sk2). [resolve(22,a,17,a)].
% 0.75/1.03 38 in_environment(sk1,sk2). [resolve(24,a,18,a)].
% 0.75/1.03 39 greater(number_of_organizations(sk1,sk2),zero). [resolve(25,a,18,a)].
% 0.75/1.03 41 -constant(number_of_organizations(sk1,sk2)) | growth_rate(first_movers,sk2) = zero | greater(growth_rate(first_movers,sk2),zero) | greater(zero,growth_rate(first_movers,sk2)). [resolve(30,a,18,a)].
% 0.75/1.03 42 -constant(number_of_organizations(sk1,sk2)) | growth_rate(first_movers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | greater(growth_rate(efficient_producers,sk2),zero). [resolve(31,a,18,a)].
% 0.75/1.03 43 -constant(number_of_organizations(sk1,sk2)) | growth_rate(first_movers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | greater(zero,growth_rate(first_movers,sk2)). [resolve(32,a,18,a)].
% 0.75/1.03 44 -constant(number_of_organizations(sk1,sk2)) | growth_rate(efficient_producers,sk2) = zero | greater(growth_rate(first_movers,sk2),zero) | greater(growth_rate(efficient_producers,sk2),zero). [resolve(33,a,18,a)].
% 0.75/1.03 45 -constant(number_of_organizations(sk1,sk2)) | growth_rate(efficient_producers,sk2) = zero | greater(growth_rate(first_movers,sk2),zero) | greater(zero,growth_rate(first_movers,sk2)). [resolve(34,a,18,a)].
% 0.75/1.03 46 -constant(number_of_organizations(sk1,sk2)) | growth_rate(efficient_producers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | greater(growth_rate(efficient_producers,sk2),zero). [resolve(35,a,18,a)].
% 0.75/1.03 47 -constant(number_of_organizations(sk1,sk2)) | growth_rate(efficient_producers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | greater(zero,growth_rate(first_movers,sk2)). [resolve(36,a,18,a)].
% 0.75/1.03 48 constant(resources(sk1,sk2)). [resolve(38,a,28,a),unit_del(a,39),unit_del(b,37)].
% 0.75/1.03 49 constant(number_of_organizations(sk1,sk2)). [resolve(38,a,26,a),unit_del(a,48)].
% 0.75/1.03 51 growth_rate(efficient_producers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | greater(zero,growth_rate(first_movers,sk2)). [back_unit_del(47),unit_del(a,49)].
% 0.75/1.03 52 growth_rate(efficient_producers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | greater(growth_rate(efficient_producers,sk2),zero). [back_unit_del(46),unit_del(a,49)].
% 0.75/1.03 53 growth_rate(efficient_producers,sk2) = zero | greater(growth_rate(first_movers,sk2),zero) | greater(zero,growth_rate(first_movers,sk2)). [back_unit_del(45),unit_del(a,49)].
% 0.75/1.03 54 growth_rate(efficient_producers,sk2) = zero | greater(growth_rate(first_movers,sk2),zero) | greater(growth_rate(efficient_producers,sk2),zero). [back_unit_del(44),unit_del(a,49)].
% 0.75/1.03 55 growth_rate(first_movers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | greater(zero,growth_rate(first_movers,sk2)). [back_unit_del(43),unit_del(a,49)].
% 0.75/1.03 56 growth_rate(first_movers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | greater(growth_rate(efficient_producers,sk2),zero). [back_unit_del(42),unit_del(a,49)].
% 0.75/1.03 57 growth_rate(first_movers,sk2) = zero | greater(growth_rate(first_movers,sk2),zero) | greater(zero,growth_rate(first_movers,sk2)). [back_unit_del(41),unit_del(a,49)].
% 0.75/1.03 59 growth_rate(efficient_producers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | -greater(zero,growth_rate(first_movers,sk2)). [resolve(52,c,21,a)].
% 0.75/1.03 60 growth_rate(efficient_producers,sk2) = zero | greater(zero,growth_rate(first_movers,sk2)) | -greater(zero,growth_rate(efficient_producers,sk2)). [resolve(53,b,20,a)].
% 0.75/1.03 61 growth_rate(efficient_producers,sk2) = zero | greater(growth_rate(efficient_producers,sk2),zero) | -greater(zero,growth_rate(efficient_producers,sk2)). [resolve(54,b,20,a)].
% 0.75/1.03 62 growth_rate(first_movers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)) | -greater(zero,growth_rate(first_movers,sk2)). [resolve(56,c,21,a)].
% 0.75/1.03 63 growth_rate(first_movers,sk2) = zero | greater(zero,growth_rate(first_movers,sk2)) | -greater(zero,growth_rate(efficient_producers,sk2)). [resolve(57,b,20,a)].
% 0.75/1.03 66 growth_rate(efficient_producers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)). [resolve(59,c,51,c),merge(c),merge(d)].
% 0.75/1.03 67 growth_rate(efficient_producers,sk2) = zero | greater(zero,growth_rate(first_movers,sk2)). [resolve(66,b,60,c),merge(b)].
% 0.75/1.03 68 growth_rate(efficient_producers,sk2) = zero | greater(growth_rate(efficient_producers,sk2),zero). [resolve(61,c,66,b),merge(c)].
% 0.75/1.03 69 growth_rate(efficient_producers,sk2) = zero | -greater(zero,growth_rate(first_movers,sk2)). [resolve(68,b,21,a)].
% 0.75/1.03 70 growth_rate(first_movers,sk2) = zero | greater(zero,growth_rate(efficient_producers,sk2)). [resolve(62,c,55,c),merge(c),merge(d)].
% 0.75/1.03 71 growth_rate(efficient_producers,sk2) = zero. [resolve(69,b,67,b),merge(b)].
% 0.75/1.03 72 growth_rate(first_movers,sk2) = zero | greater(zero,zero). [back_rewrite(70),rewrite([71(9)])].
% 0.75/1.03 73 growth_rate(first_movers,sk2) = zero | greater(zero,growth_rate(first_movers,sk2)) | -greater(zero,zero). [back_rewrite(63),rewrite([71(14)])].
% 0.75/1.03 74 -greater(zero,zero) | -greater(zero,growth_rate(first_movers,sk2)). [back_rewrite(21),rewrite([71(3)])].
% 0.75/1.03 76 growth_rate(first_movers,sk2) != zero. [back_rewrite(19),rewrite([71(8)]),xx(b)].
% 0.75/1.03 77 greater(zero,growth_rate(first_movers,sk2)) | -greater(zero,zero). [back_unit_del(73),unit_del(a,76)].
% 0.75/1.03 78 greater(zero,zero). [back_unit_del(72),unit_del(a,76)].
% 0.75/1.03 80 greater(zero,growth_rate(first_movers,sk2)). [back_unit_del(77),unit_del(b,78)].
% 0.75/1.03 82 $F. [back_unit_del(74),unit_del(a,78),unit_del(b,80)].
% 0.75/1.03
% 0.75/1.03 % SZS output end Refutation
% 0.75/1.03 ============================== end of proof ==========================
% 0.75/1.03
% 0.75/1.03 ============================== STATISTICS ============================
% 0.75/1.03
% 0.75/1.03 Given=42. Generated=71. Kept=65. proofs=1.
% 0.75/1.03 Usable=23. Sos=2. Demods=1. Limbo=4, Disabled=72. Hints=0.
% 0.75/1.03 Megabytes=0.10.
% 0.75/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.75/1.03
% 0.75/1.03 ============================== end of statistics =====================
% 0.75/1.03
% 0.75/1.03 ============================== end of search =========================
% 0.75/1.03
% 0.75/1.03 THEOREM PROVED
% 0.75/1.03 % SZS status Unsatisfiable
% 0.75/1.03
% 0.75/1.03 Exiting with 1 proof.
% 0.75/1.03
% 0.75/1.03 Process 26017 exit (max_proofs) Thu Jun 9 09:38:53 2022
% 0.75/1.03 Prover9 interrupted
%------------------------------------------------------------------------------