TSTP Solution File: MGT023-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT023-2 : 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:22:54 EDT 2022
% Result : Unsatisfiable 0.67s 0.99s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT023-2 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.33 % Computer : n024.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 09:51:04 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.67/0.97 ============================== Prover9 ===============================
% 0.67/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.97 Process 12371 was started by sandbox2 on n024.cluster.edu,
% 0.67/0.97 Thu Jun 9 09:51:05 2022
% 0.67/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_12218_n024.cluster.edu".
% 0.67/0.97 ============================== end of head ===========================
% 0.67/0.97
% 0.67/0.97 ============================== INPUT =================================
% 0.67/0.97
% 0.67/0.97 % Reading from file /tmp/Prover9_12218_n024.cluster.edu
% 0.67/0.97
% 0.67/0.97 set(prolog_style_variables).
% 0.67/0.97 set(auto2).
% 0.67/0.97 % set(auto2) -> set(auto).
% 0.67/0.97 % set(auto) -> set(auto_inference).
% 0.67/0.97 % set(auto) -> set(auto_setup).
% 0.67/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.97 % set(auto) -> set(auto_limits).
% 0.67/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.97 % set(auto) -> set(auto_denials).
% 0.67/0.97 % set(auto) -> set(auto_process).
% 0.67/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.97 % set(auto2) -> assign(stats, some).
% 0.67/0.97 % set(auto2) -> clear(echo_input).
% 0.67/0.97 % set(auto2) -> set(quiet).
% 0.67/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.97 % set(auto2) -> clear(print_given).
% 0.67/0.97 assign(lrs_ticks,-1).
% 0.67/0.97 assign(sos_limit,10000).
% 0.67/0.97 assign(order,kbo).
% 0.67/0.97 set(lex_order_vars).
% 0.67/0.97 clear(print_given).
% 0.67/0.97
% 0.67/0.97 % formulas(sos). % not echoed (17 formulas)
% 0.67/0.97
% 0.67/0.97 ============================== end of input ==========================
% 0.67/0.97
% 0.67/0.97 % From the command line: assign(max_seconds, 300).
% 0.67/0.97
% 0.67/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.97
% 0.67/0.97 % Formulas that are not ordinary clauses:
% 0.67/0.97
% 0.67/0.97 ============================== end of process non-clausal formulas ===
% 0.67/0.97
% 0.67/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.97
% 0.67/0.97 ============================== PREDICATE ELIMINATION =================
% 0.67/0.97 1 -environment(A) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A))) | -greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))) # label(mp_earliest_time_growth_rate_exceeds_26) # label(axiom). [assumption].
% 0.67/0.97 2 environment(sk5) # label(prove_l5_33) # label(negated_conjecture). [assumption].
% 0.67/0.97 Derived: -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk1(A,sk5)),growth_rate(first_movers,sk1(A,sk5))) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(1,a,2,a)].
% 0.67/0.97 3 -environment(A) | -stable(A) | in_environment(A,sk4(A)) # label(l1_31) # label(hypothesis). [assumption].
% 0.67/0.97 Derived: -stable(sk5) | in_environment(sk5,sk4(sk5)). [resolve(3,a,2,a)].
% 0.67/0.97 4 -environment(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | in_environment(A,sk2(A)) # label(mp_earliest_time_growth_rate_exceeds_20) # label(axiom). [assumption].
% 0.67/0.97 Derived: -in_environment(sk5,A) | greater_or_equal(sk1(A,sk5),A) | in_environment(sk5,sk2(sk5)). [resolve(4,a,2,a)].
% 0.67/0.97 5 -environment(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | in_environment(A,sk2(A)) # label(mp_earliest_time_growth_rate_exceeds_19) # label(axiom). [assumption].
% 0.67/0.97 Derived: -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk1(A,sk5)) | in_environment(sk5,sk2(sk5)). [resolve(5,a,2,a)].
% 0.67/0.97 6 -environment(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | -greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))) # label(mp_earliest_time_growth_rate_exceeds_23) # label(axiom). [assumption].
% 0.67/0.97 Derived: -in_environment(sk5,A) | greater_or_equal(sk1(A,sk5),A) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(6,a,2,a)].
% 0.67/0.97 7 -environment(A) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A))) | in_environment(A,sk2(A)) # label(mp_earliest_time_growth_rate_exceeds_25) # label(axiom). [assumption].
% 0.67/0.97 Derived: -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk1(A,sk5)),growth_rate(first_movers,sk1(A,sk5))) | in_environment(sk5,sk2(sk5)). [resolve(7,a,2,a)].
% 0.67/0.97 8 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,sk4(A)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(l1_32) # label(hypothesis). [assumption].
% 0.67/0.97 Derived: -stable(sk5) | -subpopulations(first_movers,efficient_producers,sk5,A) | -greater_or_equal(A,sk4(sk5)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(8,a,2,a)].
% 0.67/0.97 9 -environment(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | -greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))) # label(mp_earliest_time_growth_rate_exceeds_21) # label(axiom). [assumption].
% 0.67/0.97 Derived: -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk1(A,sk5)) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(9,a,2,a)].
% 0.67/0.97 10 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | greater(sk3(B,A),B) | B = critical_point(A) # label(d1_29) # label(hypothesis). [assumption].
% 0.67/0.97 Derived: greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(sk5,A) | greater(sk3(A,sk5),A) | A = critical_point(sk5). [resolve(10,a,2,a)].
% 0.67/0.97 11 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk3(B,A)) | B = critical_point(A) # label(d1_28) # label(hypothesis). [assumption].
% 0.67/0.97 Derived: greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk3(A,sk5)) | A = critical_point(sk5). [resolve(11,a,2,a)].
% 0.67/0.97 12 -environment(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,sk2(A)) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(mp_earliest_time_growth_rate_exceeds_24) # label(axiom). [assumption].
% 0.67/0.97 Derived: -in_environment(sk5,A) | greater_or_equal(sk1(A,sk5),A) | -subpopulations(first_movers,efficient_producers,sk5,B) | -greater(B,sk2(sk5)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(12,a,2,a)].
% 0.67/0.97 13 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,sk3(B,A)),growth_rate(first_movers,sk3(B,A))) | B = critical_point(A) # label(d1_30) # label(hypothesis). [assumption].
% 0.67/0.97 Derived: greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk3(A,sk5)),growth_rate(first_movers,sk3(A,sk5))) | A = critical_point(sk5). [resolve(13,a,2,a)].
% 0.67/0.97 14 -environment(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,sk2(A)) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(mp_earliest_time_growth_rate_exceeds_22) # label(axiom). [assumption].
% 0.67/0.97 Derived: -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk1(A,sk5)) | -subpopulations(first_movers,efficient_producers,sk5,B) | -greater(B,sk2(sk5)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(14,a,2,a)].
% 0.67/0.97 15 -environment(A) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A))) | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,sk2(A)) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(mp_earliest_time_growth_rate_exceeds_27) # label(axiom). [assumption].
% 0.67/0.99 Derived: -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk1(A,sk5)),growth_rate(first_movers,sk1(A,sk5))) | -subpopulations(first_movers,efficient_producers,sk5,B) | -greater(B,sk2(sk5)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(15,a,2,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: sk5=1. efficient_producers=1. first_movers=1. growth_rate=1. sk1=1. sk3=1. sk2=1. critical_point=1. sk4=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.01 seconds.
% 0.67/0.99
% 0.67/0.99 ============================== PROOF =================================
% 0.67/0.99 % SZS status Unsatisfiable
% 0.67/0.99 % SZS output start Refutation
% 0.67/0.99
% 0.67/0.99 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.67/0.99 % Length of proof is 81.
% 0.67/0.99 % Level of proof is 32.
% 0.67/0.99 % Maximum clause weight is 57.000.
% 0.67/0.99 % Given clauses 99.
% 0.67/0.99
% 0.67/0.99 1 -environment(A) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A))) | -greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))) # label(mp_earliest_time_growth_rate_exceeds_26) # label(axiom). [assumption].
% 0.67/0.99 2 environment(sk5) # label(prove_l5_33) # label(negated_conjecture). [assumption].
% 0.67/0.99 3 -environment(A) | -stable(A) | in_environment(A,sk4(A)) # label(l1_31) # label(hypothesis). [assumption].
% 0.67/0.99 4 -environment(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | in_environment(A,sk2(A)) # label(mp_earliest_time_growth_rate_exceeds_20) # label(axiom). [assumption].
% 0.67/0.99 5 -environment(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | in_environment(A,sk2(A)) # label(mp_earliest_time_growth_rate_exceeds_19) # label(axiom). [assumption].
% 0.67/0.99 6 -environment(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | -greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))) # label(mp_earliest_time_growth_rate_exceeds_23) # label(axiom). [assumption].
% 0.67/0.99 7 -environment(A) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A))) | in_environment(A,sk2(A)) # label(mp_earliest_time_growth_rate_exceeds_25) # label(axiom). [assumption].
% 0.67/0.99 8 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,sk4(A)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(l1_32) # label(hypothesis). [assumption].
% 0.67/0.99 9 -environment(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | -greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))) # label(mp_earliest_time_growth_rate_exceeds_21) # label(axiom). [assumption].
% 0.67/0.99 10 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | greater(sk3(B,A),B) | B = critical_point(A) # label(d1_29) # label(hypothesis). [assumption].
% 0.67/0.99 11 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk3(B,A)) | B = critical_point(A) # label(d1_28) # label(hypothesis). [assumption].
% 0.67/0.99 12 -environment(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,sk2(A)) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(mp_earliest_time_growth_rate_exceeds_24) # label(axiom). [assumption].
% 0.67/0.99 13 -environment(A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,sk3(B,A)),growth_rate(first_movers,sk3(B,A))) | B = critical_point(A) # label(d1_30) # label(hypothesis). [assumption].
% 0.67/0.99 14 -environment(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,sk2(A)) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(mp_earliest_time_growth_rate_exceeds_22) # label(axiom). [assumption].
% 0.67/0.99 15 -environment(A) | -in_environment(A,B) | -greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A))) | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,sk2(A)) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(mp_earliest_time_growth_rate_exceeds_27) # label(axiom). [assumption].
% 0.67/0.99 16 stable(sk5) # label(prove_l5_34) # label(negated_conjecture). [assumption].
% 0.67/0.99 17 -in_environment(sk5,critical_point(sk5)) # label(prove_l5_35) # label(negated_conjecture). [assumption].
% 0.67/0.99 18 -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk1(A,sk5)),growth_rate(first_movers,sk1(A,sk5))) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(1,a,2,a)].
% 0.67/0.99 19 -stable(sk5) | in_environment(sk5,sk4(sk5)). [resolve(3,a,2,a)].
% 0.67/0.99 20 in_environment(sk5,sk4(sk5)). [copy(19),unit_del(a,16)].
% 0.67/0.99 21 -in_environment(sk5,A) | greater_or_equal(sk1(A,sk5),A) | in_environment(sk5,sk2(sk5)). [resolve(4,a,2,a)].
% 0.67/0.99 22 -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk1(A,sk5)) | in_environment(sk5,sk2(sk5)). [resolve(5,a,2,a)].
% 0.67/0.99 23 -in_environment(sk5,A) | greater_or_equal(sk1(A,sk5),A) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(6,a,2,a)].
% 0.67/0.99 24 -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk1(A,sk5)),growth_rate(first_movers,sk1(A,sk5))) | in_environment(sk5,sk2(sk5)). [resolve(7,a,2,a)].
% 0.67/0.99 25 -stable(sk5) | -subpopulations(first_movers,efficient_producers,sk5,A) | -greater_or_equal(A,sk4(sk5)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(8,a,2,a)].
% 0.67/0.99 26 -subpopulations(first_movers,efficient_producers,sk5,A) | -greater_or_equal(A,sk4(sk5)) | greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [copy(25),unit_del(a,16)].
% 0.67/0.99 27 -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk1(A,sk5)) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(9,a,2,a)].
% 0.67/0.99 28 greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(sk5,A) | greater(sk3(A,sk5),A) | A = critical_point(sk5). [resolve(10,a,2,a)].
% 0.67/0.99 29 greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(sk5,A) | greater(sk3(A,sk5),A) | critical_point(sk5) = A. [copy(28),flip(d)].
% 0.67/0.99 30 greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk3(A,sk5)) | A = critical_point(sk5). [resolve(11,a,2,a)].
% 0.67/0.99 31 greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk3(A,sk5)) | critical_point(sk5) = A. [copy(30),flip(d)].
% 0.67/0.99 32 -in_environment(sk5,A) | greater_or_equal(sk1(A,sk5),A) | -subpopulations(first_movers,efficient_producers,sk5,B) | -greater(B,sk2(sk5)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(12,a,2,a)].
% 0.67/0.99 33 greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk3(A,sk5)),growth_rate(first_movers,sk3(A,sk5))) | A = critical_point(sk5). [resolve(13,a,2,a)].
% 0.67/0.99 34 greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)) | -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk3(A,sk5)),growth_rate(first_movers,sk3(A,sk5))) | critical_point(sk5) = A. [copy(33),flip(d)].
% 0.67/0.99 35 -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk1(A,sk5)) | -subpopulations(first_movers,efficient_producers,sk5,B) | -greater(B,sk2(sk5)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(14,a,2,a)].
% 0.67/0.99 36 -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk1(A,sk5)),growth_rate(first_movers,sk1(A,sk5))) | -subpopulations(first_movers,efficient_producers,sk5,B) | -greater(B,sk2(sk5)) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(15,a,2,a)].
% 0.67/0.99 37 -greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(20,a,18,a)].
% 0.67/0.99 38 greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | in_environment(sk5,sk2(sk5)). [resolve(21,a,20,a)].
% 0.67/0.99 39 subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)) | in_environment(sk5,sk2(sk5)). [resolve(22,a,20,a)].
% 0.67/0.99 40 greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(23,a,20,a)].
% 0.67/0.99 41 -greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | in_environment(sk5,sk2(sk5)). [resolve(24,a,20,a)].
% 0.67/0.99 42 subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(27,a,20,a)].
% 0.67/0.99 46 in_environment(sk5,sk2(sk5)) | -greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))). [resolve(39,a,26,a)].
% 0.67/0.99 51 in_environment(sk5,sk2(sk5)) | greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))). [resolve(46,b,38,a),merge(c)].
% 0.67/0.99 52 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | -greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))) | critical_point(sk5) = sk2(sk5). [resolve(51,a,34,b)].
% 0.67/0.99 53 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | subpopulations(first_movers,efficient_producers,sk5,sk3(sk2(sk5),sk5)) | critical_point(sk5) = sk2(sk5). [resolve(51,a,31,b)].
% 0.67/0.99 54 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | greater(sk3(sk2(sk5),sk5),sk2(sk5)) | critical_point(sk5) = sk2(sk5). [resolve(51,a,29,b)].
% 0.67/0.99 58 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | greater(sk3(sk2(sk5),sk5),sk2(sk5)) | critical_point(sk5) = sk2(sk5) | in_environment(sk5,sk2(sk5)). [resolve(54,a,41,a)].
% 0.67/0.99 64 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | greater(sk3(sk2(sk5),sk5),sk2(sk5)) | critical_point(sk5) = sk2(sk5). [resolve(58,d,29,b),merge(d),merge(e),merge(f)].
% 0.67/0.99 67 greater(sk3(sk2(sk5),sk5),sk2(sk5)) | critical_point(sk5) = sk2(sk5) | subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)). [resolve(64,a,42,b)].
% 0.67/0.99 68 greater(sk3(sk2(sk5),sk5),sk2(sk5)) | critical_point(sk5) = sk2(sk5) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)). [resolve(64,a,40,b)].
% 0.67/0.99 72 greater(sk3(sk2(sk5),sk5),sk2(sk5)) | critical_point(sk5) = sk2(sk5) | -greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))). [resolve(67,c,26,a)].
% 0.67/0.99 75 greater(sk3(sk2(sk5),sk5),sk2(sk5)) | critical_point(sk5) = sk2(sk5) | greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))). [resolve(72,c,68,c),merge(d),merge(e)].
% 0.67/0.99 77 greater(sk3(sk2(sk5),sk5),sk2(sk5)) | critical_point(sk5) = sk2(sk5) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(75,c,37,a)].
% 0.67/0.99 83 greater(sk3(sk2(sk5),sk5),sk2(sk5)) | critical_point(sk5) = sk2(sk5). [resolve(77,c,64,a),merge(c),merge(d)].
% 0.67/0.99 85 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | -in_environment(sk5,A) | subpopulations(first_movers,efficient_producers,sk5,sk1(A,sk5)) | -greater(sk3(sk2(sk5),sk5),sk2(sk5)) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(53,c,35,c)].
% 0.67/0.99 86 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | -in_environment(sk5,A) | greater_or_equal(sk1(A,sk5),A) | -greater(sk3(sk2(sk5),sk5),sk2(sk5)) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(53,c,32,c)].
% 0.67/0.99 89 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | -greater(sk3(sk2(sk5),sk5),sk2(sk5)) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(86,d,20,a)].
% 0.67/0.99 92 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(89,e,83,a),merge(f)].
% 0.67/0.99 94 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)) | -greater(sk3(sk2(sk5),sk5),sk2(sk5)) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(85,d,20,a)].
% 0.67/0.99 100 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(94,e,83,a),merge(f)].
% 0.67/0.99 104 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))) | -greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)). [resolve(100,d,26,a),merge(f)].
% 0.67/0.99 105 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(104,e,92,d),merge(e),merge(f),merge(g),merge(h)].
% 0.67/0.99 106 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5). [resolve(105,d,52,c),merge(d),merge(e),merge(f)].
% 0.67/0.99 108 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | in_environment(sk5,sk2(sk5)). [resolve(106,a,41,a)].
% 0.67/0.99 109 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | -greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(108,c,34,b),merge(c),merge(e)].
% 0.67/0.99 110 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | subpopulations(first_movers,efficient_producers,sk5,sk3(sk2(sk5),sk5)). [resolve(108,c,31,b),merge(c),merge(e)].
% 0.67/0.99 111 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | -in_environment(sk5,A) | -greater(growth_rate(efficient_producers,sk1(A,sk5)),growth_rate(first_movers,sk1(A,sk5))) | -greater(sk3(sk2(sk5),sk5),sk2(sk5)) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(110,c,36,c)].
% 0.67/0.99 118 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | -greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))) | -greater(sk3(sk2(sk5),sk5),sk2(sk5)) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(111,c,20,a)].
% 0.67/0.99 129 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | -greater(sk3(sk2(sk5),sk5),sk2(sk5)) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(118,c,106,a),merge(e),merge(f)].
% 0.67/0.99 130 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5) | greater(growth_rate(efficient_producers,sk3(sk2(sk5),sk5)),growth_rate(first_movers,sk3(sk2(sk5),sk5))). [resolve(129,c,83,a),merge(d)].
% 0.67/0.99 131 greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))) | critical_point(sk5) = sk2(sk5). [resolve(130,c,109,c),merge(c),merge(d)].
% 0.67/0.99 134 critical_point(sk5) = sk2(sk5) | subpopulations(first_movers,efficient_producers,sk5,sk1(sk4(sk5),sk5)). [resolve(131,a,42,b)].
% 0.67/0.99 135 critical_point(sk5) = sk2(sk5) | greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)). [resolve(131,a,40,b)].
% 0.67/0.99 139 critical_point(sk5) = sk2(sk5) | -greater_or_equal(sk1(sk4(sk5),sk5),sk4(sk5)) | greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))). [resolve(134,b,26,a)].
% 0.67/0.99 140 critical_point(sk5) = sk2(sk5) | greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))). [resolve(139,b,135,b),merge(c)].
% 0.67/0.99 143 critical_point(sk5) = sk2(sk5) | -greater(growth_rate(efficient_producers,sk2(sk5)),growth_rate(first_movers,sk2(sk5))). [resolve(140,b,37,a)].
% 0.67/0.99 144 critical_point(sk5) = sk2(sk5). [resolve(143,b,131,a),merge(b)].
% 0.67/0.99 161 -in_environment(sk5,sk2(sk5)). [back_rewrite(17),rewrite([144(3)])].
% 0.67/0.99 162 greater(growth_rate(efficient_producers,sk1(sk4(sk5),sk5)),growth_rate(first_movers,sk1(sk4(sk5),sk5))). [back_unit_del(51),unit_del(a,161)].
% 0.67/0.99 163 $F. [back_unit_del(41),unit_del(a,162),unit_del(b,161)].
% 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=99. Generated=201. Kept=142. proofs=1.
% 0.67/0.99 Usable=20. Sos=17. Demods=1. Limbo=2, Disabled=134. Hints=0.
% 0.67/0.99 Megabytes=0.25.
% 0.67/0.99 User_CPU=0.03, 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 Unsatisfiable
% 0.67/0.99
% 0.67/0.99 Exiting with 1 proof.
% 0.67/0.99
% 0.67/0.99 Process 12371 exit (max_proofs) Thu Jun 9 09:51:05 2022
% 0.67/0.99 Prover9 interrupted
%------------------------------------------------------------------------------