TSTP Solution File: MGT024+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT024+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:22:54 EDT 2022
% Result : Theorem 0.67s 0.98s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT024+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 07:42:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/0.97 ============================== Prover9 ===============================
% 0.67/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.97 Process 5357 was started by sandbox2 on n021.cluster.edu,
% 0.67/0.97 Thu Jun 9 07:42:23 2022
% 0.67/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_5204_n021.cluster.edu".
% 0.67/0.97 ============================== end of head ===========================
% 0.67/0.97
% 0.67/0.97 ============================== INPUT =================================
% 0.67/0.97
% 0.67/0.97 % Reading from file /tmp/Prover9_5204_n021.cluster.edu
% 0.67/0.97
% 0.67/0.97 set(prolog_style_variables).
% 0.67/0.97 set(auto2).
% 0.67/0.97 % set(auto2) -> set(auto).
% 0.67/0.97 % set(auto) -> set(auto_inference).
% 0.67/0.97 % set(auto) -> set(auto_setup).
% 0.67/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.97 % set(auto) -> set(auto_limits).
% 0.67/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.97 % set(auto) -> set(auto_denials).
% 0.67/0.97 % set(auto) -> set(auto_process).
% 0.67/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.97 % set(auto2) -> assign(stats, some).
% 0.67/0.97 % set(auto2) -> clear(echo_input).
% 0.67/0.97 % set(auto2) -> set(quiet).
% 0.67/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.97 % set(auto2) -> clear(print_given).
% 0.67/0.97 assign(lrs_ticks,-1).
% 0.67/0.97 assign(sos_limit,10000).
% 0.67/0.97 assign(order,kbo).
% 0.67/0.97 set(lex_order_vars).
% 0.67/0.97 clear(print_given).
% 0.67/0.97
% 0.67/0.97 % formulas(sos). % not echoed (7 formulas)
% 0.67/0.97
% 0.67/0.97 ============================== end of input ==========================
% 0.67/0.97
% 0.67/0.97 % From the command line: assign(max_seconds, 300).
% 0.67/0.97
% 0.67/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.97
% 0.67/0.97 % Formulas that are not ordinary clauses:
% 0.67/0.97 1 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> in_environment(E,T))) # label(mp_time_point_occur) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 2 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> greater(number_of_organizations(E,T),zero))) # label(mp_positive_number_of_organizations) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 3 (all E all T (environment(E) & greater_or_equal(T,equilibrium(E)) -> -greater(equilibrium(E),T))) # label(mp_equilibrium) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 4 (all E all T (environment(E) & in_environment(E,T) & greater(number_of_organizations(E,T),zero) -> (greater(equilibrium(E),T) -> decreases(resources(E,T))) & (-greater(equilibrium(E),T) -> constant(resources(E,T))))) # label(a3) # label(hypothesis) # label(non_clause). [assumption].
% 0.67/0.97 5 (all E all T (environment(E) & in_environment(E,T) -> (decreases(resources(E,T)) -> -decreases(number_of_organizations(E,T))) & (constant(resources(E,T)) -> constant(number_of_organizations(E,T))))) # label(a6) # label(hypothesis) # label(non_clause). [assumption].
% 0.67/0.97 6 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) & constant(number_of_organizations(E,T)) -> growth_rate(first_movers,T) = zero & growth_rate(efficient_producers,T) = zero | greater(growth_rate(first_movers,T),zero) & greater(zero,growth_rate(efficient_producers,T)) | greater(growth_rate(efficient_producers,T),zero) & greater(zero,growth_rate(first_movers,T)))) # label(l7) # label(hypothesis) # label(non_clause). [assumption].
% 0.67/0.97 7 -(all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,equilibrium(E)) -> growth_rate(first_movers,T) = zero & growth_rate(efficient_producers,T) = zero | greater(growth_rate(first_movers,T),zero) & greater(zero,growth_rate(efficient_producers,T)) | greater(growth_rate(efficient_producers,T),zero) & greater(zero,growth_rate(first_movers,T)))) # label(prove_l6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.67/0.97
% 0.67/0.97 ============================== end of process non-clausal formulas ===
% 0.67/0.97
% 0.67/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.97
% 0.67/0.97 ============================== PREDICATE ELIMINATION =================
% 0.67/0.97 8 -environment(A) | -greater_or_equal(B,equilibrium(A)) | -greater(equilibrium(A),B) # label(mp_equilibrium) # label(axiom). [clausify(3)].
% 0.67/0.97 9 environment(c1) # label(prove_l6) # label(negated_conjecture). [clausify(7)].
% 0.67/0.97 Derived: -greater_or_equal(A,equilibrium(c1)) | -greater(equilibrium(c1),A). [resolve(8,a,9,a)].
% 0.67/0.97 10 -environment(A) | -in_environment(A,B) | -decreases(resources(A,B)) | -decreases(number_of_organizations(A,B)) # label(a6) # label(hypothesis). [clausify(5)].
% 0.67/0.97 Derived: -in_environment(c1,A) | -decreases(resources(c1,A)) | -decreases(number_of_organizations(c1,A)). [resolve(10,a,9,a)].
% 0.67/0.97 11 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occur) # label(axiom). [clausify(1)].
% 0.67/0.97 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | in_environment(c1,A). [resolve(11,a,9,a)].
% 0.67/0.97 12 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater(number_of_organizations(A,B),zero) # label(mp_positive_number_of_organizations) # label(axiom). [clausify(2)].
% 0.67/0.97 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | greater(number_of_organizations(c1,A),zero). [resolve(12,a,9,a)].
% 0.67/0.97 13 -environment(A) | -in_environment(A,B) | -constant(resources(A,B)) | constant(number_of_organizations(A,B)) # label(a6) # label(hypothesis). [clausify(5)].
% 0.67/0.97 Derived: -in_environment(c1,A) | -constant(resources(c1,A)) | constant(number_of_organizations(c1,A)). [resolve(13,a,9,a)].
% 0.67/0.97 14 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | -greater(equilibrium(A),B) | decreases(resources(A,B)) # label(a3) # label(hypothesis). [clausify(4)].
% 0.67/0.97 Derived: -in_environment(c1,A) | -greater(number_of_organizations(c1,A),zero) | -greater(equilibrium(c1),A) | decreases(resources(c1,A)). [resolve(14,a,9,a)].
% 0.67/0.97 15 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | greater(equilibrium(A),B) | constant(resources(A,B)) # label(a3) # label(hypothesis). [clausify(4)].
% 0.67/0.97 Derived: -in_environment(c1,A) | -greater(number_of_organizations(c1,A),zero) | greater(equilibrium(c1),A) | constant(resources(c1,A)). [resolve(15,a,9,a)].
% 0.67/0.97 16 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(growth_rate(efficient_producers,B),zero) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.97 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(first_movers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(growth_rate(efficient_producers,A),zero). [resolve(16,a,9,a)].
% 0.67/0.97 17 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(zero,growth_rate(first_movers,B)) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.97 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(first_movers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(zero,growth_rate(first_movers,A)). [resolve(17,a,9,a)].
% 0.67/0.97 18 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(growth_rate(efficient_producers,B),zero) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.97 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(first_movers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(growth_rate(efficient_producers,A),zero). [resolve(18,a,9,a)].
% 0.67/0.98 19 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(zero,growth_rate(first_movers,B)) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(first_movers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(zero,growth_rate(first_movers,A)). [resolve(19,a,9,a)].
% 0.67/0.98 20 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(growth_rate(efficient_producers,B),zero) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(efficient_producers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(growth_rate(efficient_producers,A),zero). [resolve(20,a,9,a)].
% 0.67/0.98 21 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(zero,growth_rate(first_movers,B)) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(efficient_producers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(zero,growth_rate(first_movers,A)). [resolve(21,a,9,a)].
% 0.67/0.98 22 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(growth_rate(efficient_producers,B),zero) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(efficient_producers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(growth_rate(efficient_producers,A),zero). [resolve(22,a,9,a)].
% 0.67/0.98 23 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(zero,growth_rate(first_movers,B)) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(efficient_producers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(zero,growth_rate(first_movers,A)). [resolve(23,a,9,a)].
% 0.67/0.98
% 0.67/0.98 ============================== end predicate elimination =============
% 0.67/0.98
% 0.67/0.98 Auto_denials: (non-Horn, no changes).
% 0.67/0.98
% 0.67/0.98 Term ordering decisions:
% 0.67/0.98
% 0.67/0.98 % Assigning unary symbol equilibrium kb_weight 0 and highest precedence (16).
% 0.67/0.98 Function symbol KB weights: zero=1. efficient_producers=1. first_movers=1. c1=1. c2=1. growth_rate=1. number_of_organizations=1. resources=1. equilibrium=0.
% 0.67/0.98
% 0.67/0.98 ============================== end of process initial clauses ========
% 0.67/0.98
% 0.67/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.67/0.98
% 0.67/0.98 ============================== end of clauses for search =============
% 0.67/0.98
% 0.67/0.98 ============================== SEARCH ================================
% 0.67/0.98
% 0.67/0.98 % Starting search at 0.01 seconds.
% 0.67/0.98
% 0.67/0.98 ============================== PROOF =================================
% 0.67/0.98 % SZS status Theorem
% 0.67/0.98 % SZS output start Refutation
% 0.67/0.98
% 0.67/0.98 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.67/0.98 % Length of proof is 75.
% 0.67/0.98 % Level of proof is 15.
% 0.67/0.98 % Maximum clause weight is 24.000.
% 0.67/0.98 % Given clauses 42.
% 0.67/0.98
% 0.67/0.98 1 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> in_environment(E,T))) # label(mp_time_point_occur) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.98 2 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> greater(number_of_organizations(E,T),zero))) # label(mp_positive_number_of_organizations) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.98 3 (all E all T (environment(E) & greater_or_equal(T,equilibrium(E)) -> -greater(equilibrium(E),T))) # label(mp_equilibrium) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.98 4 (all E all T (environment(E) & in_environment(E,T) & greater(number_of_organizations(E,T),zero) -> (greater(equilibrium(E),T) -> decreases(resources(E,T))) & (-greater(equilibrium(E),T) -> constant(resources(E,T))))) # label(a3) # label(hypothesis) # label(non_clause). [assumption].
% 0.67/0.98 5 (all E all T (environment(E) & in_environment(E,T) -> (decreases(resources(E,T)) -> -decreases(number_of_organizations(E,T))) & (constant(resources(E,T)) -> constant(number_of_organizations(E,T))))) # label(a6) # label(hypothesis) # label(non_clause). [assumption].
% 0.67/0.98 6 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) & constant(number_of_organizations(E,T)) -> growth_rate(first_movers,T) = zero & growth_rate(efficient_producers,T) = zero | greater(growth_rate(first_movers,T),zero) & greater(zero,growth_rate(efficient_producers,T)) | greater(growth_rate(efficient_producers,T),zero) & greater(zero,growth_rate(first_movers,T)))) # label(l7) # label(hypothesis) # label(non_clause). [assumption].
% 0.67/0.98 7 -(all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) & greater_or_equal(T,equilibrium(E)) -> growth_rate(first_movers,T) = zero & growth_rate(efficient_producers,T) = zero | greater(growth_rate(first_movers,T),zero) & greater(zero,growth_rate(efficient_producers,T)) | greater(growth_rate(efficient_producers,T),zero) & greater(zero,growth_rate(first_movers,T)))) # label(prove_l6) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.67/0.98 8 -environment(A) | -greater_or_equal(B,equilibrium(A)) | -greater(equilibrium(A),B) # label(mp_equilibrium) # label(axiom). [clausify(3)].
% 0.67/0.98 9 environment(c1) # label(prove_l6) # label(negated_conjecture). [clausify(7)].
% 0.67/0.98 11 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occur) # label(axiom). [clausify(1)].
% 0.67/0.98 12 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | greater(number_of_organizations(A,B),zero) # label(mp_positive_number_of_organizations) # label(axiom). [clausify(2)].
% 0.67/0.98 13 -environment(A) | -in_environment(A,B) | -constant(resources(A,B)) | constant(number_of_organizations(A,B)) # label(a6) # label(hypothesis). [clausify(5)].
% 0.67/0.98 15 -environment(A) | -in_environment(A,B) | -greater(number_of_organizations(A,B),zero) | greater(equilibrium(A),B) | constant(resources(A,B)) # label(a3) # label(hypothesis). [clausify(4)].
% 0.67/0.98 17 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(zero,growth_rate(first_movers,B)) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 18 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(growth_rate(efficient_producers,B),zero) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 19 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(first_movers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(zero,growth_rate(first_movers,B)) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 20 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(growth_rate(efficient_producers,B),zero) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 21 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(growth_rate(first_movers,B),zero) | greater(zero,growth_rate(first_movers,B)) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 22 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(growth_rate(efficient_producers,B),zero) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 23 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | -constant(number_of_organizations(A,B)) | growth_rate(efficient_producers,B) = zero | greater(zero,growth_rate(efficient_producers,B)) | greater(zero,growth_rate(first_movers,B)) # label(l7) # label(hypothesis). [clausify(6)].
% 0.67/0.98 24 greater_or_equal(c2,equilibrium(c1)) # label(prove_l6) # label(negated_conjecture). [clausify(7)].
% 0.67/0.98 25 subpopulations(first_movers,efficient_producers,c1,c2) # label(prove_l6) # label(negated_conjecture). [clausify(7)].
% 0.67/0.98 26 growth_rate(first_movers,c2) != zero | growth_rate(efficient_producers,c2) != zero # label(prove_l6) # label(negated_conjecture). [clausify(7)].
% 0.67/0.98 27 -greater(growth_rate(first_movers,c2),zero) | -greater(zero,growth_rate(efficient_producers,c2)) # label(prove_l6) # label(negated_conjecture). [clausify(7)].
% 0.67/0.98 28 -greater(growth_rate(efficient_producers,c2),zero) | -greater(zero,growth_rate(first_movers,c2)) # label(prove_l6) # label(negated_conjecture). [clausify(7)].
% 0.67/0.98 29 -greater_or_equal(A,equilibrium(c1)) | -greater(equilibrium(c1),A). [resolve(8,a,9,a)].
% 0.67/0.98 31 -subpopulations(first_movers,efficient_producers,c1,A) | in_environment(c1,A). [resolve(11,a,9,a)].
% 0.67/0.98 32 -subpopulations(first_movers,efficient_producers,c1,A) | greater(number_of_organizations(c1,A),zero). [resolve(12,a,9,a)].
% 0.67/0.98 33 -in_environment(c1,A) | -constant(resources(c1,A)) | constant(number_of_organizations(c1,A)). [resolve(13,a,9,a)].
% 0.67/0.98 35 -in_environment(c1,A) | -greater(number_of_organizations(c1,A),zero) | greater(equilibrium(c1),A) | constant(resources(c1,A)). [resolve(15,a,9,a)].
% 0.67/0.98 37 -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(first_movers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(zero,growth_rate(first_movers,A)). [resolve(17,a,9,a)].
% 0.67/0.98 38 -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(first_movers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(growth_rate(efficient_producers,A),zero). [resolve(18,a,9,a)].
% 0.67/0.98 39 -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(first_movers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(zero,growth_rate(first_movers,A)). [resolve(19,a,9,a)].
% 0.67/0.98 40 -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(efficient_producers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(growth_rate(efficient_producers,A),zero). [resolve(20,a,9,a)].
% 0.67/0.98 41 -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(efficient_producers,A) = zero | greater(growth_rate(first_movers,A),zero) | greater(zero,growth_rate(first_movers,A)). [resolve(21,a,9,a)].
% 0.67/0.98 42 -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(efficient_producers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(growth_rate(efficient_producers,A),zero). [resolve(22,a,9,a)].
% 0.67/0.98 43 -subpopulations(first_movers,efficient_producers,c1,A) | -constant(number_of_organizations(c1,A)) | growth_rate(efficient_producers,A) = zero | greater(zero,growth_rate(efficient_producers,A)) | greater(zero,growth_rate(first_movers,A)). [resolve(23,a,9,a)].
% 0.67/0.98 44 -greater(equilibrium(c1),c2). [resolve(29,a,24,a)].
% 0.67/0.98 45 in_environment(c1,c2). [resolve(31,a,25,a)].
% 0.67/0.98 46 greater(number_of_organizations(c1,c2),zero). [resolve(32,a,25,a)].
% 0.67/0.98 48 -constant(number_of_organizations(c1,c2)) | growth_rate(first_movers,c2) = zero | greater(growth_rate(first_movers,c2),zero) | greater(zero,growth_rate(first_movers,c2)). [resolve(37,a,25,a)].
% 0.67/0.98 49 -constant(number_of_organizations(c1,c2)) | growth_rate(first_movers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | greater(growth_rate(efficient_producers,c2),zero). [resolve(38,a,25,a)].
% 0.67/0.98 50 -constant(number_of_organizations(c1,c2)) | growth_rate(first_movers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | greater(zero,growth_rate(first_movers,c2)). [resolve(39,a,25,a)].
% 0.67/0.98 51 -constant(number_of_organizations(c1,c2)) | growth_rate(efficient_producers,c2) = zero | greater(growth_rate(first_movers,c2),zero) | greater(growth_rate(efficient_producers,c2),zero). [resolve(40,a,25,a)].
% 0.67/0.98 52 -constant(number_of_organizations(c1,c2)) | growth_rate(efficient_producers,c2) = zero | greater(growth_rate(first_movers,c2),zero) | greater(zero,growth_rate(first_movers,c2)). [resolve(41,a,25,a)].
% 0.67/0.98 53 -constant(number_of_organizations(c1,c2)) | growth_rate(efficient_producers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | greater(growth_rate(efficient_producers,c2),zero). [resolve(42,a,25,a)].
% 0.67/0.98 54 -constant(number_of_organizations(c1,c2)) | growth_rate(efficient_producers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | greater(zero,growth_rate(first_movers,c2)). [resolve(43,a,25,a)].
% 0.67/0.98 55 constant(resources(c1,c2)). [resolve(45,a,35,a),unit_del(a,46),unit_del(b,44)].
% 0.67/0.98 56 constant(number_of_organizations(c1,c2)). [resolve(45,a,33,a),unit_del(a,55)].
% 0.67/0.98 58 growth_rate(efficient_producers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | greater(zero,growth_rate(first_movers,c2)). [back_unit_del(54),unit_del(a,56)].
% 0.67/0.98 59 growth_rate(efficient_producers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | greater(growth_rate(efficient_producers,c2),zero). [back_unit_del(53),unit_del(a,56)].
% 0.67/0.98 60 growth_rate(efficient_producers,c2) = zero | greater(growth_rate(first_movers,c2),zero) | greater(zero,growth_rate(first_movers,c2)). [back_unit_del(52),unit_del(a,56)].
% 0.67/0.98 61 growth_rate(efficient_producers,c2) = zero | greater(growth_rate(first_movers,c2),zero) | greater(growth_rate(efficient_producers,c2),zero). [back_unit_del(51),unit_del(a,56)].
% 0.67/0.98 62 growth_rate(first_movers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | greater(zero,growth_rate(first_movers,c2)). [back_unit_del(50),unit_del(a,56)].
% 0.67/0.98 63 growth_rate(first_movers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | greater(growth_rate(efficient_producers,c2),zero). [back_unit_del(49),unit_del(a,56)].
% 0.67/0.98 64 growth_rate(first_movers,c2) = zero | greater(growth_rate(first_movers,c2),zero) | greater(zero,growth_rate(first_movers,c2)). [back_unit_del(48),unit_del(a,56)].
% 0.67/0.98 66 growth_rate(efficient_producers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | -greater(zero,growth_rate(first_movers,c2)). [resolve(59,c,28,a)].
% 0.67/0.98 67 growth_rate(efficient_producers,c2) = zero | greater(zero,growth_rate(first_movers,c2)) | -greater(zero,growth_rate(efficient_producers,c2)). [resolve(60,b,27,a)].
% 0.67/0.98 68 growth_rate(efficient_producers,c2) = zero | greater(growth_rate(efficient_producers,c2),zero) | -greater(zero,growth_rate(efficient_producers,c2)). [resolve(61,b,27,a)].
% 0.67/0.98 69 growth_rate(first_movers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)) | -greater(zero,growth_rate(first_movers,c2)). [resolve(63,c,28,a)].
% 0.67/0.98 70 growth_rate(first_movers,c2) = zero | greater(zero,growth_rate(first_movers,c2)) | -greater(zero,growth_rate(efficient_producers,c2)). [resolve(64,b,27,a)].
% 0.67/0.98 73 growth_rate(efficient_producers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)). [resolve(66,c,58,c),merge(c),merge(d)].
% 0.67/0.98 74 growth_rate(efficient_producers,c2) = zero | greater(zero,growth_rate(first_movers,c2)). [resolve(73,b,67,c),merge(b)].
% 0.67/0.98 75 growth_rate(efficient_producers,c2) = zero | greater(growth_rate(efficient_producers,c2),zero). [resolve(68,c,73,b),merge(c)].
% 0.67/0.98 76 growth_rate(efficient_producers,c2) = zero | -greater(zero,growth_rate(first_movers,c2)). [resolve(75,b,28,a)].
% 0.67/0.98 77 growth_rate(first_movers,c2) = zero | greater(zero,growth_rate(efficient_producers,c2)). [resolve(69,c,62,c),merge(c),merge(d)].
% 0.67/0.98 78 growth_rate(efficient_producers,c2) = zero. [resolve(76,b,74,b),merge(b)].
% 0.67/0.98 79 growth_rate(first_movers,c2) = zero | greater(zero,zero). [back_rewrite(77),rewrite([78(9)])].
% 0.67/0.98 80 growth_rate(first_movers,c2) = zero | greater(zero,growth_rate(first_movers,c2)) | -greater(zero,zero). [back_rewrite(70),rewrite([78(14)])].
% 0.67/0.98 81 -greater(zero,zero) | -greater(zero,growth_rate(first_movers,c2)). [back_rewrite(28),rewrite([78(3)])].
% 0.67/0.98 83 growth_rate(first_movers,c2) != zero. [back_rewrite(26),rewrite([78(8)]),xx(b)].
% 0.67/0.98 84 greater(zero,growth_rate(first_movers,c2)) | -greater(zero,zero). [back_unit_del(80),unit_del(a,83)].
% 0.67/0.98 85 greater(zero,zero). [back_unit_del(79),unit_del(a,83)].
% 0.67/0.98 87 greater(zero,growth_rate(first_movers,c2)). [back_unit_del(84),unit_del(b,85)].
% 0.67/0.98 89 $F. [back_unit_del(81),unit_del(a,85),unit_del(b,87)].
% 0.67/0.98
% 0.67/0.98 % SZS output end Refutation
% 0.67/0.98 ============================== end of proof ==========================
% 0.67/0.98
% 0.67/0.98 ============================== STATISTICS ============================
% 0.67/0.98
% 0.67/0.98 Given=42. Generated=71. Kept=65. proofs=1.
% 0.67/0.98 Usable=23. Sos=2. Demods=1. Limbo=4, Disabled=72. Hints=0.
% 0.67/0.98 Megabytes=0.12.
% 0.67/0.98 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.67/0.98
% 0.67/0.98 ============================== end of statistics =====================
% 0.67/0.98
% 0.67/0.98 ============================== end of search =========================
% 0.67/0.98
% 0.67/0.98 THEOREM PROVED
% 0.67/0.98 % SZS status Theorem
% 0.67/0.98
% 0.67/0.98 Exiting with 1 proof.
% 0.67/0.98
% 0.67/0.98 Process 5357 exit (max_proofs) Thu Jun 9 07:42:23 2022
% 0.67/0.98 Prover9 interrupted
%------------------------------------------------------------------------------