TSTP Solution File: MGT039-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT039-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n029.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 : Unsatisfiable 0.84s 1.12s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT039-2 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 07:32:51 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.76/1.01 ============================== Prover9 ===============================
% 0.76/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.01 Process 20700 was started by sandbox on n029.cluster.edu,
% 0.76/1.01 Thu Jun 9 07:32:52 2022
% 0.76/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20547_n029.cluster.edu".
% 0.76/1.01 ============================== end of head ===========================
% 0.76/1.01
% 0.76/1.01 ============================== INPUT =================================
% 0.76/1.01
% 0.76/1.01 % Reading from file /tmp/Prover9_20547_n029.cluster.edu
% 0.76/1.01
% 0.76/1.01 set(prolog_style_variables).
% 0.76/1.01 set(auto2).
% 0.76/1.01 % set(auto2) -> set(auto).
% 0.76/1.01 % set(auto) -> set(auto_inference).
% 0.76/1.01 % set(auto) -> set(auto_setup).
% 0.76/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.01 % set(auto) -> set(auto_limits).
% 0.76/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.01 % set(auto) -> set(auto_denials).
% 0.76/1.01 % set(auto) -> set(auto_process).
% 0.76/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.01 % set(auto2) -> assign(stats, some).
% 0.76/1.01 % set(auto2) -> clear(echo_input).
% 0.76/1.01 % set(auto2) -> set(quiet).
% 0.76/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.01 % set(auto2) -> clear(print_given).
% 0.76/1.01 assign(lrs_ticks,-1).
% 0.76/1.01 assign(sos_limit,10000).
% 0.76/1.01 assign(order,kbo).
% 0.76/1.01 set(lex_order_vars).
% 0.76/1.01 clear(print_given).
% 0.76/1.01
% 0.76/1.01 % formulas(sos). % not echoed (28 formulas)
% 0.76/1.01
% 0.76/1.01 ============================== end of input ==========================
% 0.76/1.01
% 0.76/1.01 % From the command line: assign(max_seconds, 300).
% 0.76/1.01
% 0.76/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.01
% 0.76/1.01 % Formulas that are not ordinary clauses:
% 0.76/1.01
% 0.76/1.01 ============================== end of process non-clausal formulas ===
% 0.76/1.01
% 0.76/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.76/1.01
% 0.76/1.01 ============================== PREDICATE ELIMINATION =================
% 0.76/1.01 1 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_35) # label(axiom). [assumption].
% 0.76/1.01 2 observational_period(sk3) # label(prove_t8_58) # label(negated_conjecture). [assumption].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3). [resolve(1,a,2,a)].
% 0.76/1.01 3 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_36) # label(axiom). [assumption].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(sk3,sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3). [resolve(3,a,2,a)].
% 0.76/1.01 4 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | in_environment(B,sk2(B,A)) # label(mp4_critical_point_38) # label(axiom). [assumption].
% 0.76/1.01 Derived: -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | in_environment(A,sk2(A,sk3)). [resolve(4,a,2,a)].
% 0.76/1.01 5 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | greater(sk2(B,A),critical_point(B)) # label(mp4_critical_point_39) # label(axiom). [assumption].
% 0.76/1.01 Derived: -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | greater(sk2(A,sk3),critical_point(A)). [resolve(5,a,2,a)].
% 0.76/1.01 6 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_37) # label(axiom). [assumption].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))) | selection_favors(efficient_producers,first_movers,sk3). [resolve(6,a,2,a)].
% 0.76/1.01 7 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3). [resolve(1,a,2,a)].
% 0.76/1.01 8 -environment(A) | B != critical_point(A) | -greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) # label(d1_55) # label(hypothesis). [assumption].
% 0.76/1.01 9 -environment(A) | greater_or_equal(critical_point(A),start_time(A)) # label(mp_time_of_critical_point_49) # label(axiom). [assumption].
% 0.76/1.01 10 -environment(A) | greater_or_equal(critical_point(A),appear(efficient_producers,A)) # label(mp_critical_point_after_EP_48) # label(axiom). [assumption].
% 0.76/1.01 11 -environment(A) | -in_environment(A,B) | greater_or_equal(end_time(A),B) # label(mp_environment_end_point_43) # label(axiom). [assumption].
% 0.76/1.01 12 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations_46) # label(axiom). [assumption].
% 0.76/1.01 13 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations_47) # label(axiom). [assumption].
% 0.76/1.01 14 -environment(A) | -in_environment(A,B) | greater_or_equal(cardinality_at_time(first_movers,B),zero) # label(mp_first_movers_exist_45) # label(axiom). [assumption].
% 0.76/1.01 15 -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_42) # label(axiom). [assumption].
% 0.76/1.01 16 -environment(A) | -greater(B,start_time(A)) | greater(B,end_time(A)) | greater_or_equal(end_time(A),B) # label(mp_beginning_and_ending_51) # label(axiom). [assumption].
% 0.76/1.01 17 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(efficient_producers,A)) | greater(cardinality_at_time(efficient_producers,B),zero) # label(t6_57) # label(hypothesis). [assumption].
% 0.76/1.01 18 -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_33) # label(axiom). [assumption].
% 0.76/1.01 19 -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_44) # label(axiom). [assumption].
% 0.76/1.01 20 -environment(A) | B != critical_point(A) | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,B) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(d1_56) # label(hypothesis). [assumption].
% 0.76/1.01 21 -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_34) # label(axiom). [assumption].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | A != critical_point(sk1(sk3)) | -greater(growth_rate(efficient_producers,A),growth_rate(first_movers,A)). [resolve(7,c,8,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | greater_or_equal(critical_point(sk1(sk3)),start_time(sk1(sk3))). [resolve(7,c,9,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | greater_or_equal(critical_point(sk1(sk3)),appear(efficient_producers,sk1(sk3))). [resolve(7,c,10,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | greater_or_equal(end_time(sk1(sk3)),A). [resolve(7,c,11,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | subpopulation(first_movers,sk1(sk3),A). [resolve(7,c,12,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | subpopulation(efficient_producers,sk1(sk3),A). [resolve(7,c,13,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | greater_or_equal(cardinality_at_time(first_movers,A),zero). [resolve(7,c,14,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -greater_or_equal(A,start_time(sk1(sk3))) | -greater_or_equal(end_time(sk1(sk3)),A) | in_environment(sk1(sk3),A). [resolve(7,c,15,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -greater(A,start_time(sk1(sk3))) | greater(A,end_time(sk1(sk3))) | greater_or_equal(end_time(sk1(sk3)),A). [resolve(7,c,16,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | -greater_or_equal(A,appear(efficient_producers,sk1(sk3))) | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(7,c,17,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -subpopulations(A,B,sk1(sk3),C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [resolve(7,c,18,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | -greater(cardinality_at_time(first_movers,A),zero) | -greater(cardinality_at_time(efficient_producers,A),zero) | subpopulations(first_movers,efficient_producers,sk1(sk3),A). [resolve(7,c,19,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | A != critical_point(sk1(sk3)) | -subpopulations(first_movers,efficient_producers,sk1(sk3),B) | -greater(B,A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(7,c,20,a)].
% 0.76/1.01 Derived: -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -subpopulation(A,sk1(sk3),B) | -subpopulation(C,sk1(sk3),B) | -greater(cardinality_at_time(A,B),zero) | cardinality_at_time(C,B) != zero | selection_favors(A,C,B). [resolve(7,c,21,a)].
% 0.76/1.01 22 -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | in_environment(A,sk2(A,sk3)). [resolve(4,a,2,a)].
% 0.76/1.01 Derived: -slow_change(sk3) | -in_environment(sk3,sk1(sk3)) | in_environment(sk1(sk3),sk2(sk1(sk3),sk3)) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3). [resolve(22,b,7,c)].
% 0.76/1.01 23 -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | greater(sk2(A,sk3),critical_point(A)). [resolve(5,a,2,a)].
% 0.76/1.01 Derived: -slow_change(sk3) | -in_environment(sk3,sk1(sk3)) | greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3). [resolve(23,b,7,c)].
% 0.76/1.01
% 0.76/1.01 ============================== end predicate elimination =============
% 0.76/1.01
% 0.76/1.01 Auto_denials: (non-Horn, no changes).
% 0.76/1.01
% 0.76/1.01 Term ordering decisions:
% 0.76/1.01 Function symbol KB weights: sk3=1. efficient_producers=1. first_movers=1. zero=1. cardinality_at_time=1. growth_rate=1. appear=1. sk2=1. sk1=1. critical_point=1. end_time=1. start_time=1.
% 0.84/1.12
% 0.84/1.12 ============================== end of process initial clauses ========
% 0.84/1.12
% 0.84/1.12 ============================== CLAUSES FOR SEARCH ====================
% 0.84/1.12
% 0.84/1.12 ============================== end of clauses for search =============
% 0.84/1.12
% 0.84/1.12 ============================== SEARCH ================================
% 0.84/1.12
% 0.84/1.12 % Starting search at 0.02 seconds.
% 0.84/1.12
% 0.84/1.12 ============================== PROOF =================================
% 0.84/1.12 % SZS status Unsatisfiable
% 0.84/1.12 % SZS output start Refutation
% 0.84/1.12
% 0.84/1.12 % Proof 1 at 0.13 (+ 0.00) seconds.
% 0.84/1.12 % Length of proof is 176.
% 0.84/1.12 % Level of proof is 52.
% 0.84/1.12 % Maximum clause weight is 51.000.
% 0.84/1.12 % Given clauses 449.
% 0.84/1.12
% 0.84/1.12 1 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_35) # label(axiom). [assumption].
% 0.84/1.12 2 observational_period(sk3) # label(prove_t8_58) # label(negated_conjecture). [assumption].
% 0.84/1.12 3 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(A,sk1(A)) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_36) # label(axiom). [assumption].
% 0.84/1.12 4 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | in_environment(B,sk2(B,A)) # label(mp4_critical_point_38) # label(axiom). [assumption].
% 0.84/1.12 5 -observational_period(A) | -slow_change(A) | -environment(B) | -in_environment(A,B) | greater(sk2(B,A),critical_point(B)) # label(mp4_critical_point_39) # label(axiom). [assumption].
% 0.84/1.12 6 -observational_period(A) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(A))) | selection_favors(efficient_producers,first_movers,A) # label(mp3_favoured_trategy_37) # label(axiom). [assumption].
% 0.84/1.12 7 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | environment(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3). [resolve(1,a,2,a)].
% 0.84/1.12 9 -environment(A) | greater_or_equal(critical_point(A),start_time(A)) # label(mp_time_of_critical_point_49) # label(axiom). [assumption].
% 0.84/1.12 10 -environment(A) | greater_or_equal(critical_point(A),appear(efficient_producers,A)) # label(mp_critical_point_after_EP_48) # label(axiom). [assumption].
% 0.84/1.12 11 -environment(A) | -in_environment(A,B) | greater_or_equal(end_time(A),B) # label(mp_environment_end_point_43) # label(axiom). [assumption].
% 0.84/1.12 12 -environment(A) | -in_environment(A,B) | subpopulation(first_movers,A,B) # label(mp_subpopulations_46) # label(axiom). [assumption].
% 0.84/1.12 13 -environment(A) | -in_environment(A,B) | subpopulation(efficient_producers,A,B) # label(mp_subpopulations_47) # label(axiom). [assumption].
% 0.84/1.12 14 -environment(A) | -in_environment(A,B) | greater_or_equal(cardinality_at_time(first_movers,B),zero) # label(mp_first_movers_exist_45) # label(axiom). [assumption].
% 0.84/1.12 15 -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_42) # label(axiom). [assumption].
% 0.84/1.12 17 -environment(A) | -in_environment(A,B) | -greater_or_equal(B,appear(efficient_producers,A)) | greater(cardinality_at_time(efficient_producers,B),zero) # label(t6_57) # label(hypothesis). [assumption].
% 0.84/1.12 18 -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_33) # label(axiom). [assumption].
% 0.84/1.12 19 -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_44) # label(axiom). [assumption].
% 0.84/1.12 20 -environment(A) | B != critical_point(A) | -subpopulations(first_movers,efficient_producers,A,C) | -greater(C,B) | greater(growth_rate(efficient_producers,C),growth_rate(first_movers,C)) # label(d1_56) # label(hypothesis). [assumption].
% 0.84/1.12 21 -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_34) # label(axiom). [assumption].
% 0.84/1.12 22 -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | in_environment(A,sk2(A,sk3)). [resolve(4,a,2,a)].
% 0.84/1.12 23 -slow_change(sk3) | -environment(A) | -in_environment(sk3,A) | greater(sk2(A,sk3),critical_point(A)). [resolve(5,a,2,a)].
% 0.84/1.12 24 propagation_strategy(first_movers) # label(mp_organizational_sets1_40) # label(axiom). [assumption].
% 0.84/1.12 25 propagation_strategy(efficient_producers) # label(mp_organizational_sets2_41) # label(axiom). [assumption].
% 0.84/1.12 26 slow_change(sk3) # label(prove_t8_59) # label(negated_conjecture). [assumption].
% 0.84/1.12 27 -selection_favors(efficient_producers,first_movers,sk3) # label(prove_t8_60) # label(negated_conjecture). [assumption].
% 0.84/1.12 28 -greater(A,B) | greater_or_equal(A,B) # label(mp_greater_or_equal_53) # label(axiom). [assumption].
% 0.84/1.12 29 A != B | greater_or_equal(A,B) # label(mp_greater_or_equal_54) # label(axiom). [assumption].
% 0.84/1.12 30 -greater(A,B) | -greater(B,C) | greater(A,C) # label(mp_greater_transitivity_50) # label(axiom). [assumption].
% 0.84/1.12 31 -greater_or_equal(A,B) | greater(A,B) | A = B # label(mp_greater_or_equal_52) # label(axiom). [assumption].
% 0.84/1.12 32 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | in_environment(sk3,sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk3). [resolve(3,a,2,a)].
% 0.84/1.12 33 in_environment(sk3,sk1(sk3)). [copy(32),unit_del(a,24),unit_del(b,25),unit_del(d,27)].
% 0.84/1.12 34 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | -selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))) | selection_favors(efficient_producers,first_movers,sk3). [resolve(6,a,2,a)].
% 0.84/1.12 35 -selection_favors(efficient_producers,first_movers,end_time(sk1(sk3))). [copy(34),unit_del(a,24),unit_del(b,25),unit_del(d,27)].
% 0.84/1.12 38 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | greater_or_equal(critical_point(sk1(sk3)),start_time(sk1(sk3))). [resolve(7,c,9,a)].
% 0.84/1.12 39 greater_or_equal(critical_point(sk1(sk3)),start_time(sk1(sk3))). [copy(38),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 40 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | greater_or_equal(critical_point(sk1(sk3)),appear(efficient_producers,sk1(sk3))). [resolve(7,c,10,a)].
% 0.84/1.12 41 greater_or_equal(critical_point(sk1(sk3)),appear(efficient_producers,sk1(sk3))). [copy(40),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 42 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | greater_or_equal(end_time(sk1(sk3)),A). [resolve(7,c,11,a)].
% 0.84/1.12 43 -in_environment(sk1(sk3),A) | greater_or_equal(end_time(sk1(sk3)),A). [copy(42),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 44 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | subpopulation(first_movers,sk1(sk3),A). [resolve(7,c,12,a)].
% 0.84/1.12 45 -in_environment(sk1(sk3),A) | subpopulation(first_movers,sk1(sk3),A). [copy(44),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 46 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | subpopulation(efficient_producers,sk1(sk3),A). [resolve(7,c,13,a)].
% 0.84/1.12 47 -in_environment(sk1(sk3),A) | subpopulation(efficient_producers,sk1(sk3),A). [copy(46),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 48 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | greater_or_equal(cardinality_at_time(first_movers,A),zero). [resolve(7,c,14,a)].
% 0.84/1.12 49 -in_environment(sk1(sk3),A) | greater_or_equal(cardinality_at_time(first_movers,A),zero). [copy(48),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 50 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -greater_or_equal(A,start_time(sk1(sk3))) | -greater_or_equal(end_time(sk1(sk3)),A) | in_environment(sk1(sk3),A). [resolve(7,c,15,a)].
% 0.84/1.12 51 -greater_or_equal(A,start_time(sk1(sk3))) | -greater_or_equal(end_time(sk1(sk3)),A) | in_environment(sk1(sk3),A). [copy(50),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 54 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | -greater_or_equal(A,appear(efficient_producers,sk1(sk3))) | greater(cardinality_at_time(efficient_producers,A),zero). [resolve(7,c,17,a)].
% 0.84/1.12 55 -in_environment(sk1(sk3),A) | -greater_or_equal(A,appear(efficient_producers,sk1(sk3))) | greater(cardinality_at_time(efficient_producers,A),zero). [copy(54),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 56 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -subpopulations(A,B,sk1(sk3),C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [resolve(7,c,18,a)].
% 0.84/1.12 57 -subpopulations(A,B,sk1(sk3),C) | -greater(growth_rate(B,C),growth_rate(A,C)) | selection_favors(B,A,C). [copy(56),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 58 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -in_environment(sk1(sk3),A) | -greater(cardinality_at_time(first_movers,A),zero) | -greater(cardinality_at_time(efficient_producers,A),zero) | subpopulations(first_movers,efficient_producers,sk1(sk3),A). [resolve(7,c,19,a)].
% 0.84/1.12 59 -in_environment(sk1(sk3),A) | -greater(cardinality_at_time(first_movers,A),zero) | -greater(cardinality_at_time(efficient_producers,A),zero) | subpopulations(first_movers,efficient_producers,sk1(sk3),A). [copy(58),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 60 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | A != critical_point(sk1(sk3)) | -subpopulations(first_movers,efficient_producers,sk1(sk3),B) | -greater(B,A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [resolve(7,c,20,a)].
% 0.84/1.12 61 critical_point(sk1(sk3)) != A | -subpopulations(first_movers,efficient_producers,sk1(sk3),B) | -greater(B,A) | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)). [copy(60),flip(d),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 62 -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3) | -subpopulation(A,sk1(sk3),B) | -subpopulation(C,sk1(sk3),B) | -greater(cardinality_at_time(A,B),zero) | cardinality_at_time(C,B) != zero | selection_favors(A,C,B). [resolve(7,c,21,a)].
% 0.84/1.12 63 -subpopulation(A,sk1(sk3),B) | -subpopulation(C,sk1(sk3),B) | -greater(cardinality_at_time(A,B),zero) | cardinality_at_time(C,B) != zero | selection_favors(A,C,B). [copy(62),unit_del(a,24),unit_del(b,25),unit_del(c,27)].
% 0.84/1.12 64 -slow_change(sk3) | -in_environment(sk3,sk1(sk3)) | in_environment(sk1(sk3),sk2(sk1(sk3),sk3)) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3). [resolve(22,b,7,c)].
% 0.84/1.12 65 in_environment(sk1(sk3),sk2(sk1(sk3),sk3)). [copy(64),unit_del(a,26),unit_del(b,33),unit_del(d,24),unit_del(e,25),unit_del(f,27)].
% 0.84/1.12 66 -slow_change(sk3) | -in_environment(sk3,sk1(sk3)) | greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))) | -propagation_strategy(first_movers) | -propagation_strategy(efficient_producers) | selection_favors(efficient_producers,first_movers,sk3). [resolve(23,b,7,c)].
% 0.84/1.12 67 greater(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))). [copy(66),unit_del(a,26),unit_del(b,33),unit_del(d,24),unit_del(e,25),unit_del(f,27)].
% 0.84/1.12 69 greater_or_equal(A,A). [xx_res(29,a)].
% 0.84/1.12 71 greater(critical_point(sk1(sk3)),start_time(sk1(sk3))) | start_time(sk1(sk3)) = critical_point(sk1(sk3)). [resolve(39,a,31,a),flip(b)].
% 0.84/1.12 72 greater(critical_point(sk1(sk3)),appear(efficient_producers,sk1(sk3))) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(41,a,31,a),flip(b)].
% 0.84/1.12 74 -greater(cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)),zero) | -greater(cardinality_at_time(efficient_producers,sk2(sk1(sk3),sk3)),zero) | subpopulations(first_movers,efficient_producers,sk1(sk3),sk2(sk1(sk3),sk3)). [resolve(65,a,59,a)].
% 0.84/1.12 75 -greater_or_equal(sk2(sk1(sk3),sk3),appear(efficient_producers,sk1(sk3))) | greater(cardinality_at_time(efficient_producers,sk2(sk1(sk3),sk3)),zero). [resolve(65,a,55,a)].
% 0.84/1.12 76 greater_or_equal(cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)),zero). [resolve(65,a,49,a)].
% 0.84/1.12 77 subpopulation(efficient_producers,sk1(sk3),sk2(sk1(sk3),sk3)). [resolve(65,a,47,a)].
% 0.84/1.12 78 subpopulation(first_movers,sk1(sk3),sk2(sk1(sk3),sk3)). [resolve(65,a,45,a)].
% 0.84/1.12 79 greater_or_equal(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)). [resolve(65,a,43,a)].
% 0.84/1.12 80 -greater(A,sk2(sk1(sk3),sk3)) | greater(A,critical_point(sk1(sk3))). [resolve(67,a,30,b)].
% 0.84/1.12 81 -greater(critical_point(sk1(sk3)),A) | greater(sk2(sk1(sk3),sk3),A). [resolve(67,a,30,a)].
% 0.84/1.12 82 greater_or_equal(sk2(sk1(sk3),sk3),critical_point(sk1(sk3))). [resolve(67,a,28,a)].
% 0.84/1.12 83 -greater_or_equal(end_time(sk1(sk3)),start_time(sk1(sk3))) | in_environment(sk1(sk3),end_time(sk1(sk3))). [resolve(69,a,51,b)].
% 0.84/1.12 85 greater(cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)),zero) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero. [resolve(76,a,31,a)].
% 0.84/1.12 88 -subpopulation(A,sk1(sk3),sk2(sk1(sk3),sk3)) | -greater(cardinality_at_time(efficient_producers,sk2(sk1(sk3),sk3)),zero) | cardinality_at_time(A,sk2(sk1(sk3),sk3)) != zero | selection_favors(efficient_producers,A,sk2(sk1(sk3),sk3)). [resolve(77,a,63,a)].
% 0.84/1.12 92 greater(end_time(sk1(sk3)),sk2(sk1(sk3),sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)). [resolve(79,a,31,a),flip(b)].
% 0.84/1.12 94 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | -greater(A,critical_point(sk1(sk3))) | greater(A,start_time(sk1(sk3))). [resolve(71,a,30,b)].
% 0.84/1.12 97 appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | greater(sk2(sk1(sk3),sk3),appear(efficient_producers,sk1(sk3))). [resolve(72,a,81,a)].
% 0.84/1.12 103 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | -greater(cardinality_at_time(efficient_producers,sk2(sk1(sk3),sk3)),zero) | subpopulations(first_movers,efficient_producers,sk1(sk3),sk2(sk1(sk3),sk3)). [resolve(85,a,74,a)].
% 0.84/1.12 106 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater(end_time(sk1(sk3)),critical_point(sk1(sk3))). [resolve(92,a,80,a)].
% 0.84/1.12 110 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater(critical_point(sk1(sk3)),A) | greater(end_time(sk1(sk3)),A). [resolve(106,b,30,a)].
% 0.84/1.12 111 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater_or_equal(end_time(sk1(sk3)),critical_point(sk1(sk3))). [resolve(106,b,28,a)].
% 0.84/1.12 128 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | greater(end_time(sk1(sk3)),start_time(sk1(sk3))) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)). [resolve(94,b,106,b)].
% 0.84/1.12 132 appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | greater_or_equal(sk2(sk1(sk3),sk3),appear(efficient_producers,sk1(sk3))). [resolve(97,b,28,a)].
% 0.84/1.12 133 appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | greater(cardinality_at_time(efficient_producers,sk2(sk1(sk3),sk3)),zero). [resolve(132,b,75,a)].
% 0.84/1.12 138 -greater(cardinality_at_time(efficient_producers,sk2(sk1(sk3),sk3)),zero) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) != zero | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(88,a,78,a)].
% 0.84/1.12 139 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater(end_time(sk1(sk3)),appear(efficient_producers,sk1(sk3))) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(110,b,72,a)].
% 0.84/1.12 154 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | subpopulations(first_movers,efficient_producers,sk1(sk3),sk2(sk1(sk3),sk3)) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(103,b,133,b)].
% 0.84/1.12 162 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater_or_equal(end_time(sk1(sk3)),start_time(sk1(sk3))). [resolve(128,b,28,a)].
% 0.84/1.12 165 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | in_environment(sk1(sk3),end_time(sk1(sk3))). [resolve(162,c,83,a)].
% 0.84/1.12 171 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater(cardinality_at_time(first_movers,end_time(sk1(sk3))),zero) | -greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | subpopulations(first_movers,efficient_producers,sk1(sk3),end_time(sk1(sk3))). [resolve(165,c,59,a)].
% 0.84/1.12 172 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater_or_equal(end_time(sk1(sk3)),appear(efficient_producers,sk1(sk3))) | greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero). [resolve(165,c,55,a)].
% 0.84/1.12 173 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater_or_equal(cardinality_at_time(first_movers,end_time(sk1(sk3))),zero). [resolve(165,c,49,a)].
% 0.84/1.12 174 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | subpopulation(efficient_producers,sk1(sk3),end_time(sk1(sk3))). [resolve(165,c,47,a)].
% 0.84/1.12 175 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | subpopulation(first_movers,sk1(sk3),end_time(sk1(sk3))). [resolve(165,c,45,a)].
% 0.84/1.12 185 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater(cardinality_at_time(first_movers,end_time(sk1(sk3))),zero) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero. [resolve(173,c,31,a)].
% 0.84/1.12 190 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -subpopulation(A,sk1(sk3),end_time(sk1(sk3))) | -greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | cardinality_at_time(A,end_time(sk1(sk3))) != zero | selection_favors(efficient_producers,A,end_time(sk1(sk3))). [resolve(174,c,63,a)].
% 0.84/1.12 197 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) != zero | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(138,a,133,b)].
% 0.84/1.12 200 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | greater_or_equal(end_time(sk1(sk3)),appear(efficient_producers,sk1(sk3))). [resolve(139,b,28,a)].
% 0.84/1.12 202 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | critical_point(sk1(sk3)) != A | -greater(sk2(sk1(sk3),sk3),A) | greater(growth_rate(efficient_producers,sk2(sk1(sk3),sk3)),growth_rate(first_movers,sk2(sk1(sk3),sk3))). [resolve(154,b,61,b)].
% 0.84/1.12 203 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | -greater(growth_rate(efficient_producers,sk2(sk1(sk3),sk3)),growth_rate(first_movers,sk2(sk1(sk3),sk3))) | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(154,b,57,a)].
% 0.84/1.12 254 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(172,c,200,c),merge(d)].
% 0.84/1.12 259 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | subpopulations(first_movers,efficient_producers,sk1(sk3),end_time(sk1(sk3))) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero. [resolve(171,c,185,c),merge(e),merge(f)].
% 0.84/1.12 283 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | cardinality_at_time(first_movers,end_time(sk1(sk3))) != zero. [resolve(190,c,175,c),merge(f),merge(g),unit_del(e,35)].
% 0.84/1.12 284 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) != zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(283,c,254,c),merge(d),merge(e)].
% 0.84/1.12 285 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | subpopulations(first_movers,efficient_producers,sk1(sk3),end_time(sk1(sk3))) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(259,c,254,c),merge(e),merge(f)].
% 0.84/1.12 291 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | critical_point(sk1(sk3)) != A | -greater(end_time(sk1(sk3)),A) | greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(285,c,61,b)].
% 0.84/1.12 292 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | -greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(285,c,57,a),unit_del(f,35)].
% 0.84/1.12 293 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | greater(growth_rate(efficient_producers,sk2(sk1(sk3),sk3)),growth_rate(first_movers,sk2(sk1(sk3),sk3))). [resolve(202,d,67,a),xx(c)].
% 0.84/1.12 294 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(293,c,203,c),merge(c),merge(d)].
% 0.84/1.12 313 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(291,f,106,b),xx(e),merge(f)].
% 0.84/1.12 315 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(313,e,292,e),merge(e),merge(f),merge(g),merge(h)].
% 0.84/1.12 318 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(315,c,284,c),merge(d),merge(e),merge(f)].
% 0.84/1.12 351 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero. [para(318(b,1),294(c,3)),merge(d),unit_del(d,35)].
% 0.84/1.13 396 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(351,c,197,a),merge(d)].
% 0.84/1.13 402 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [para(318(b,1),396(c,3)),merge(c),merge(d),unit_del(c,35)].
% 0.84/1.13 404 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | greater(cardinality_at_time(efficient_producers,sk2(sk1(sk3),sk3)),zero). [para(402(b,1),75(a,2)),unit_del(b,82)].
% 0.84/1.13 406 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater_or_equal(end_time(sk1(sk3)),critical_point(sk1(sk3))) | greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero). [para(402(b,1),172(c,2)),merge(b)].
% 0.84/1.13 409 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) != zero | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(404,b,138,a)].
% 0.84/1.13 410 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | subpopulations(first_movers,efficient_producers,sk1(sk3),sk2(sk1(sk3),sk3)). [resolve(404,b,103,b)].
% 0.84/1.13 415 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | critical_point(sk1(sk3)) != A | -greater(sk2(sk1(sk3),sk3),A) | greater(growth_rate(efficient_producers,sk2(sk1(sk3),sk3)),growth_rate(first_movers,sk2(sk1(sk3),sk3))). [resolve(410,c,61,b)].
% 0.84/1.13 416 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | -greater(growth_rate(efficient_producers,sk2(sk1(sk3),sk3)),growth_rate(first_movers,sk2(sk1(sk3),sk3))) | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(410,c,57,a)].
% 0.84/1.13 417 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero). [resolve(406,c,111,b),merge(d)].
% 0.84/1.13 420 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) != zero. [resolve(417,c,283,c),merge(c),merge(d)].
% 0.84/1.13 421 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | subpopulations(first_movers,efficient_producers,sk1(sk3),end_time(sk1(sk3))) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero. [resolve(417,c,259,c),merge(c),merge(d)].
% 0.84/1.13 434 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | greater(growth_rate(efficient_producers,sk2(sk1(sk3),sk3)),growth_rate(first_movers,sk2(sk1(sk3),sk3))). [resolve(415,d,67,a),xx(c)].
% 0.84/1.13 439 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | critical_point(sk1(sk3)) != A | -greater(end_time(sk1(sk3)),A) | greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(421,c,61,b)].
% 0.84/1.13 440 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | -greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(421,c,57,a),unit_del(e,35)].
% 0.84/1.13 441 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(416,c,434,c),merge(d),merge(e)].
% 0.84/1.13 445 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(439,e,106,b),xx(d),merge(e)].
% 0.84/1.13 447 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero. [resolve(445,d,440,d),merge(d),merge(e),merge(f)].
% 0.84/1.13 449 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)). [resolve(447,c,420,c),merge(c),merge(d)].
% 0.84/1.13 482 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero. [para(449(b,1),441(c,3)),merge(b),unit_del(c,35)].
% 0.84/1.13 525 start_time(sk1(sk3)) = critical_point(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(482,b,409,b),merge(b)].
% 0.84/1.13 531 start_time(sk1(sk3)) = critical_point(sk1(sk3)). [para(449(b,1),525(b,3)),merge(b),unit_del(b,35)].
% 0.84/1.13 533 -greater_or_equal(end_time(sk1(sk3)),critical_point(sk1(sk3))) | in_environment(sk1(sk3),end_time(sk1(sk3))). [back_rewrite(83),rewrite([531(6)])].
% 0.84/1.13 536 in_environment(sk1(sk3),end_time(sk1(sk3))) | sk2(sk1(sk3),sk3) = end_time(sk1(sk3)). [resolve(533,a,111,b)].
% 0.84/1.13 537 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater(cardinality_at_time(first_movers,end_time(sk1(sk3))),zero) | -greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | subpopulations(first_movers,efficient_producers,sk1(sk3),end_time(sk1(sk3))). [resolve(536,a,59,a)].
% 0.84/1.13 538 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater_or_equal(end_time(sk1(sk3)),appear(efficient_producers,sk1(sk3))) | greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero). [resolve(536,a,55,a)].
% 0.84/1.13 539 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater_or_equal(cardinality_at_time(first_movers,end_time(sk1(sk3))),zero). [resolve(536,a,49,a)].
% 0.84/1.13 540 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | subpopulation(efficient_producers,sk1(sk3),end_time(sk1(sk3))). [resolve(536,a,47,a)].
% 0.84/1.13 541 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | subpopulation(first_movers,sk1(sk3),end_time(sk1(sk3))). [resolve(536,a,45,a)].
% 0.84/1.13 542 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater(cardinality_at_time(first_movers,end_time(sk1(sk3))),zero) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero. [resolve(539,b,31,a)].
% 0.84/1.13 545 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -subpopulation(A,sk1(sk3),end_time(sk1(sk3))) | -greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | cardinality_at_time(A,end_time(sk1(sk3))) != zero | selection_favors(efficient_producers,A,end_time(sk1(sk3))). [resolve(540,b,63,a)].
% 0.84/1.13 549 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | -greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | subpopulations(first_movers,efficient_producers,sk1(sk3),end_time(sk1(sk3))). [resolve(542,b,537,b),merge(c)].
% 0.84/1.13 552 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(538,b,200,c),merge(c)].
% 0.84/1.13 559 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero) | cardinality_at_time(first_movers,end_time(sk1(sk3))) != zero. [resolve(545,b,541,b),merge(e),unit_del(d,35)].
% 0.84/1.13 560 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) != zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(559,b,552,b),merge(c)].
% 0.84/1.13 561 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | subpopulations(first_movers,efficient_producers,sk1(sk3),end_time(sk1(sk3))) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(549,c,552,b),merge(d)].
% 0.84/1.13 562 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | critical_point(sk1(sk3)) != A | -greater(end_time(sk1(sk3)),A) | greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(561,c,61,b)].
% 0.84/1.13 563 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | -greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(561,c,57,a),unit_del(e,35)].
% 0.84/1.13 564 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(562,e,106,b),xx(d),merge(e)].
% 0.84/1.13 565 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(564,d,563,d),merge(d),merge(e),merge(f)].
% 0.84/1.13 566 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [resolve(565,b,560,b),merge(c),merge(d)].
% 0.84/1.13 596 appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero. [para(566(a,1),294(c,3)),merge(c),unit_del(c,35)].
% 0.84/1.13 626 appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)) | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(596,b,197,a),merge(c)].
% 0.84/1.13 632 appear(efficient_producers,sk1(sk3)) = critical_point(sk1(sk3)). [para(566(a,1),626(b,3)),merge(b),unit_del(b,35)].
% 0.84/1.13 633 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | -greater_or_equal(end_time(sk1(sk3)),critical_point(sk1(sk3))) | greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero). [back_rewrite(538),rewrite([632(15)])].
% 0.84/1.13 634 greater(cardinality_at_time(efficient_producers,sk2(sk1(sk3),sk3)),zero). [back_rewrite(75),rewrite([632(8)]),unit_del(a,82)].
% 0.84/1.13 636 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) != zero | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [back_unit_del(138),unit_del(a,634)].
% 0.84/1.13 637 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | subpopulations(first_movers,efficient_producers,sk1(sk3),sk2(sk1(sk3),sk3)). [back_unit_del(103),unit_del(b,634)].
% 0.84/1.13 644 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | greater(cardinality_at_time(efficient_producers,end_time(sk1(sk3))),zero). [resolve(633,b,111,b),merge(c)].
% 0.84/1.13 645 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) != zero. [resolve(644,b,559,b),merge(b)].
% 0.84/1.13 646 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | subpopulations(first_movers,efficient_producers,sk1(sk3),end_time(sk1(sk3))). [resolve(644,b,549,c),merge(b)].
% 0.84/1.13 651 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | critical_point(sk1(sk3)) != A | -greater(sk2(sk1(sk3),sk3),A) | greater(growth_rate(efficient_producers,sk2(sk1(sk3),sk3)),growth_rate(first_movers,sk2(sk1(sk3),sk3))). [resolve(637,b,61,b)].
% 0.84/1.13 652 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | -greater(growth_rate(efficient_producers,sk2(sk1(sk3),sk3)),growth_rate(first_movers,sk2(sk1(sk3),sk3))) | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(637,b,57,a)].
% 0.84/1.13 653 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | critical_point(sk1(sk3)) != A | -greater(end_time(sk1(sk3)),A) | greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(646,c,61,b)].
% 0.84/1.13 654 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | -greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(646,c,57,a),unit_del(d,35)].
% 0.84/1.13 655 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | greater(growth_rate(efficient_producers,sk2(sk1(sk3),sk3)),growth_rate(first_movers,sk2(sk1(sk3),sk3))). [resolve(651,c,67,a),xx(b)].
% 0.84/1.13 660 cardinality_at_time(first_movers,sk2(sk1(sk3),sk3)) = zero | selection_favors(efficient_producers,first_movers,sk2(sk1(sk3),sk3)). [resolve(652,b,655,b),merge(c)].
% 0.84/1.13 661 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero | greater(growth_rate(efficient_producers,end_time(sk1(sk3))),growth_rate(first_movers,end_time(sk1(sk3)))). [resolve(653,d,106,b),xx(c),merge(d)].
% 0.84/1.13 662 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)) | cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero. [resolve(661,c,654,c),merge(c),merge(d)].
% 0.84/1.13 663 sk2(sk1(sk3),sk3) = end_time(sk1(sk3)). [resolve(662,b,645,b),merge(b)].
% 0.84/1.13 664 cardinality_at_time(first_movers,end_time(sk1(sk3))) = zero. [back_rewrite(660),rewrite([663(5),663(13)]),unit_del(b,35)].
% 0.84/1.13 671 $F. [back_rewrite(636),rewrite([663(5),664(5),663(9)]),xx(a),unit_del(a,35)].
% 0.84/1.13
% 0.84/1.13 % SZS output end Refutation
% 0.84/1.13 ============================== end of proof ==========================
% 0.84/1.13
% 0.84/1.13 ============================== STATISTICS ============================
% 0.84/1.13
% 0.84/1.13 Given=449. Generated=1244. Kept=629. proofs=1.
% 0.84/1.13 Usable=48. Sos=0. Demods=4. Limbo=8, Disabled=622. Hints=0.
% 0.84/1.13 Megabytes=0.79.
% 0.84/1.13 User_CPU=0.13, System_CPU=0.00, Wall_clock=0.
% 0.84/1.13
% 0.84/1.13 ============================== end of statistics =====================
% 0.84/1.13
% 0.84/1.13 ============================== end of search =========================
% 0.84/1.13
% 0.84/1.13 THEOREM PROVED
% 0.84/1.13 % SZS status Unsatisfiable
% 0.84/1.13
% 0.84/1.13 Exiting with 1 proof.
% 0.84/1.13
% 0.84/1.13 Process 20700 exit (max_proofs) Thu Jun 9 07:32:52 2022
% 0.84/1.13 Prover9 interrupted
%------------------------------------------------------------------------------