TSTP Solution File: MGT028+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT028+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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 : Theorem 0.74s 1.01s
% Output : Refutation 0.74s
% 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.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n027.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:47:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.74/1.01 ============================== Prover9 ===============================
% 0.74/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.01 Process 17659 was started by sandbox2 on n027.cluster.edu,
% 0.74/1.01 Thu Jun 9 09:47:28 2022
% 0.74/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17506_n027.cluster.edu".
% 0.74/1.01 ============================== end of head ===========================
% 0.74/1.01
% 0.74/1.01 ============================== INPUT =================================
% 0.74/1.01
% 0.74/1.01 % Reading from file /tmp/Prover9_17506_n027.cluster.edu
% 0.74/1.01
% 0.74/1.01 set(prolog_style_variables).
% 0.74/1.01 set(auto2).
% 0.74/1.01 % set(auto2) -> set(auto).
% 0.74/1.01 % set(auto) -> set(auto_inference).
% 0.74/1.01 % set(auto) -> set(auto_setup).
% 0.74/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.01 % set(auto) -> set(auto_limits).
% 0.74/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.01 % set(auto) -> set(auto_denials).
% 0.74/1.01 % set(auto) -> set(auto_process).
% 0.74/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.01 % set(auto2) -> assign(stats, some).
% 0.74/1.01 % set(auto2) -> clear(echo_input).
% 0.74/1.01 % set(auto2) -> set(quiet).
% 0.74/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.01 % set(auto2) -> clear(print_given).
% 0.74/1.01 assign(lrs_ticks,-1).
% 0.74/1.01 assign(sos_limit,10000).
% 0.74/1.01 assign(order,kbo).
% 0.74/1.01 set(lex_order_vars).
% 0.74/1.01 clear(print_given).
% 0.74/1.01
% 0.74/1.01 % formulas(sos). % not echoed (3 formulas)
% 0.74/1.01
% 0.74/1.01 ============================== end of input ==========================
% 0.74/1.01
% 0.74/1.01 % From the command line: assign(max_seconds, 300).
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.01
% 0.74/1.01 % Formulas that are not ordinary clauses:
% 0.74/1.01 1 (all E (environment(E) & stable(E) & (exists T1 (in_environment(E,T1) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,T1) -> greater(zero,growth_rate(first_movers,T)))))) -> (exists T2 (greater(T2,appear(efficient_producers,E)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,T2) -> greater(zero,growth_rate(first_movers,T)))))))) # label(mp_first_movers_negative_growth) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 2 (all E (environment(E) & stable(E) -> (exists To (in_environment(E,To) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,To) -> greater(growth_rate(efficient_producers,T),zero) & greater(zero,growth_rate(first_movers,T)))))))) # label(l11) # label(hypothesis) # label(non_clause). [assumption].
% 0.74/1.01 3 -(all E (environment(E) & stable(E) -> (exists To (greater(To,appear(efficient_producers,E)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,To) -> greater(zero,growth_rate(first_movers,T)))))))) # label(prove_l10) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.01
% 0.74/1.01 ============================== end of process non-clausal formulas ===
% 0.74/1.01
% 0.74/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.01
% 0.74/1.01 ============================== PREDICATE ELIMINATION =================
% 0.74/1.01 4 -environment(A) | -stable(A) | in_environment(A,f3(A)) # label(l11) # label(hypothesis). [clausify(2)].
% 0.74/1.01 5 environment(c1) # label(prove_l10) # label(negated_conjecture). [clausify(3)].
% 0.74/1.01 Derived: -stable(c1) | in_environment(c1,f3(c1)). [resolve(4,a,5,a)].
% 0.74/1.01 6 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(f1(A,B),B) | greater(f2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 Derived: -stable(c1) | -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(6,a,5,a)].
% 0.74/1.01 7 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,f3(A)) | greater(growth_rate(efficient_producers,B),zero) # label(l11) # label(hypothesis). [clausify(2)].
% 0.74/1.01 Derived: -stable(c1) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f3(c1)) | greater(growth_rate(efficient_producers,A),zero). [resolve(7,a,5,a)].
% 0.74/1.01 8 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,f3(A)) | greater(zero,growth_rate(first_movers,B)) # label(l11) # label(hypothesis). [clausify(2)].
% 0.74/1.01 Derived: -stable(c1) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f3(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(8,a,5,a)].
% 0.74/1.01 9 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,f1(A,B)) | greater(f2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 Derived: -stable(c1) | -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(9,a,5,a)].
% 0.74/1.01 10 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,f1(A,B))) | greater(f2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 Derived: -stable(c1) | -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(10,a,5,a)].
% 0.74/1.01 11 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(f1(A,B),B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,f2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 Derived: -stable(c1) | -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(11,a,5,a)].
% 0.74/1.01 12 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,f1(A,B)) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,f2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 Derived: -stable(c1) | -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(12,a,5,a)].
% 0.74/1.01 13 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,f1(A,B))) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,f2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 Derived: -stable(c1) | -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(13,a,5,a)].
% 0.74/1.01 14 -stable(c1) | in_environment(c1,f3(c1)). [resolve(4,a,5,a)].
% 0.74/1.01 15 stable(c1) # label(prove_l10) # label(negated_conjecture). [clausify(3)].
% 0.74/1.01 Derived: in_environment(c1,f3(c1)). [resolve(14,a,15,a)].
% 0.74/1.01 16 -stable(c1) | -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(6,a,5,a)].
% 0.74/1.01 Derived: -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(16,a,15,a)].
% 0.74/1.01 17 -stable(c1) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f3(c1)) | greater(growth_rate(efficient_producers,A),zero). [resolve(7,a,5,a)].
% 0.74/1.01 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f3(c1)) | greater(growth_rate(efficient_producers,A),zero). [resolve(17,a,15,a)].
% 0.74/1.01 18 -stable(c1) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f3(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(8,a,5,a)].
% 0.74/1.01 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f3(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(18,a,15,a)].
% 0.74/1.01 19 -stable(c1) | -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(9,a,5,a)].
% 0.74/1.01 Derived: -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(19,a,15,a)].
% 0.74/1.01 20 -stable(c1) | -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(10,a,5,a)].
% 0.74/1.01 Derived: -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(20,a,15,a)].
% 0.74/1.01 21 -stable(c1) | -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(11,a,5,a)].
% 0.74/1.01 Derived: -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(21,a,15,a)].
% 0.74/1.01 22 -stable(c1) | -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(12,a,5,a)].
% 0.74/1.01 Derived: -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(22,a,15,a)].
% 0.74/1.01 23 -stable(c1) | -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(13,a,5,a)].
% 0.74/1.01 Derived: -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(23,a,15,a)].
% 0.74/1.01 24 -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(16,a,15,a)].
% 0.74/1.01 25 in_environment(c1,f3(c1)). [resolve(14,a,15,a)].
% 0.74/1.01 Derived: greater_or_equal(f1(c1,f3(c1)),f3(c1)) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(24,a,25,a)].
% 0.74/1.01 26 -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(19,a,15,a)].
% 0.74/1.01 Derived: subpopulations(first_movers,efficient_producers,c1,f1(c1,f3(c1))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(26,a,25,a)].
% 0.74/1.01 27 -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(20,a,15,a)].
% 0.74/1.01 Derived: -greater(zero,growth_rate(first_movers,f1(c1,f3(c1)))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(27,a,25,a)].
% 0.74/1.01 28 -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(21,a,15,a)].
% 0.74/1.01 Derived: greater_or_equal(f1(c1,f3(c1)),f3(c1)) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f2(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(28,a,25,a)].
% 0.74/1.01 29 -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(22,a,15,a)].
% 0.74/1.01 Derived: subpopulations(first_movers,efficient_producers,c1,f1(c1,f3(c1))) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f2(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(29,a,25,a)].
% 0.74/1.01 30 -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(23,a,15,a)].
% 0.74/1.01 Derived: -greater(zero,growth_rate(first_movers,f1(c1,f3(c1)))) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f2(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(30,a,25,a)].
% 0.74/1.01
% 0.74/1.01 ============================== end predicate elimination =============
% 0.74/1.01
% 0.74/1.01 Auto_denials: (non-Horn, no changes).
% 0.74/1.01
% 0.74/1.01 Term ordering decisions:
% 0.74/1.01 Function symbol KB weights: efficient_producers=1. first_movers=1. zero=1. c1=1. growth_rate=1. appear=1. f1=1. f2=1. f3=1. f4=1.
% 0.74/1.01
% 0.74/1.01 ============================== end of process initial clauses ========
% 0.74/1.01
% 0.74/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.01
% 0.74/1.01 ============================== end of clauses for search =============
% 0.74/1.01
% 0.74/1.01 ============================== SEARCH ================================
% 0.74/1.01
% 0.74/1.01 % Starting search at 0.01 seconds.
% 0.74/1.01
% 0.74/1.01 ============================== PROOF =================================
% 0.74/1.01 % SZS status Theorem
% 0.74/1.01 % SZS output start Refutation
% 0.74/1.01
% 0.74/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.74/1.01 % Length of proof is 48.
% 0.74/1.01 % Level of proof is 10.
% 0.74/1.01 % Maximum clause weight is 22.000.
% 0.74/1.01 % Given clauses 20.
% 0.74/1.01
% 0.74/1.01 1 (all E (environment(E) & stable(E) & (exists T1 (in_environment(E,T1) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,T1) -> greater(zero,growth_rate(first_movers,T)))))) -> (exists T2 (greater(T2,appear(efficient_producers,E)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,T2) -> greater(zero,growth_rate(first_movers,T)))))))) # label(mp_first_movers_negative_growth) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.01 2 (all E (environment(E) & stable(E) -> (exists To (in_environment(E,To) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,To) -> greater(growth_rate(efficient_producers,T),zero) & greater(zero,growth_rate(first_movers,T)))))))) # label(l11) # label(hypothesis) # label(non_clause). [assumption].
% 0.74/1.01 3 -(all E (environment(E) & stable(E) -> (exists To (greater(To,appear(efficient_producers,E)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,To) -> greater(zero,growth_rate(first_movers,T)))))))) # label(prove_l10) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.01 4 -environment(A) | -stable(A) | in_environment(A,f3(A)) # label(l11) # label(hypothesis). [clausify(2)].
% 0.74/1.01 5 environment(c1) # label(prove_l10) # label(negated_conjecture). [clausify(3)].
% 0.74/1.01 6 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(f1(A,B),B) | greater(f2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 8 -environment(A) | -stable(A) | -subpopulations(first_movers,efficient_producers,A,B) | -greater_or_equal(B,f3(A)) | greater(zero,growth_rate(first_movers,B)) # label(l11) # label(hypothesis). [clausify(2)].
% 0.74/1.01 9 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,f1(A,B)) | greater(f2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 10 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,f1(A,B))) | greater(f2(A),appear(efficient_producers,A)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 11 -environment(A) | -stable(A) | -in_environment(A,B) | greater_or_equal(f1(A,B),B) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,f2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 12 -environment(A) | -stable(A) | -in_environment(A,B) | subpopulations(first_movers,efficient_producers,A,f1(A,B)) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,f2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 13 -environment(A) | -stable(A) | -in_environment(A,B) | -greater(zero,growth_rate(first_movers,f1(A,B))) | -subpopulations(first_movers,efficient_producers,A,C) | -greater_or_equal(C,f2(A)) | greater(zero,growth_rate(first_movers,C)) # label(mp_first_movers_negative_growth) # label(axiom). [clausify(1)].
% 0.74/1.01 14 -stable(c1) | in_environment(c1,f3(c1)). [resolve(4,a,5,a)].
% 0.74/1.01 15 stable(c1) # label(prove_l10) # label(negated_conjecture). [clausify(3)].
% 0.74/1.01 16 -stable(c1) | -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(6,a,5,a)].
% 0.74/1.01 18 -stable(c1) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f3(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(8,a,5,a)].
% 0.74/1.01 19 -stable(c1) | -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(9,a,5,a)].
% 0.74/1.01 20 -stable(c1) | -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(10,a,5,a)].
% 0.74/1.01 21 -stable(c1) | -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(11,a,5,a)].
% 0.74/1.01 22 -stable(c1) | -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(12,a,5,a)].
% 0.74/1.01 23 -stable(c1) | -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(13,a,5,a)].
% 0.74/1.01 24 -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(16,a,15,a)].
% 0.74/1.01 25 in_environment(c1,f3(c1)). [resolve(14,a,15,a)].
% 0.74/1.01 26 -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(19,a,15,a)].
% 0.74/1.01 27 -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(20,a,15,a)].
% 0.74/1.01 28 -in_environment(c1,A) | greater_or_equal(f1(c1,A),A) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(21,a,15,a)].
% 0.74/1.01 29 -in_environment(c1,A) | subpopulations(first_movers,efficient_producers,c1,f1(c1,A)) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(22,a,15,a)].
% 0.74/1.01 30 -in_environment(c1,A) | -greater(zero,growth_rate(first_movers,f1(c1,A))) | -subpopulations(first_movers,efficient_producers,c1,B) | -greater_or_equal(B,f2(c1)) | greater(zero,growth_rate(first_movers,B)). [resolve(23,a,15,a)].
% 0.74/1.01 31 -greater(A,appear(efficient_producers,c1)) | -greater(zero,growth_rate(first_movers,f4(A))) # label(prove_l10) # label(negated_conjecture). [clausify(3)].
% 0.74/1.01 32 -greater(A,appear(efficient_producers,c1)) | greater_or_equal(f4(A),A) # label(prove_l10) # label(negated_conjecture). [clausify(3)].
% 0.74/1.01 33 -greater(A,appear(efficient_producers,c1)) | subpopulations(first_movers,efficient_producers,c1,f4(A)) # label(prove_l10) # label(negated_conjecture). [clausify(3)].
% 0.74/1.01 35 -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f3(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(18,a,15,a)].
% 0.74/1.01 36 greater_or_equal(f1(c1,f3(c1)),f3(c1)) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(24,a,25,a)].
% 0.74/1.01 37 subpopulations(first_movers,efficient_producers,c1,f1(c1,f3(c1))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(26,a,25,a)].
% 0.74/1.01 38 -greater(zero,growth_rate(first_movers,f1(c1,f3(c1)))) | greater(f2(c1),appear(efficient_producers,c1)). [resolve(27,a,25,a)].
% 0.74/1.01 39 greater_or_equal(f1(c1,f3(c1)),f3(c1)) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f2(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(28,a,25,a)].
% 0.74/1.01 40 subpopulations(first_movers,efficient_producers,c1,f1(c1,f3(c1))) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f2(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(29,a,25,a)].
% 0.74/1.01 41 -greater(zero,growth_rate(first_movers,f1(c1,f3(c1)))) | -subpopulations(first_movers,efficient_producers,c1,A) | -greater_or_equal(A,f2(c1)) | greater(zero,growth_rate(first_movers,A)). [resolve(30,a,25,a)].
% 0.74/1.01 42 greater(f2(c1),appear(efficient_producers,c1)) | -greater_or_equal(f1(c1,f3(c1)),f3(c1)) | greater(zero,growth_rate(first_movers,f1(c1,f3(c1)))). [resolve(37,a,35,a)].
% 0.74/1.01 44 greater(f2(c1),appear(efficient_producers,c1)) | greater(zero,growth_rate(first_movers,f1(c1,f3(c1)))). [resolve(42,b,36,a),merge(c)].
% 0.74/1.01 45 greater(f2(c1),appear(efficient_producers,c1)). [resolve(44,b,38,a),merge(b)].
% 0.74/1.01 46 subpopulations(first_movers,efficient_producers,c1,f4(f2(c1))). [resolve(45,a,33,a)].
% 0.74/1.01 47 greater_or_equal(f4(f2(c1)),f2(c1)). [resolve(45,a,32,a)].
% 0.74/1.01 48 -greater(zero,growth_rate(first_movers,f4(f2(c1)))). [ur(31,a,45,a)].
% 0.74/1.01 49 -greater(zero,growth_rate(first_movers,f1(c1,f3(c1)))). [resolve(46,a,41,b),unit_del(b,47),unit_del(c,48)].
% 0.74/1.01 50 subpopulations(first_movers,efficient_producers,c1,f1(c1,f3(c1))). [resolve(46,a,40,b),unit_del(b,47),unit_del(c,48)].
% 0.74/1.01 51 greater_or_equal(f1(c1,f3(c1)),f3(c1)). [resolve(46,a,39,b),unit_del(b,47),unit_del(c,48)].
% 0.74/1.01 53 $F. [ur(35,b,51,a,c,49,a),unit_del(a,50)].
% 0.74/1.01
% 0.74/1.01 % SZS output end Refutation
% 0.74/1.01 ============================== end of proof ==========================
% 0.74/1.01
% 0.74/1.01 ============================== STATISTICS ============================
% 0.74/1.01
% 0.74/1.01 Given=20. Generated=28. Kept=22. proofs=1.
% 0.74/1.01 Usable=12. Sos=1. Demods=0. Limbo=0, Disabled=47. Hints=0.
% 0.74/1.01 Megabytes=0.08.
% 0.74/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.74/1.01
% 0.74/1.01 ============================== end of statistics =====================
% 0.74/1.01
% 0.74/1.01 ============================== end of search =========================
% 0.74/1.01
% 0.74/1.01 THEOREM PROVED
% 0.74/1.01 % SZS status Theorem
% 0.74/1.01
% 0.74/1.01 Exiting with 1 proof.
% 0.74/1.01
% 0.74/1.01 Process 17659 exit (max_proofs) Thu Jun 9 09:47:28 2022
% 0.74/1.01 Prover9 interrupted
%------------------------------------------------------------------------------