TSTP Solution File: MGT028-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT028-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:55 EDT 2022
% Result : Unsatisfiable 0.44s 0.99s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT028-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 : n028.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 11:03:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 15804 was started by sandbox2 on n028.cluster.edu,
% 0.44/0.99 Thu Jun 9 11:03:03 2022
% 0.44/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15501_n028.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_15501_n028.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (14 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99 1 -environment(A) | -stable(A) | in_environment(A,sk3(A)) # label(l11_7) # label(hypothesis). [assumption].
% 0.44/0.99 2 environment(sk4) # label(prove_l10_10) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -stable(sk4) | in_environment(sk4,sk3(sk4)). [resolve(1,a,2,a)].
% 0.44/0.99 3 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | greater(sk2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth_2) # label(axiom). [assumption].
% 0.44/0.99 Derived: -stable(sk4) | -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(3,a,2,a)].
% 0.44/0.99 4 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,sk3(A)) | greater(growth_rate(efficient_producers,B),zero) # label(l11_8) # label(hypothesis). [assumption].
% 0.44/0.99 Derived: -stable(sk4) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk3(sk4)) | greater(growth_rate(efficient_producers,A),zero). [resolve(4,a,2,a)].
% 0.44/0.99 5 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,sk3(A)) | greater(zero,growth_rate(first_movers,B)) # label(l11_9) # label(hypothesis). [assumption].
% 0.44/0.99 Derived: -stable(sk4) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk3(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(5,a,2,a)].
% 0.44/0.99 6 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | greater(sk2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth_1) # label(axiom). [assumption].
% 0.44/0.99 Derived: -stable(sk4) | -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(6,a,2,a)].
% 0.44/0.99 7 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,sk1(B,A))) | greater(sk2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth_5) # label(axiom). [assumption].
% 0.44/0.99 Derived: -stable(sk4) | -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(7,a,2,a)].
% 0.44/0.99 8 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,sk2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth_4) # label(axiom). [assumption].
% 0.44/0.99 Derived: -stable(sk4) | -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(8,a,2,a)].
% 0.44/0.99 9 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,sk2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth_3) # label(axiom). [assumption].
% 0.44/0.99 Derived: -stable(sk4) | -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(9,a,2,a)].
% 0.44/0.99 10 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,sk1(B,A))) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,sk2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth_6) # label(axiom). [assumption].
% 0.44/0.99 Derived: -stable(sk4) | -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(10,a,2,a)].
% 0.44/0.99 11 -stable(sk4) | in_environment(sk4,sk3(sk4)). [resolve(1,a,2,a)].
% 0.44/0.99 12 stable(sk4) # label(prove_l10_11) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: in_environment(sk4,sk3(sk4)). [resolve(11,a,12,a)].
% 0.44/0.99 13 -stable(sk4) | -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(3,a,2,a)].
% 0.44/0.99 Derived: -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(13,a,12,a)].
% 0.44/0.99 14 -stable(sk4) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk3(sk4)) | greater(growth_rate(efficient_producers,A),zero). [resolve(4,a,2,a)].
% 0.44/0.99 Derived: -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk3(sk4)) | greater(growth_rate(efficient_producers,A),zero). [resolve(14,a,12,a)].
% 0.44/0.99 15 -stable(sk4) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk3(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(5,a,2,a)].
% 0.44/0.99 Derived: -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk3(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(15,a,12,a)].
% 0.44/0.99 16 -stable(sk4) | -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(6,a,2,a)].
% 0.44/0.99 Derived: -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(16,a,12,a)].
% 0.44/0.99 17 -stable(sk4) | -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(7,a,2,a)].
% 0.44/0.99 Derived: -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(17,a,12,a)].
% 0.44/0.99 18 -stable(sk4) | -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(8,a,2,a)].
% 0.44/0.99 Derived: -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(18,a,12,a)].
% 0.44/0.99 19 -stable(sk4) | -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(9,a,2,a)].
% 0.44/0.99 Derived: -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(19,a,12,a)].
% 0.44/0.99 20 -stable(sk4) | -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(10,a,2,a)].
% 0.44/0.99 Derived: -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(20,a,12,a)].
% 0.44/0.99 21 -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(13,a,12,a)].
% 0.44/0.99 22 in_environment(sk4,sk3(sk4)). [resolve(11,a,12,a)].
% 0.44/0.99 Derived: greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(21,a,22,a)].
% 0.44/0.99 23 -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(16,a,12,a)].
% 0.44/0.99 Derived: subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(23,a,22,a)].
% 0.44/0.99 24 -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(17,a,12,a)].
% 0.44/0.99 Derived: -greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(24,a,22,a)].
% 0.44/0.99 25 -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(18,a,12,a)].
% 0.44/0.99 Derived: greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk2(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(25,a,22,a)].
% 0.44/0.99 26 -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(19,a,12,a)].
% 0.44/0.99 Derived: subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk2(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(26,a,22,a)].
% 0.44/0.99 27 -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(20,a,12,a)].
% 0.44/0.99 Derived: -greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk2(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(27,a,22,a)].
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials: (non-Horn, no changes).
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99 Function symbol KB weights: sk4=1. efficient_producers=1. first_movers=1. zero=1. growth_rate=1. sk1=1. appear=1. sk3=1. sk2=1. sk5=1.
% 0.44/0.99
% 0.44/0.99 ============================== end of process initial clauses ========
% 0.44/0.99
% 0.44/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.99
% 0.44/0.99 ============================== end of clauses for search =============
% 0.44/0.99
% 0.44/0.99 ============================== SEARCH ================================
% 0.44/0.99
% 0.44/0.99 % Starting search at 0.01 seconds.
% 0.44/0.99
% 0.44/0.99 ============================== PROOF =================================
% 0.44/0.99 % SZS status Unsatisfiable
% 0.44/0.99 % SZS output start Refutation
% 0.44/0.99
% 0.44/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.44/0.99 % Length of proof is 45.
% 0.44/0.99 % Level of proof is 9.
% 0.44/0.99 % Maximum clause weight is 22.000.
% 0.44/0.99 % Given clauses 20.
% 0.44/0.99
% 0.44/0.99 1 -environment(A) | -stable(A) | in_environment(A,sk3(A)) # label(l11_7) # label(hypothesis). [assumption].
% 0.44/0.99 2 environment(sk4) # label(prove_l10_10) # label(negated_conjecture). [assumption].
% 0.44/0.99 3 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | greater(sk2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth_2) # label(axiom). [assumption].
% 0.44/0.99 5 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,sk3(A)) | greater(zero,growth_rate(first_movers,B)) # label(l11_9) # label(hypothesis). [assumption].
% 0.44/0.99 6 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | greater(sk2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth_1) # label(axiom). [assumption].
% 0.44/0.99 7 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,sk1(B,A))) | greater(sk2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth_5) # label(axiom). [assumption].
% 0.44/0.99 8 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(sk1(B,A),B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,sk2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth_4) # label(axiom). [assumption].
% 0.44/0.99 9 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,sk1(B,A)) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,sk2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth_3) # label(axiom). [assumption].
% 0.44/0.99 10 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,sk1(B,A))) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,sk2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth_6) # label(axiom). [assumption].
% 0.44/0.99 11 -stable(sk4) | in_environment(sk4,sk3(sk4)). [resolve(1,a,2,a)].
% 0.44/0.99 12 stable(sk4) # label(prove_l10_11) # label(negated_conjecture). [assumption].
% 0.44/0.99 13 -stable(sk4) | -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(3,a,2,a)].
% 0.44/0.99 15 -stable(sk4) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk3(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(5,a,2,a)].
% 0.44/0.99 16 -stable(sk4) | -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(6,a,2,a)].
% 0.44/0.99 17 -stable(sk4) | -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(7,a,2,a)].
% 0.44/0.99 18 -stable(sk4) | -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(8,a,2,a)].
% 0.44/0.99 19 -stable(sk4) | -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(9,a,2,a)].
% 0.44/0.99 20 -stable(sk4) | -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(10,a,2,a)].
% 0.44/0.99 21 -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(13,a,12,a)].
% 0.44/0.99 22 in_environment(sk4,sk3(sk4)). [resolve(11,a,12,a)].
% 0.44/0.99 23 -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(16,a,12,a)].
% 0.44/0.99 24 -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(17,a,12,a)].
% 0.44/0.99 25 -in_environment(sk4,A) | greater_or_equal(sk1(A,sk4),A) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(18,a,12,a)].
% 0.44/0.99 26 -in_environment(sk4,A) | subpopulations(first_movers,efficient_producers,sk4,sk1(A,sk4)) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(19,a,12,a)].
% 0.44/0.99 27 -in_environment(sk4,A) | -greater(zero,growth_rate(first_movers,sk1(A,sk4))) | -subpopulations(first_movers,efficient_producers,sk4,B) | -greater_or_equal(B,sk2(sk4)) | greater(zero,growth_rate(first_movers,B)). [resolve(20,a,12,a)].
% 0.44/0.99 28 -greater(A,appear(efficient_producers,sk4)) | -greater(zero,growth_rate(first_movers,sk5(A))) # label(prove_l10_14) # label(negated_conjecture). [assumption].
% 0.44/0.99 29 -greater(A,appear(efficient_producers,sk4)) | greater_or_equal(sk5(A),A) # label(prove_l10_13) # label(negated_conjecture). [assumption].
% 0.44/0.99 30 -greater(A,appear(efficient_producers,sk4)) | subpopulations(first_movers,efficient_producers,sk4,sk5(A)) # label(prove_l10_12) # label(negated_conjecture). [assumption].
% 0.44/0.99 32 -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk3(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(15,a,12,a)].
% 0.44/0.99 33 greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(21,a,22,a)].
% 0.44/0.99 34 subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(23,a,22,a)].
% 0.44/0.99 35 -greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))) | greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(24,a,22,a)].
% 0.44/0.99 36 greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk2(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(25,a,22,a)].
% 0.44/0.99 37 subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk2(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(26,a,22,a)].
% 0.44/0.99 38 -greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))) | -subpopulations(first_movers,efficient_producers,sk4,A) | -greater_or_equal(A,sk2(sk4)) | greater(zero,growth_rate(first_movers,A)). [resolve(27,a,22,a)].
% 0.44/0.99 39 greater(sk2(sk4),appear(efficient_producers,sk4)) | -greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)) | greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))). [resolve(34,a,32,a)].
% 0.44/0.99 41 greater(sk2(sk4),appear(efficient_producers,sk4)) | greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))). [resolve(39,b,33,a),merge(c)].
% 0.44/0.99 42 greater(sk2(sk4),appear(efficient_producers,sk4)). [resolve(41,b,35,a),merge(b)].
% 0.44/0.99 43 subpopulations(first_movers,efficient_producers,sk4,sk5(sk2(sk4))). [resolve(42,a,30,a)].
% 0.44/0.99 44 greater_or_equal(sk5(sk2(sk4)),sk2(sk4)). [resolve(42,a,29,a)].
% 0.44/0.99 45 -greater(zero,growth_rate(first_movers,sk5(sk2(sk4)))). [ur(28,a,42,a)].
% 0.44/0.99 46 -greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4))). [resolve(43,a,38,b),unit_del(b,44),unit_del(c,45)].
% 0.44/0.99 47 subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4)). [resolve(43,a,37,b),unit_del(b,44),unit_del(c,45)].
% 0.44/0.99 48 greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4)). [resolve(43,a,36,b),unit_del(b,44),unit_del(c,45)].
% 0.44/0.99 50 $F. [ur(32,b,48,a,c,46,a),unit_del(a,47)].
% 0.44/0.99
% 0.44/0.99 % SZS output end Refutation
% 0.44/0.99 ============================== end of proof ==========================
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=20. Generated=28. Kept=22. proofs=1.
% 0.44/0.99 Usable=12. Sos=1. Demods=0. Limbo=0, Disabled=47. Hints=0.
% 0.44/0.99 Megabytes=0.07.
% 0.44/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 THEOREM PROVED
% 0.44/0.99 % SZS status Unsatisfiable
% 0.44/0.99
% 0.44/0.99 Exiting with 1 proof.
% 0.44/0.99
% 0.44/0.99 Process 15804 exit (max_proofs) Thu Jun 9 11:03:03 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------