TSTP Solution File: MGT039+2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT039+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:23:01 EDT 2022
% Result : Theorem 0.50s 0.86s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : MGT039+2 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.10 % Command : tptp2X_and_run_prover9 %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Thu Jun 9 12:07:22 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.46/0.77 ============================== Prover9 ===============================
% 0.46/0.77 Prover9 (32) version 2009-11A, November 2009.
% 0.46/0.77 Process 1732 was started by sandbox on n032.cluster.edu,
% 0.46/0.77 Thu Jun 9 12:07:23 2022
% 0.46/0.77 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1569_n032.cluster.edu".
% 0.46/0.77 ============================== end of head ===========================
% 0.46/0.77
% 0.46/0.77 ============================== INPUT =================================
% 0.46/0.77
% 0.46/0.77 % Reading from file /tmp/Prover9_1569_n032.cluster.edu
% 0.46/0.77
% 0.46/0.77 set(prolog_style_variables).
% 0.46/0.77 set(auto2).
% 0.46/0.77 % set(auto2) -> set(auto).
% 0.46/0.77 % set(auto) -> set(auto_inference).
% 0.46/0.77 % set(auto) -> set(auto_setup).
% 0.46/0.77 % set(auto_setup) -> set(predicate_elim).
% 0.46/0.77 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/0.77 % set(auto) -> set(auto_limits).
% 0.46/0.77 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/0.77 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/0.77 % set(auto) -> set(auto_denials).
% 0.46/0.77 % set(auto) -> set(auto_process).
% 0.46/0.77 % set(auto2) -> assign(new_constants, 1).
% 0.46/0.77 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/0.77 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/0.77 % set(auto2) -> assign(max_hours, 1).
% 0.46/0.77 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/0.77 % set(auto2) -> assign(max_seconds, 0).
% 0.46/0.77 % set(auto2) -> assign(max_minutes, 5).
% 0.46/0.77 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/0.77 % set(auto2) -> set(sort_initial_sos).
% 0.46/0.77 % set(auto2) -> assign(sos_limit, -1).
% 0.46/0.77 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/0.77 % set(auto2) -> assign(max_megs, 400).
% 0.46/0.77 % set(auto2) -> assign(stats, some).
% 0.46/0.77 % set(auto2) -> clear(echo_input).
% 0.46/0.77 % set(auto2) -> set(quiet).
% 0.46/0.77 % set(auto2) -> clear(print_initial_clauses).
% 0.46/0.77 % set(auto2) -> clear(print_given).
% 0.46/0.77 assign(lrs_ticks,-1).
% 0.46/0.77 assign(sos_limit,10000).
% 0.46/0.77 assign(order,kbo).
% 0.46/0.77 set(lex_order_vars).
% 0.46/0.77 clear(print_given).
% 0.46/0.77
% 0.46/0.77 % formulas(sos). % not echoed (19 formulas)
% 0.46/0.77
% 0.46/0.77 ============================== end of input ==========================
% 0.46/0.77
% 0.46/0.77 % From the command line: assign(max_seconds, 300).
% 0.46/0.77
% 0.46/0.77 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/0.77
% 0.46/0.77 % Formulas that are not ordinary clauses:
% 0.46/0.77 1 (all E all S1 all S2 all T (environment(E) & subpopulations(S1,S2,E,T) & greater(growth_rate(S2,T),growth_rate(S1,T)) -> selection_favors(S2,S1,T))) # label(mp1_high_growth_rates) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 2 (all E all S1 all S2 all T (environment(E) & subpopulation(S1,E,T) & subpopulation(S2,E,T) & greater(cardinality_at_time(S1,T),zero) & cardinality_at_time(S2,T) = zero -> selection_favors(S1,S2,T))) # label(mp2_favour_members) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 3 (all P (observational_period(P) & propagation_strategy(first_movers) & propagation_strategy(efficient_producers) & (all E (environment(E) & in_environment(P,E) -> selection_favors(efficient_producers,first_movers,end_time(E)))) -> selection_favors(efficient_producers,first_movers,P))) # label(mp3_favoured_trategy) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 4 (all P (observational_period(P) & slow_change(P) -> (all E (environment(E) & in_environment(P,E) -> (exists T (in_environment(E,T) & greater(T,critical_point(E)))))))) # label(mp4_critical_point) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 5 (all E all T (environment(E) & greater_or_equal(T,start_time(E)) & greater_or_equal(end_time(E),T) -> in_environment(E,T))) # label(mp_time_in_environment) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 6 (all E all T (environment(E) & in_environment(E,T) -> greater_or_equal(end_time(E),T))) # label(mp_environment_end_point) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 7 (all E all T (environment(E) & in_environment(E,T) & greater(cardinality_at_time(first_movers,T),zero) & greater(cardinality_at_time(efficient_producers,T),zero) -> subpopulations(first_movers,efficient_producers,E,T))) # label(mp_contains_FM_and_EP) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 8 (all E all T (environment(E) & in_environment(E,T) -> greater_or_equal(cardinality_at_time(first_movers,T),zero))) # label(mp_first_movers_exist) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 9 (all E all T (environment(E) & in_environment(E,T) -> subpopulation(first_movers,E,T) & subpopulation(efficient_producers,E,T))) # label(mp_subpopulations) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 10 (all E (environment(E) -> greater_or_equal(critical_point(E),appear(efficient_producers,E)))) # label(mp_critical_point_after_EP) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 11 (all E (environment(E) -> greater_or_equal(critical_point(E),start_time(E)))) # label(mp_time_of_critical_point) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 12 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp_greater_transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 13 (all E all T (environment(E) & greater(T,start_time(E)) & -greater(T,end_time(E)) -> greater_or_equal(end_time(E),T))) # label(mp_beginning_and_ending) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 14 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(mp_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.46/0.77 15 (all E all Tc (environment(E) & Tc = critical_point(E) -> -greater(growth_rate(efficient_producers,Tc),growth_rate(first_movers,Tc)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater(T,Tc) -> greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)))))) # label(d1) # label(hypothesis) # label(non_clause). [assumption].
% 0.46/0.77 16 (all E all T (environment(E) & in_environment(E,T) & greater_or_equal(T,appear(efficient_producers,E)) -> greater(cardinality_at_time(efficient_producers,T),zero))) # label(t6) # label(hypothesis) # label(non_clause). [assumption].
% 0.46/0.77 17 -(all P (observational_period(P) & slow_change(P) -> selection_favors(efficient_producers,first_movers,P))) # label(prove_t8) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/0.77
% 0.46/0.77 ============================== end of process non-clausal formulas ===
% 0.46/0.77
% 0.46/0.77 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/0.77
% 0.46/0.77 ============================== PREDICATE ELIMINATION =================
% 0.46/0.77 18 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(3)].
% 0.46/0.77 19 observational_period(c1) # label(prove_t8) # label(negated_conjecture). [clausify(17)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(18,a,19,a)].
% 0.46/0.77 20 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(3)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(c1,f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(20,a,19,a)].
% 0.46/0.77 21 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | in_environment(B,f2(A,B)) # label(mp4_critical_point) # label(axiom). [clausify(4)].
% 0.46/0.77 Derived: -slow_change(c1) | -environment(A) | -in_environment(c1,A) | in_environment(A,f2(c1,A)). [resolve(21,a,19,a)].
% 0.46/0.77 22 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | greater(f2(A,B),critical_point(B)) # label(mp4_critical_point) # label(axiom). [clausify(4)].
% 0.46/0.77 Derived: -slow_change(c1) | -environment(A) | -in_environment(c1,A) | greater(f2(c1,A),critical_point(A)). [resolve(22,a,19,a)].
% 0.46/0.77 23 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(3)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(c1))) | selection_favors(efficient_producers,first_movers,c1). [resolve(23,a,19,a)].
% 0.46/0.77 24 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(18,a,19,a)].
% 0.46/0.77 25 -environment(A) | critical_point(A) != B | -greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(d1) # label(hypothesis). [clausify(15)].
% 0.46/0.77 26 -environment(A) | greater_or_equal(critical_point(A),start_time(A)) # label(mp_time_of_critical_point) # label(axiom). [clausify(11)].
% 0.46/0.77 27 -environment(A) | greater_or_equal(critical_point(A),appear(efficient_producers,A)) # label(mp_critical_point_after_EP) # label(axiom). [clausify(10)].
% 0.46/0.77 28 -environment(A) | -in_environment(A,B) | greater_or_equal(end_time(A),B) # label(mp_environment_end_point) # label(axiom). [clausify(6)].
% 0.46/0.77 29 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations) # label(axiom). [clausify(9)].
% 0.46/0.77 30 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations) # label(axiom). [clausify(9)].
% 0.46/0.77 31 -environment(A) | -in_environment(A,B) | greater_or_equal(cardinality_at_time(first_movers,B),zero) # label(mp_first_movers_exist) # label(axiom). [clausify(8)].
% 0.46/0.77 32 -environment(A) | -greater_or_equal(B,start_time(A)) | -greater_or_equal(end_time(A),B) | in_environment(A,B) # label(mp_time_in_environment) # label(axiom). [clausify(5)].
% 0.46/0.77 33 -environment(A) | -greater(B,start_time(A)) | greater(B,end_time(A)) | greater_or_equal(end_time(A),B) # label(mp_beginning_and_ending) # label(axiom). [clausify(13)].
% 0.46/0.77 34 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(efficient_producers,A)) | greater(cardinality_at_time(efficient_producers,B),zero) # label(t6) # label(hypothesis). [clausify(16)].
% 0.46/0.77 35 -environment(A) | -subpopulations(B,C,A,D) | -greater(growth_rate(C,D),growth_rate(B,D)) | selection_favors(C,B,D) # label(mp1_high_growth_rates) # label(axiom). [clausify(1)].
% 0.46/0.77 36 -environment(A) | -in_environment(A,B) | -greater(cardinality_at_time(first_movers,B),zero) | -greater(cardinality_at_time(efficient_producers,B),zero) | subpopulations(first_movers,efficient_producers,A,B) # label(mp_contains_FM_and_EP) # label(axiom). [clausify(7)].
% 0.46/0.77 37 -environment(A) | critical_point(A) != B | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,B) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(d1) # label(hypothesis). [clausify(15)].
% 0.46/0.77 38 -environment(A) | -subpopulation(B,A,C) | -subpopulation(D,A,C) | -greater(cardinality_at_time(B,C),zero) | cardinality_at_time(D,C) != zero | selection_favors(B,D,C) # label(mp2_favour_members) # label(axiom). [clausify(2)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | critical_point(f1(c1)) != A | -greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(24,c,25,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | greater_or_equal(critical_point(f1(c1)),start_time(f1(c1))). [resolve(24,c,26,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | greater_or_equal(critical_point(f1(c1)),appear(efficient_producers,f1(c1))). [resolve(24,c,27,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | greater_or_equal(end_time(f1(c1)),A). [resolve(24,c,28,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | subpopulation(first_movers,f1(c1),A). [resolve(24,c,29,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | subpopulation(efficient_producers,f1(c1),A). [resolve(24,c,30,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | greater_or_equal(cardinality_at_time(first_movers,A),zero). [resolve(24,c,31,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -greater_or_equal(A,start_time(f1(c1))) | -greater_or_equal(end_time(f1(c1)),A) | in_environment(f1(c1),A). [resolve(24,c,32,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -greater(A,start_time(f1(c1))) | greater(A,end_time(f1(c1))) | greater_or_equal(end_time(f1(c1)),A). [resolve(24,c,33,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | -greater_or_equal(A,appear(efficient_producers,f1(c1))) | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(24,c,34,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -subpopulations(A,B,f1(c1),C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [resolve(24,c,35,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | -greater(cardinality_at_time(first_movers,A),zero) | -greater(cardinality_at_time(efficient_producers,A),zero) | subpopulations(first_movers,efficient_producers,f1(c1),A). [resolve(24,c,36,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | critical_point(f1(c1)) != A | -subpopulations(first_movers,efficient_producers,f1(c1),B) | -greater(B,A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(24,c,37,a)].
% 0.46/0.77 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -subpopulation(A,f1(c1),B) | -subpopulation(C,f1(c1),B) | -greater(cardinality_at_time(A,B),zero) | cardinality_at_time(C,B) != zero | selection_favors(A,C,B). [resolve(24,c,38,a)].
% 0.46/0.77 39 -slow_change(c1) | -environment(A) | -in_environment(c1,A) | in_environment(A,f2(c1,A)). [resolve(21,a,19,a)].
% 0.46/0.77 Derived: -slow_change(c1) | -in_environment(c1,f1(c1)) | in_environment(f1(c1),f2(c1,f1(c1))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1). [resolve(39,b,24,c)].
% 0.46/0.77 40 -slow_change(c1) | -environment(A) | -in_environment(c1,A) | greater(f2(c1,A),critical_point(A)). [resolve(22,a,19,a)].
% 0.46/0.77 Derived: -slow_change(c1) | -in_environment(c1,f1(c1)) | greater(f2(c1,f1(c1)),critical_point(f1(c1))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1). [resolve(40,b,24,c)].
% 0.46/0.77
% 0.46/0.77 ============================== end predicate elimination =============
% 0.46/0.77
% 0.46/0.77 Auto_denials: (non-Horn, no changes).
% 0.46/0.77
% 0.46/0.77 Term ordering decisions:
% 0.46/0.77 Function symbol KB weights: efficient_producers=1. first_movers=1. zero=1. c1=1. cardinality_at_time=1. growth_rate=1. appear=1. f2=1. critical_point=1. end_time=1. start_time=1. f1=1.
% 0.46/0.77
% 0.46/0.77 ============================== end of process initial clauses ========
% 0.46/0.77
% 0.46/0.77 ============================== CLAUSES FOR SEARCH ====================
% 0.46/0.77
% 0.46/0.77 ============================== end of clauses for search =============
% 0.46/0.77
% 0.46/0.77 ============================== SEARCH ================================
% 0.46/0.77
% 0.46/0.77 % Starting search at 0.01 seconds.
% 0.50/0.86
% 0.50/0.86 ============================== PROOF =================================
% 0.50/0.86 % SZS status Theorem
% 0.50/0.86 % SZS output start Refutation
% 0.50/0.86
% 0.50/0.86 % Proof 1 at 0.09 (+ 0.01) seconds.
% 0.50/0.86 % Length of proof is 192.
% 0.50/0.86 % Level of proof is 53.
% 0.50/0.86 % Maximum clause weight is 51.000.
% 0.50/0.86 % Given clauses 449.
% 0.50/0.86
% 0.50/0.86 1 (all E all S1 all S2 all T (environment(E) & subpopulations(S1,S2,E,T) & greater(growth_rate(S2,T),growth_rate(S1,T)) -> selection_favors(S2,S1,T))) # label(mp1_high_growth_rates) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 2 (all E all S1 all S2 all T (environment(E) & subpopulation(S1,E,T) & subpopulation(S2,E,T) & greater(cardinality_at_time(S1,T),zero) & cardinality_at_time(S2,T) = zero -> selection_favors(S1,S2,T))) # label(mp2_favour_members) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 3 (all P (observational_period(P) & propagation_strategy(first_movers) & propagation_strategy(efficient_producers) & (all E (environment(E) & in_environment(P,E) -> selection_favors(efficient_producers,first_movers,end_time(E)))) -> selection_favors(efficient_producers,first_movers,P))) # label(mp3_favoured_trategy) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 4 (all P (observational_period(P) & slow_change(P) -> (all E (environment(E) & in_environment(P,E) -> (exists T (in_environment(E,T) & greater(T,critical_point(E)))))))) # label(mp4_critical_point) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 5 (all E all T (environment(E) & greater_or_equal(T,start_time(E)) & greater_or_equal(end_time(E),T) -> in_environment(E,T))) # label(mp_time_in_environment) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 6 (all E all T (environment(E) & in_environment(E,T) -> greater_or_equal(end_time(E),T))) # label(mp_environment_end_point) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 7 (all E all T (environment(E) & in_environment(E,T) & greater(cardinality_at_time(first_movers,T),zero) & greater(cardinality_at_time(efficient_producers,T),zero) -> subpopulations(first_movers,efficient_producers,E,T))) # label(mp_contains_FM_and_EP) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 8 (all E all T (environment(E) & in_environment(E,T) -> greater_or_equal(cardinality_at_time(first_movers,T),zero))) # label(mp_first_movers_exist) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 9 (all E all T (environment(E) & in_environment(E,T) -> subpopulation(first_movers,E,T) & subpopulation(efficient_producers,E,T))) # label(mp_subpopulations) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 10 (all E (environment(E) -> greater_or_equal(critical_point(E),appear(efficient_producers,E)))) # label(mp_critical_point_after_EP) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 11 (all E (environment(E) -> greater_or_equal(critical_point(E),start_time(E)))) # label(mp_time_of_critical_point) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 12 (all X all Y all Z (greater(X,Y) & greater(Y,Z) -> greater(X,Z))) # label(mp_greater_transitivity) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 14 (all X all Y (greater_or_equal(X,Y) <-> greater(X,Y) | X = Y)) # label(mp_greater_or_equal) # label(axiom) # label(non_clause). [assumption].
% 0.50/0.86 15 (all E all Tc (environment(E) & Tc = critical_point(E) -> -greater(growth_rate(efficient_producers,Tc),growth_rate(first_movers,Tc)) & (all T (subpopulations(first_movers,efficient_producers,E,T) & greater(T,Tc) -> greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)))))) # label(d1) # label(hypothesis) # label(non_clause). [assumption].
% 0.50/0.86 16 (all E all T (environment(E) & in_environment(E,T) & greater_or_equal(T,appear(efficient_producers,E)) -> greater(cardinality_at_time(efficient_producers,T),zero))) # label(t6) # label(hypothesis) # label(non_clause). [assumption].
% 0.50/0.86 17 -(all P (observational_period(P) & slow_change(P) -> selection_favors(efficient_producers,first_movers,P))) # label(prove_t8) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.50/0.86 18 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(3)].
% 0.50/0.86 19 observational_period(c1) # label(prove_t8) # label(negated_conjecture). [clausify(17)].
% 0.50/0.86 20 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,f1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(3)].
% 0.50/0.86 21 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | in_environment(B,f2(A,B)) # label(mp4_critical_point) # label(axiom). [clausify(4)].
% 0.50/0.86 22 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | greater(f2(A,B),critical_point(B)) # label(mp4_critical_point) # label(axiom). [clausify(4)].
% 0.50/0.86 23 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy) # label(axiom). [clausify(3)].
% 0.50/0.86 24 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(18,a,19,a)].
% 0.50/0.86 26 -environment(A) | greater_or_equal(critical_point(A),start_time(A)) # label(mp_time_of_critical_point) # label(axiom). [clausify(11)].
% 0.50/0.86 27 -environment(A) | greater_or_equal(critical_point(A),appear(efficient_producers,A)) # label(mp_critical_point_after_EP) # label(axiom). [clausify(10)].
% 0.50/0.86 28 -environment(A) | -in_environment(A,B) | greater_or_equal(end_time(A),B) # label(mp_environment_end_point) # label(axiom). [clausify(6)].
% 0.50/0.86 29 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations) # label(axiom). [clausify(9)].
% 0.50/0.86 30 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations) # label(axiom). [clausify(9)].
% 0.50/0.86 31 -environment(A) | -in_environment(A,B) | greater_or_equal(cardinality_at_time(first_movers,B),zero) # label(mp_first_movers_exist) # label(axiom). [clausify(8)].
% 0.50/0.86 32 -environment(A) | -greater_or_equal(B,start_time(A)) | -greater_or_equal(end_time(A),B) | in_environment(A,B) # label(mp_time_in_environment) # label(axiom). [clausify(5)].
% 0.50/0.86 34 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(efficient_producers,A)) | greater(cardinality_at_time(efficient_producers,B),zero) # label(t6) # label(hypothesis). [clausify(16)].
% 0.50/0.86 35 -environment(A) | -subpopulations(B,C,A,D) | -greater(growth_rate(C,D),growth_rate(B,D)) | selection_favors(C,B,D) # label(mp1_high_growth_rates) # label(axiom). [clausify(1)].
% 0.50/0.86 36 -environment(A) | -in_environment(A,B) | -greater(cardinality_at_time(first_movers,B),zero) | -greater(cardinality_at_time(efficient_producers,B),zero) | subpopulations(first_movers,efficient_producers,A,B) # label(mp_contains_FM_and_EP) # label(axiom). [clausify(7)].
% 0.50/0.86 37 -environment(A) | critical_point(A) != B | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,B) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(d1) # label(hypothesis). [clausify(15)].
% 0.50/0.86 38 -environment(A) | -subpopulation(B,A,C) | -subpopulation(D,A,C) | -greater(cardinality_at_time(B,C),zero) | cardinality_at_time(D,C) != zero | selection_favors(B,D,C) # label(mp2_favour_members) # label(axiom). [clausify(2)].
% 0.50/0.86 39 -slow_change(c1) | -environment(A) | -in_environment(c1,A) | in_environment(A,f2(c1,A)). [resolve(21,a,19,a)].
% 0.50/0.86 40 -slow_change(c1) | -environment(A) | -in_environment(c1,A) | greater(f2(c1,A),critical_point(A)). [resolve(22,a,19,a)].
% 0.50/0.86 41 propagation_strategy(first_movers) # label(mp_organizational_sets1) # label(axiom). [assumption].
% 0.50/0.86 42 propagation_strategy(efficient_producers) # label(mp_organizational_sets2) # label(axiom). [assumption].
% 0.50/0.86 43 slow_change(c1) # label(prove_t8) # label(negated_conjecture). [clausify(17)].
% 0.50/0.86 44 -selection_favors(efficient_producers,first_movers,c1) # label(prove_t8) # label(negated_conjecture). [clausify(17)].
% 0.50/0.86 45 greater_or_equal(A,B) | -greater(A,B) # label(mp_greater_or_equal) # label(axiom). [clausify(14)].
% 0.50/0.86 46 greater_or_equal(A,B) | B != A # label(mp_greater_or_equal) # label(axiom). [clausify(14)].
% 0.50/0.86 47 -greater(A,B) | -greater(B,C) | greater(A,C) # label(mp_greater_transitivity) # label(axiom). [clausify(12)].
% 0.50/0.86 48 -greater_or_equal(A,B) | greater(A,B) | B = A # label(mp_greater_or_equal) # label(axiom). [clausify(14)].
% 0.50/0.86 49 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(c1,f1(c1)) | selection_favors(efficient_producers,first_movers,c1). [resolve(20,a,19,a)].
% 0.50/0.86 50 in_environment(c1,f1(c1)). [copy(49),unit_del(a,41),unit_del(b,42),unit_del(d,44)].
% 0.50/0.86 51 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(f1(c1))) | selection_favors(efficient_producers,first_movers,c1). [resolve(23,a,19,a)].
% 0.50/0.86 52 -selection_favors(efficient_producers,first_movers,end_time(f1(c1))). [copy(51),unit_del(a,41),unit_del(b,42),unit_del(d,44)].
% 0.50/0.86 55 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | greater_or_equal(critical_point(f1(c1)),start_time(f1(c1))). [resolve(24,c,26,a)].
% 0.50/0.86 56 greater_or_equal(critical_point(f1(c1)),start_time(f1(c1))). [copy(55),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 57 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | greater_or_equal(critical_point(f1(c1)),appear(efficient_producers,f1(c1))). [resolve(24,c,27,a)].
% 0.50/0.86 58 greater_or_equal(critical_point(f1(c1)),appear(efficient_producers,f1(c1))). [copy(57),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 59 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | greater_or_equal(end_time(f1(c1)),A). [resolve(24,c,28,a)].
% 0.50/0.86 60 -in_environment(f1(c1),A) | greater_or_equal(end_time(f1(c1)),A). [copy(59),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 61 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | subpopulation(first_movers,f1(c1),A). [resolve(24,c,29,a)].
% 0.50/0.86 62 -in_environment(f1(c1),A) | subpopulation(first_movers,f1(c1),A). [copy(61),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 63 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | subpopulation(efficient_producers,f1(c1),A). [resolve(24,c,30,a)].
% 0.50/0.86 64 -in_environment(f1(c1),A) | subpopulation(efficient_producers,f1(c1),A). [copy(63),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 65 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | greater_or_equal(cardinality_at_time(first_movers,A),zero). [resolve(24,c,31,a)].
% 0.50/0.86 66 -in_environment(f1(c1),A) | greater_or_equal(cardinality_at_time(first_movers,A),zero). [copy(65),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 67 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -greater_or_equal(A,start_time(f1(c1))) | -greater_or_equal(end_time(f1(c1)),A) | in_environment(f1(c1),A). [resolve(24,c,32,a)].
% 0.50/0.86 68 -greater_or_equal(A,start_time(f1(c1))) | -greater_or_equal(end_time(f1(c1)),A) | in_environment(f1(c1),A). [copy(67),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 71 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | -greater_or_equal(A,appear(efficient_producers,f1(c1))) | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(24,c,34,a)].
% 0.50/0.86 72 -in_environment(f1(c1),A) | -greater_or_equal(A,appear(efficient_producers,f1(c1))) | greater(cardinality_at_time(efficient_producers,A),zero). [copy(71),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 73 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -subpopulations(A,B,f1(c1),C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [resolve(24,c,35,a)].
% 0.50/0.86 74 -subpopulations(A,B,f1(c1),C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [copy(73),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 75 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -in_environment(f1(c1),A) | -greater(cardinality_at_time(first_movers,A),zero) | -greater(cardinality_at_time(efficient_producers,A),zero) | subpopulations(first_movers,efficient_producers,f1(c1),A). [resolve(24,c,36,a)].
% 0.50/0.86 76 -in_environment(f1(c1),A) | -greater(cardinality_at_time(first_movers,A),zero) | -greater(cardinality_at_time(efficient_producers,A),zero) | subpopulations(first_movers,efficient_producers,f1(c1),A). [copy(75),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 77 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | critical_point(f1(c1)) != A | -subpopulations(first_movers,efficient_producers,f1(c1),B) | -greater(B,A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(24,c,37,a)].
% 0.50/0.86 78 critical_point(f1(c1)) != A | -subpopulations(first_movers,efficient_producers,f1(c1),B) | -greater(B,A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [copy(77),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 79 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1) | -subpopulation(A,f1(c1),B) | -subpopulation(C,f1(c1),B) | -greater(cardinality_at_time(A,B),zero) | cardinality_at_time(C,B) != zero | selection_favors(A,C,B). [resolve(24,c,38,a)].
% 0.50/0.86 80 -subpopulation(A,f1(c1),B) | -subpopulation(C,f1(c1),B) | -greater(cardinality_at_time(A,B),zero) | cardinality_at_time(C,B) != zero | selection_favors(A,C,B). [copy(79),unit_del(a,41),unit_del(b,42),unit_del(c,44)].
% 0.50/0.86 81 -slow_change(c1) | -in_environment(c1,f1(c1)) | in_environment(f1(c1),f2(c1,f1(c1))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1). [resolve(39,b,24,c)].
% 0.50/0.86 82 in_environment(f1(c1),f2(c1,f1(c1))). [copy(81),unit_del(a,43),unit_del(b,50),unit_del(d,41),unit_del(e,42),unit_del(f,44)].
% 0.50/0.86 83 -slow_change(c1) | -in_environment(c1,f1(c1)) | greater(f2(c1,f1(c1)),critical_point(f1(c1))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,c1). [resolve(40,b,24,c)].
% 0.50/0.86 84 greater(f2(c1,f1(c1)),critical_point(f1(c1))). [copy(83),unit_del(a,43),unit_del(b,50),unit_del(d,41),unit_del(e,42),unit_del(f,44)].
% 0.50/0.86 86 greater_or_equal(A,A). [xx_res(46,b)].
% 0.50/0.86 88 greater(critical_point(f1(c1)),start_time(f1(c1))) | start_time(f1(c1)) = critical_point(f1(c1)). [resolve(56,a,48,a)].
% 0.50/0.86 89 greater(critical_point(f1(c1)),appear(efficient_producers,f1(c1))) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(58,a,48,a)].
% 0.50/0.86 91 -greater(cardinality_at_time(first_movers,f2(c1,f1(c1))),zero) | -greater(cardinality_at_time(efficient_producers,f2(c1,f1(c1))),zero) | subpopulations(first_movers,efficient_producers,f1(c1),f2(c1,f1(c1))). [resolve(82,a,76,a)].
% 0.50/0.86 92 -greater_or_equal(f2(c1,f1(c1)),appear(efficient_producers,f1(c1))) | greater(cardinality_at_time(efficient_producers,f2(c1,f1(c1))),zero). [resolve(82,a,72,a)].
% 0.50/0.86 93 greater_or_equal(cardinality_at_time(first_movers,f2(c1,f1(c1))),zero). [resolve(82,a,66,a)].
% 0.50/0.86 94 subpopulation(efficient_producers,f1(c1),f2(c1,f1(c1))). [resolve(82,a,64,a)].
% 0.50/0.86 95 subpopulation(first_movers,f1(c1),f2(c1,f1(c1))). [resolve(82,a,62,a)].
% 0.50/0.86 96 greater_or_equal(end_time(f1(c1)),f2(c1,f1(c1))). [resolve(82,a,60,a)].
% 0.50/0.86 97 -greater(A,f2(c1,f1(c1))) | greater(A,critical_point(f1(c1))). [resolve(84,a,47,b)].
% 0.50/0.86 98 -greater(critical_point(f1(c1)),A) | greater(f2(c1,f1(c1)),A). [resolve(84,a,47,a)].
% 0.50/0.86 99 greater_or_equal(f2(c1,f1(c1)),critical_point(f1(c1))). [resolve(84,a,45,b)].
% 0.50/0.86 100 -greater_or_equal(end_time(f1(c1)),start_time(f1(c1))) | in_environment(f1(c1),end_time(f1(c1))). [resolve(86,a,68,b)].
% 0.50/0.86 102 greater(cardinality_at_time(first_movers,f2(c1,f1(c1))),zero) | cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero. [resolve(93,a,48,a),flip(b)].
% 0.50/0.86 105 -subpopulation(A,f1(c1),f2(c1,f1(c1))) | -greater(cardinality_at_time(efficient_producers,f2(c1,f1(c1))),zero) | cardinality_at_time(A,f2(c1,f1(c1))) != zero | selection_favors(efficient_producers,A,f2(c1,f1(c1))). [resolve(94,a,80,a)].
% 0.50/0.86 109 greater(end_time(f1(c1)),f2(c1,f1(c1))) | f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(96,a,48,a)].
% 0.50/0.86 111 start_time(f1(c1)) = critical_point(f1(c1)) | -greater(A,critical_point(f1(c1))) | greater(A,start_time(f1(c1))). [resolve(88,a,47,b)].
% 0.50/0.86 114 appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | greater(f2(c1,f1(c1)),appear(efficient_producers,f1(c1))). [resolve(89,a,98,a)].
% 0.50/0.86 120 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | -greater(cardinality_at_time(efficient_producers,f2(c1,f1(c1))),zero) | subpopulations(first_movers,efficient_producers,f1(c1),f2(c1,f1(c1))). [resolve(102,a,91,a)].
% 0.50/0.86 123 f2(c1,f1(c1)) = end_time(f1(c1)) | greater(end_time(f1(c1)),critical_point(f1(c1))). [resolve(109,a,97,a)].
% 0.50/0.86 127 f2(c1,f1(c1)) = end_time(f1(c1)) | -greater(critical_point(f1(c1)),A) | greater(end_time(f1(c1)),A). [resolve(123,b,47,a)].
% 0.50/0.86 128 f2(c1,f1(c1)) = end_time(f1(c1)) | greater_or_equal(end_time(f1(c1)),critical_point(f1(c1))). [resolve(123,b,45,b)].
% 0.50/0.86 145 start_time(f1(c1)) = critical_point(f1(c1)) | greater(end_time(f1(c1)),start_time(f1(c1))) | f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(111,b,123,b)].
% 0.50/0.86 149 appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | greater_or_equal(f2(c1,f1(c1)),appear(efficient_producers,f1(c1))). [resolve(114,b,45,b)].
% 0.50/0.86 150 appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | greater(cardinality_at_time(efficient_producers,f2(c1,f1(c1))),zero). [resolve(149,b,92,a)].
% 0.50/0.86 155 -greater(cardinality_at_time(efficient_producers,f2(c1,f1(c1))),zero) | cardinality_at_time(first_movers,f2(c1,f1(c1))) != zero | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(105,a,95,a)].
% 0.50/0.86 156 f2(c1,f1(c1)) = end_time(f1(c1)) | greater(end_time(f1(c1)),appear(efficient_producers,f1(c1))) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(127,b,89,a)].
% 0.50/0.86 171 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | subpopulations(first_movers,efficient_producers,f1(c1),f2(c1,f1(c1))) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(120,b,150,b)].
% 0.50/0.86 179 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | greater_or_equal(end_time(f1(c1)),start_time(f1(c1))). [resolve(145,b,45,b)].
% 0.50/0.86 182 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | in_environment(f1(c1),end_time(f1(c1))). [resolve(179,c,100,a)].
% 0.50/0.86 188 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | -greater(cardinality_at_time(first_movers,end_time(f1(c1))),zero) | -greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | subpopulations(first_movers,efficient_producers,f1(c1),end_time(f1(c1))). [resolve(182,c,76,a)].
% 0.50/0.86 189 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | -greater_or_equal(end_time(f1(c1)),appear(efficient_producers,f1(c1))) | greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero). [resolve(182,c,72,a)].
% 0.50/0.86 190 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | greater_or_equal(cardinality_at_time(first_movers,end_time(f1(c1))),zero). [resolve(182,c,66,a)].
% 0.50/0.86 191 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | subpopulation(efficient_producers,f1(c1),end_time(f1(c1))). [resolve(182,c,64,a)].
% 0.50/0.86 192 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | subpopulation(first_movers,f1(c1),end_time(f1(c1))). [resolve(182,c,62,a)].
% 0.50/0.86 202 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | greater(cardinality_at_time(first_movers,end_time(f1(c1))),zero) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero. [resolve(190,c,48,a),flip(d)].
% 0.50/0.86 207 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | -subpopulation(A,f1(c1),end_time(f1(c1))) | -greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | cardinality_at_time(A,end_time(f1(c1))) != zero | selection_favors(efficient_producers,A,end_time(f1(c1))). [resolve(191,c,80,a)].
% 0.50/0.86 214 cardinality_at_time(first_movers,f2(c1,f1(c1))) != zero | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(155,a,150,b)].
% 0.50/0.86 217 f2(c1,f1(c1)) = end_time(f1(c1)) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | greater_or_equal(end_time(f1(c1)),appear(efficient_producers,f1(c1))). [resolve(156,b,45,b)].
% 0.50/0.86 219 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | critical_point(f1(c1)) != A | -greater(f2(c1,f1(c1)),A) | greater(growth_rate(efficient_producers,f2(c1,f1(c1))),growth_rate(first_movers,f2(c1,f1(c1)))). [resolve(171,b,78,b)].
% 0.50/0.86 220 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | -greater(growth_rate(efficient_producers,f2(c1,f1(c1))),growth_rate(first_movers,f2(c1,f1(c1)))) | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(171,b,74,a)].
% 0.50/0.86 271 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(189,c,217,c),merge(d)].
% 0.50/0.86 276 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | -greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | subpopulations(first_movers,efficient_producers,f1(c1),end_time(f1(c1))) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero. [resolve(188,c,202,c),merge(e),merge(f)].
% 0.50/0.86 300 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | -greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | cardinality_at_time(first_movers,end_time(f1(c1))) != zero. [resolve(207,c,192,c),merge(f),merge(g),unit_del(e,52)].
% 0.50/0.86 301 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) != zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(300,c,271,c),merge(d),merge(e)].
% 0.50/0.86 302 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | subpopulations(first_movers,efficient_producers,f1(c1),end_time(f1(c1))) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(276,c,271,c),merge(e),merge(f)].
% 0.50/0.86 308 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | critical_point(f1(c1)) != A | -greater(end_time(f1(c1)),A) | greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(302,c,78,b)].
% 0.50/0.86 309 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | -greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(302,c,74,a),unit_del(f,52)].
% 0.50/0.86 310 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | greater(growth_rate(efficient_producers,f2(c1,f1(c1))),growth_rate(first_movers,f2(c1,f1(c1)))). [resolve(219,d,84,a),xx(c)].
% 0.50/0.86 311 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(310,c,220,c),merge(c),merge(d)].
% 0.50/0.86 330 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(308,f,123,b),xx(e),merge(f)].
% 0.50/0.86 332 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(330,e,309,e),merge(e),merge(f),merge(g),merge(h)].
% 0.50/0.86 335 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(332,c,301,c),merge(d),merge(e),merge(f)].
% 0.50/0.86 368 start_time(f1(c1)) = critical_point(f1(c1)) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero. [para(335(b,1),311(c,3)),merge(d),unit_del(d,52)].
% 0.50/0.86 413 start_time(f1(c1)) = critical_point(f1(c1)) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(368,c,214,a),merge(d)].
% 0.50/0.86 419 start_time(f1(c1)) = critical_point(f1(c1)) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [para(335(b,1),413(c,3)),merge(c),merge(d),unit_del(c,52)].
% 0.50/0.86 421 start_time(f1(c1)) = critical_point(f1(c1)) | greater(cardinality_at_time(efficient_producers,f2(c1,f1(c1))),zero). [para(419(b,1),92(a,2)),unit_del(b,99)].
% 0.50/0.86 423 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | -greater_or_equal(end_time(f1(c1)),critical_point(f1(c1))) | greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero). [para(419(b,1),189(c,2)),merge(b)].
% 0.50/0.86 426 start_time(f1(c1)) = critical_point(f1(c1)) | cardinality_at_time(first_movers,f2(c1,f1(c1))) != zero | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(421,b,155,a)].
% 0.50/0.86 427 start_time(f1(c1)) = critical_point(f1(c1)) | cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | subpopulations(first_movers,efficient_producers,f1(c1),f2(c1,f1(c1))). [resolve(421,b,120,b)].
% 0.50/0.86 432 start_time(f1(c1)) = critical_point(f1(c1)) | cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | critical_point(f1(c1)) != A | -greater(f2(c1,f1(c1)),A) | greater(growth_rate(efficient_producers,f2(c1,f1(c1))),growth_rate(first_movers,f2(c1,f1(c1)))). [resolve(427,c,78,b)].
% 0.50/0.86 433 start_time(f1(c1)) = critical_point(f1(c1)) | cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | -greater(growth_rate(efficient_producers,f2(c1,f1(c1))),growth_rate(first_movers,f2(c1,f1(c1)))) | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(427,c,74,a)].
% 0.50/0.86 434 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero). [resolve(423,c,128,b),merge(d)].
% 0.50/0.86 437 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) != zero. [resolve(434,c,300,c),merge(c),merge(d)].
% 0.50/0.86 438 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | subpopulations(first_movers,efficient_producers,f1(c1),end_time(f1(c1))) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero. [resolve(434,c,276,c),merge(c),merge(d)].
% 0.50/0.86 451 start_time(f1(c1)) = critical_point(f1(c1)) | cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | greater(growth_rate(efficient_producers,f2(c1,f1(c1))),growth_rate(first_movers,f2(c1,f1(c1)))). [resolve(432,d,84,a),xx(c)].
% 0.50/0.86 456 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | critical_point(f1(c1)) != A | -greater(end_time(f1(c1)),A) | greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(438,c,78,b)].
% 0.50/0.86 457 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | -greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(438,c,74,a),unit_del(e,52)].
% 0.50/0.86 458 start_time(f1(c1)) = critical_point(f1(c1)) | cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(433,c,451,c),merge(d),merge(e)].
% 0.50/0.86 462 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(456,e,123,b),xx(d),merge(e)].
% 0.50/0.86 464 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero. [resolve(462,d,457,d),merge(d),merge(e),merge(f)].
% 0.50/0.86 466 start_time(f1(c1)) = critical_point(f1(c1)) | f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(464,c,437,c),merge(c),merge(d)].
% 0.50/0.86 499 start_time(f1(c1)) = critical_point(f1(c1)) | cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero. [para(466(b,1),458(c,3)),merge(b),unit_del(c,52)].
% 0.50/0.86 542 start_time(f1(c1)) = critical_point(f1(c1)) | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(499,b,426,b),merge(b)].
% 0.50/0.86 548 start_time(f1(c1)) = critical_point(f1(c1)). [para(466(b,1),542(b,3)),merge(b),unit_del(b,52)].
% 0.50/0.86 550 -greater_or_equal(end_time(f1(c1)),critical_point(f1(c1))) | in_environment(f1(c1),end_time(f1(c1))). [back_rewrite(100),rewrite([548(6)])].
% 0.50/0.86 553 in_environment(f1(c1),end_time(f1(c1))) | f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(550,a,128,b)].
% 0.50/0.86 554 f2(c1,f1(c1)) = end_time(f1(c1)) | -greater(cardinality_at_time(first_movers,end_time(f1(c1))),zero) | -greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | subpopulations(first_movers,efficient_producers,f1(c1),end_time(f1(c1))). [resolve(553,a,76,a)].
% 0.50/0.86 555 f2(c1,f1(c1)) = end_time(f1(c1)) | -greater_or_equal(end_time(f1(c1)),appear(efficient_producers,f1(c1))) | greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero). [resolve(553,a,72,a)].
% 0.50/0.86 556 f2(c1,f1(c1)) = end_time(f1(c1)) | greater_or_equal(cardinality_at_time(first_movers,end_time(f1(c1))),zero). [resolve(553,a,66,a)].
% 0.50/0.86 557 f2(c1,f1(c1)) = end_time(f1(c1)) | subpopulation(efficient_producers,f1(c1),end_time(f1(c1))). [resolve(553,a,64,a)].
% 0.50/0.86 558 f2(c1,f1(c1)) = end_time(f1(c1)) | subpopulation(first_movers,f1(c1),end_time(f1(c1))). [resolve(553,a,62,a)].
% 0.50/0.86 559 f2(c1,f1(c1)) = end_time(f1(c1)) | greater(cardinality_at_time(first_movers,end_time(f1(c1))),zero) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero. [resolve(556,b,48,a),flip(c)].
% 0.50/0.86 562 f2(c1,f1(c1)) = end_time(f1(c1)) | -subpopulation(A,f1(c1),end_time(f1(c1))) | -greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | cardinality_at_time(A,end_time(f1(c1))) != zero | selection_favors(efficient_producers,A,end_time(f1(c1))). [resolve(557,b,80,a)].
% 0.50/0.86 566 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | -greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | subpopulations(first_movers,efficient_producers,f1(c1),end_time(f1(c1))). [resolve(559,b,554,b),merge(c)].
% 0.50/0.86 569 f2(c1,f1(c1)) = end_time(f1(c1)) | greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(555,b,217,c),merge(c)].
% 0.50/0.86 576 f2(c1,f1(c1)) = end_time(f1(c1)) | -greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero) | cardinality_at_time(first_movers,end_time(f1(c1))) != zero. [resolve(562,b,558,b),merge(e),unit_del(d,52)].
% 0.50/0.86 577 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) != zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(576,b,569,b),merge(c)].
% 0.50/0.86 578 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | subpopulations(first_movers,efficient_producers,f1(c1),end_time(f1(c1))) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(566,c,569,b),merge(d)].
% 0.50/0.86 579 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | critical_point(f1(c1)) != A | -greater(end_time(f1(c1)),A) | greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(578,c,78,b)].
% 0.50/0.86 580 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | -greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(578,c,74,a),unit_del(e,52)].
% 0.50/0.86 581 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(579,e,123,b),xx(d),merge(e)].
% 0.50/0.86 582 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(581,d,580,d),merge(d),merge(e),merge(f)].
% 0.50/0.86 583 f2(c1,f1(c1)) = end_time(f1(c1)) | appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [resolve(582,b,577,b),merge(c),merge(d)].
% 0.50/0.86 613 appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero. [para(583(a,1),311(c,3)),merge(c),unit_del(c,52)].
% 0.50/0.86 643 appear(efficient_producers,f1(c1)) = critical_point(f1(c1)) | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(613,b,214,a),merge(c)].
% 0.50/0.86 649 appear(efficient_producers,f1(c1)) = critical_point(f1(c1)). [para(583(a,1),643(b,3)),merge(b),unit_del(b,52)].
% 0.50/0.86 650 f2(c1,f1(c1)) = end_time(f1(c1)) | -greater_or_equal(end_time(f1(c1)),critical_point(f1(c1))) | greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero). [back_rewrite(555),rewrite([649(15)])].
% 0.50/0.86 651 greater(cardinality_at_time(efficient_producers,f2(c1,f1(c1))),zero). [back_rewrite(92),rewrite([649(8)]),unit_del(a,99)].
% 0.50/0.86 653 cardinality_at_time(first_movers,f2(c1,f1(c1))) != zero | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [back_unit_del(155),unit_del(a,651)].
% 0.50/0.86 654 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | subpopulations(first_movers,efficient_producers,f1(c1),f2(c1,f1(c1))). [back_unit_del(120),unit_del(b,651)].
% 0.50/0.86 661 f2(c1,f1(c1)) = end_time(f1(c1)) | greater(cardinality_at_time(efficient_producers,end_time(f1(c1))),zero). [resolve(650,b,128,b),merge(c)].
% 0.50/0.86 662 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) != zero. [resolve(661,b,576,b),merge(b)].
% 0.50/0.86 663 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | subpopulations(first_movers,efficient_producers,f1(c1),end_time(f1(c1))). [resolve(661,b,566,c),merge(b)].
% 0.50/0.86 668 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | critical_point(f1(c1)) != A | -greater(f2(c1,f1(c1)),A) | greater(growth_rate(efficient_producers,f2(c1,f1(c1))),growth_rate(first_movers,f2(c1,f1(c1)))). [resolve(654,b,78,b)].
% 0.50/0.86 669 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | -greater(growth_rate(efficient_producers,f2(c1,f1(c1))),growth_rate(first_movers,f2(c1,f1(c1)))) | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(654,b,74,a)].
% 0.50/0.86 670 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | critical_point(f1(c1)) != A | -greater(end_time(f1(c1)),A) | greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(663,c,78,b)].
% 0.50/0.86 671 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | -greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(663,c,74,a),unit_del(d,52)].
% 0.50/0.86 672 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | greater(growth_rate(efficient_producers,f2(c1,f1(c1))),growth_rate(first_movers,f2(c1,f1(c1)))). [resolve(668,c,84,a),xx(b)].
% 0.50/0.86 677 cardinality_at_time(first_movers,f2(c1,f1(c1))) = zero | selection_favors(efficient_producers,first_movers,f2(c1,f1(c1))). [resolve(669,b,672,b),merge(c)].
% 0.50/0.86 678 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero | greater(growth_rate(efficient_producers,end_time(f1(c1))),growth_rate(first_movers,end_time(f1(c1)))). [resolve(670,d,123,b),xx(c),merge(d)].
% 0.50/0.86 679 f2(c1,f1(c1)) = end_time(f1(c1)) | cardinality_at_time(first_movers,end_time(f1(c1))) = zero. [resolve(678,c,671,c),merge(c),merge(d)].
% 0.50/0.86 680 f2(c1,f1(c1)) = end_time(f1(c1)). [resolve(679,b,662,b),merge(b)].
% 0.50/0.86 681 cardinality_at_time(first_movers,end_time(f1(c1))) = zero. [back_rewrite(677),rewrite([680(5),680(13)]),unit_del(b,52)].
% 0.50/0.86 688 $F. [back_rewrite(653),rewrite([680(5),681(5),680(9)]),xx(a),unit_del(a,52)].
% 0.50/0.86
% 0.50/0.86 % SZS output end Refutation
% 0.50/0.86 ============================== end of proof ==========================
% 0.50/0.86
% 0.50/0.86 ============================== STATISTICS ============================
% 0.50/0.86
% 0.50/0.86 Given=449. Generated=1244. Kept=629. proofs=1.
% 0.50/0.86 Usable=48. Sos=0. Demods=4. Limbo=8, Disabled=622. Hints=0.
% 0.50/0.86 Megabytes=0.81.
% 0.50/0.86 User_CPU=0.09, System_CPU=0.01, Wall_clock=0.
% 0.50/0.86
% 0.50/0.86 ============================== end of statistics =====================
% 0.50/0.86
% 0.50/0.86 ============================== end of search =========================
% 0.50/0.86
% 0.50/0.86 THEOREM PROVED
% 0.50/0.86 % SZS status Theorem
% 0.50/0.86
% 0.50/0.86 Exiting with 1 proof.
% 0.50/0.86
% 0.50/0.86 Process 1732 exit (max_proofs) Thu Jun 9 12:07:23 2022
% 0.50/0.86 Prover9 interrupted
%------------------------------------------------------------------------------