TSTP Solution File: MGT036+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : MGT036+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:58 EDT 2022
% Result : Theorem 0.44s 1.03s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT036+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 10:00:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.03 ============================== Prover9 ===============================
% 0.44/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.44/1.03 Process 5305 was started by sandbox on n026.cluster.edu,
% 0.44/1.03 Thu Jun 9 10:00:03 2022
% 0.44/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4853_n026.cluster.edu".
% 0.44/1.03 ============================== end of head ===========================
% 0.44/1.03
% 0.44/1.03 ============================== INPUT =================================
% 0.44/1.03
% 0.44/1.03 % Reading from file /tmp/Prover9_4853_n026.cluster.edu
% 0.44/1.03
% 0.44/1.03 set(prolog_style_variables).
% 0.44/1.03 set(auto2).
% 0.44/1.03 % set(auto2) -> set(auto).
% 0.44/1.03 % set(auto) -> set(auto_inference).
% 0.44/1.03 % set(auto) -> set(auto_setup).
% 0.44/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.44/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/1.03 % set(auto) -> set(auto_limits).
% 0.44/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/1.03 % set(auto) -> set(auto_denials).
% 0.44/1.03 % set(auto) -> set(auto_process).
% 0.44/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.44/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.44/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.44/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.44/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.44/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.44/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.44/1.03 % set(auto2) -> assign(stats, some).
% 0.44/1.03 % set(auto2) -> clear(echo_input).
% 0.44/1.03 % set(auto2) -> set(quiet).
% 0.44/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.44/1.03 % set(auto2) -> clear(print_given).
% 0.44/1.03 assign(lrs_ticks,-1).
% 0.44/1.03 assign(sos_limit,10000).
% 0.44/1.03 assign(order,kbo).
% 0.44/1.03 set(lex_order_vars).
% 0.44/1.03 clear(print_given).
% 0.44/1.03
% 0.44/1.03 % formulas(sos). % not echoed (7 formulas)
% 0.44/1.03
% 0.44/1.03 ============================== end of input ==========================
% 0.44/1.03
% 0.44/1.03 % From the command line: assign(max_seconds, 300).
% 0.44/1.03
% 0.44/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/1.03
% 0.44/1.03 % Formulas that are not ordinary clauses:
% 0.44/1.03 1 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> subpopulations(efficient_producers,first_movers,E,T))) # label(mp_symmetry_of_FM_and_EP) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 2 (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.44/1.03 3 (all E all S1 all S2 all T ((environment(E) & subpopulations(S1,S2,E,T) -> greater_or_equal(growth_rate(S1,T),zero)) <-> -greater(zero,growth_rate(S1,T)))) # label(mp_growth_rate_relationships) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 4 (all E all S1 all S2 all T (environment(E) & subpopulations(S1,S2,E,T) -> (greater_or_equal(growth_rate(S2,T),zero) & greater(zero,growth_rate(S1,T)) <-> outcompetes(S2,S1,T)))) # label(d2) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/1.03 5 (all E all S1 all S2 all T (environment(E) & in_environment(E,T) & -greater(zero,growth_rate(S1,T)) & greater(resilience(S2),resilience(S1)) -> -greater(zero,growth_rate(S2,T)))) # label(a12) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/1.03 6 -(all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> -outcompetes(first_movers,efficient_producers,T))) # label(prove_t5) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.03
% 0.44/1.03 ============================== end of process non-clausal formulas ===
% 0.44/1.03
% 0.44/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/1.03
% 0.44/1.03 ============================== PREDICATE ELIMINATION =================
% 0.44/1.03 7 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occur) # label(axiom). [clausify(2)].
% 0.44/1.03 8 environment(c1) # label(prove_t5) # label(negated_conjecture). [clausify(6)].
% 0.44/1.03 9 environment(A) | -greater(zero,growth_rate(B,C)) # label(mp_growth_rate_relationships) # label(axiom). [clausify(3)].
% 0.44/1.03 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | in_environment(c1,A). [resolve(7,a,8,a)].
% 0.44/1.03 Derived: -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) | -greater(zero,growth_rate(C,D)). [resolve(7,a,9,a)].
% 0.44/1.03 10 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | subpopulations(efficient_producers,first_movers,A,B) # label(mp_symmetry_of_FM_and_EP) # label(axiom). [clausify(1)].
% 0.44/1.03 Derived: -subpopulations(first_movers,efficient_producers,c1,A) | subpopulations(efficient_producers,first_movers,c1,A). [resolve(10,a,8,a)].
% 0.44/1.03 Derived: -subpopulations(first_movers,efficient_producers,A,B) | subpopulations(efficient_producers,first_movers,A,B) | -greater(zero,growth_rate(C,D)). [resolve(10,a,9,a)].
% 0.44/1.03 11 -environment(A) | -subpopulations(B,C,A,D) | greater_or_equal(growth_rate(C,D),zero) | -outcompetes(C,B,D) # label(d2) # label(hypothesis). [clausify(4)].
% 0.44/1.03 Derived: -subpopulations(A,B,c1,C) | greater_or_equal(growth_rate(B,C),zero) | -outcompetes(B,A,C). [resolve(11,a,8,a)].
% 0.44/1.03 Derived: -subpopulations(A,B,C,D) | greater_or_equal(growth_rate(B,D),zero) | -outcompetes(B,A,D) | -greater(zero,growth_rate(E,F)). [resolve(11,a,9,a)].
% 0.44/1.03 12 -environment(A) | -subpopulations(B,C,A,D) | greater(zero,growth_rate(B,D)) | -outcompetes(C,B,D) # label(d2) # label(hypothesis). [clausify(4)].
% 0.44/1.03 Derived: -subpopulations(A,B,c1,C) | greater(zero,growth_rate(A,C)) | -outcompetes(B,A,C). [resolve(12,a,8,a)].
% 0.44/1.03 Derived: -subpopulations(A,B,C,D) | greater(zero,growth_rate(A,D)) | -outcompetes(B,A,D) | -greater(zero,growth_rate(E,F)). [resolve(12,a,9,a)].
% 0.44/1.03 13 -environment(A) | -subpopulations(B,C,A,D) | greater_or_equal(growth_rate(B,D),zero) | greater(zero,growth_rate(B,D)) # label(mp_growth_rate_relationships) # label(axiom). [clausify(3)].
% 0.44/1.03 Derived: -subpopulations(A,B,c1,C) | greater_or_equal(growth_rate(A,C),zero) | greater(zero,growth_rate(A,C)). [resolve(13,a,8,a)].
% 0.44/1.03 Derived: -subpopulations(A,B,C,D) | greater_or_equal(growth_rate(A,D),zero) | greater(zero,growth_rate(A,D)) | -greater(zero,growth_rate(E,F)). [resolve(13,a,9,a)].
% 0.44/1.03 14 -environment(A) | -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) # label(a12) # label(hypothesis). [clausify(5)].
% 0.44/1.03 Derived: -in_environment(c1,A) | greater(zero,growth_rate(B,A)) | -greater(resilience(C),resilience(B)) | -greater(zero,growth_rate(C,A)). [resolve(14,a,8,a)].
% 0.44/1.03 Derived: -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) | -greater(zero,growth_rate(E,F)). [resolve(14,a,9,a)].
% 0.44/1.03 15 -environment(A) | -subpopulations(B,C,A,D) | -greater_or_equal(growth_rate(C,D),zero) | -greater(zero,growth_rate(B,D)) | outcompetes(C,B,D) # label(d2) # label(hypothesis). [clausify(4)].
% 0.44/1.03 Derived: -subpopulations(A,B,c1,C) | -greater_or_equal(growth_rate(B,C),zero) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C). [resolve(15,a,8,a)].
% 0.44/1.03 Derived: -subpopulations(A,B,C,D) | -greater_or_equal(growth_rate(B,D),zero) | -greater(zero,growth_rate(A,D)) | outcompetes(B,A,D) | -greater(zero,growth_rate(E,F)). [resolve(15,a,9,a)].
% 0.44/1.03 16 -subpopulations(A,B,c1,C) | greater_or_equal(growth_rate(B,C),zero) | -outcompetes(B,A,C). [resolve(11,a,8,a)].
% 0.44/1.03 17 outcompetes(first_movers,efficient_producers,c2) # label(prove_t5) # label(negated_conjecture). [clausify(6)].
% 0.44/1.03 Derived: -subpopulations(efficient_producers,first_movers,c1,c2) | greater_or_equal(growth_rate(first_movers,c2),zero). [resolve(16,c,17,a)].
% 0.44/1.03 18 -subpopulations(A,B,C,D) | greater_or_equal(growth_rate(B,D),zero) | -outcompetes(B,A,D) | -greater(zero,growth_rate(E,F)). [resolve(11,a,9,a)].
% 0.44/1.03 Derived: -subpopulations(efficient_producers,first_movers,A,c2) | greater_or_equal(growth_rate(first_movers,c2),zero) | -greater(zero,growth_rate(B,C)). [resolve(18,c,17,a)].
% 0.44/1.03 19 -subpopulations(A,B,c1,C) | greater(zero,growth_rate(A,C)) | -outcompetes(B,A,C). [resolve(12,a,8,a)].
% 0.44/1.03 Derived: -subpopulations(efficient_producers,first_movers,c1,c2) | greater(zero,growth_rate(efficient_
% 0.44/1.03 WARNING: denials share constants (see output).
% 0.44/1.03
% 0.44/1.03 producers,c2)). [resolve(19,c,17,a)].
% 0.44/1.03 20 -subpopulations(A,B,C,D) | greater(zero,growth_rate(A,D)) | -outcompetes(B,A,D) | -greater(zero,growth_rate(E,F)). [resolve(12,a,9,a)].
% 0.44/1.03 Derived: -subpopulations(efficient_producers,first_movers,A,c2) | greater(zero,growth_rate(efficient_producers,c2)) | -greater(zero,growth_rate(B,C)). [resolve(20,c,17,a)].
% 0.44/1.03 21 -subpopulations(A,B,c1,C) | -greater_or_equal(growth_rate(B,C),zero) | -greater(zero,growth_rate(A,C)) | outcompetes(B,A,C). [resolve(15,a,8,a)].
% 0.44/1.03 22 -subpopulations(A,B,C,D) | -greater_or_equal(growth_rate(B,D),zero) | -greater(zero,growth_rate(A,D)) | outcompetes(B,A,D) | -greater(zero,growth_rate(E,F)). [resolve(15,a,9,a)].
% 0.44/1.03 23 -subpopulations(A,B,c1,C) | greater_or_equal(growth_rate(A,C),zero) | greater(zero,growth_rate(A,C)). [resolve(13,a,8,a)].
% 0.44/1.03 24 -greater_or_equal(growth_rate(A,B),zero) | -greater(zero,growth_rate(A,B)) # label(mp_growth_rate_relationships) # label(axiom). [clausify(3)].
% 0.44/1.03 25 -subpopulations(A,B,C,D) | greater_or_equal(growth_rate(A,D),zero) | greater(zero,growth_rate(A,D)) | -greater(zero,growth_rate(E,F)). [resolve(13,a,9,a)].
% 0.44/1.03 26 -subpopulations(efficient_producers,first_movers,c1,c2) | greater_or_equal(growth_rate(first_movers,c2),zero). [resolve(16,c,17,a)].
% 0.44/1.03 Derived: -subpopulations(efficient_producers,first_movers,c1,c2) | -greater(zero,growth_rate(first_movers,c2)). [resolve(26,b,24,a)].
% 0.44/1.03 27 -subpopulations(efficient_producers,first_movers,A,c2) | greater_or_equal(growth_rate(first_movers,c2),zero) | -greater(zero,growth_rate(B,C)). [resolve(18,c,17,a)].
% 0.44/1.03 Derived: -subpopulations(efficient_producers,first_movers,A,c2) | -greater(zero,growth_rate(B,C)) | -greater(zero,growth_rate(first_movers,c2)). [resolve(27,b,24,a)].
% 0.44/1.03 28 -in_environment(c1,A) | greater(zero,growth_rate(B,A)) | -greater(resilience(C),resilience(B)) | -greater(zero,growth_rate(C,A)). [resolve(14,a,8,a)].
% 0.44/1.03 29 -subpopulations(first_movers,efficient_producers,c1,A) | in_environment(c1,A). [resolve(7,a,8,a)].
% 0.44/1.03 30 -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) | -greater(zero,growth_rate(C,D)). [resolve(7,a,9,a)].
% 0.44/1.03 Derived: greater(zero,growth_rate(A,B)) | -greater(resilience(C),resilience(A)) | -greater(zero,growth_rate(C,B)) | -subpopulations(first_movers,efficient_producers,c1,B). [resolve(28,a,29,b)].
% 0.44/1.03 31 -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) | -greater(zero,growth_rate(E,F)). [resolve(14,a,9,a)].
% 0.44/1.03 Derived: greater(zero,growth_rate(A,B)) | -greater(resilience(C),resilience(A)) | -greater(zero,growth_rate(C,B)) | -greater(zero,growth_rate(D,E)) | -subpopulations(first_movers,efficient_producers,F,B) | -greater(zero,growth_rate(V6,V7)). [resolve(31,a,30,b)].
% 0.44/1.03
% 0.44/1.03 ============================== end predicate elimination =============
% 0.44/1.03
% 0.44/1.03 Auto_denials:
% 0.44/1.03 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.44/1.03
% 0.44/1.03 WARNING, because some of the denials share constants,
% 0.44/1.03 some of the denials or their descendents may be subsumed,
% 0.44/1.03 preventing the target number of proofs from being found.
% 0.44/1.03 The shared constants are: efficient_producers, c2, first_movers, zero.
% 0.44/1.03
% 0.44/1.03 Term ordering decisions:
% 0.44/1.03
% 0.44/1.03 % Assigning unary symbol resilience kb_weight 0 and highest precedence (9).
% 0.44/1.03 Function symbol KB weights: efficient_producers=1. zero=1. first_movers=1. c1=1. c2=1. growth_rate=1. resilience=0.
% 0.44/1.03
% 0.44/1.03 ============================== end of process initial clauses ========
% 0.44/1.03
% 0.44/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.44/1.03
% 0.44/1.03 ============================== end of clauses for search =============
% 0.44/1.03
% 0.44/1.03 ============================== SEARCH ================================
% 0.44/1.03
% 0.44/1.03 % Starting search at 0.01 seconds.
% 0.44/1.03
% 0.44/1.03 ============================== PROOF =================================
% 0.44/1.03 % SZS status Theorem
% 0.44/1.03 % SZS output start Refutation
% 0.44/1.03
% 0.44/1.03 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.44/1.03 % Length of proof is 30.
% 0.44/1.03 % Level of proof is 6.
% 0.44/1.03 % Maximum clause weight is 30.000.
% 0.44/1.03 % Given clauses 10.
% 0.44/1.03
% 0.44/1.03 1 (all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> subpopulations(efficient_producers,first_movers,E,T))) # label(mp_symmetry_of_FM_and_EP) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 2 (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.44/1.03 3 (all E all S1 all S2 all T ((environment(E) & subpopulations(S1,S2,E,T) -> greater_or_equal(growth_rate(S1,T),zero)) <-> -greater(zero,growth_rate(S1,T)))) # label(mp_growth_rate_relationships) # label(axiom) # label(non_clause). [assumption].
% 0.44/1.03 4 (all E all S1 all S2 all T (environment(E) & subpopulations(S1,S2,E,T) -> (greater_or_equal(growth_rate(S2,T),zero) & greater(zero,growth_rate(S1,T)) <-> outcompetes(S2,S1,T)))) # label(d2) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/1.03 5 (all E all S1 all S2 all T (environment(E) & in_environment(E,T) & -greater(zero,growth_rate(S1,T)) & greater(resilience(S2),resilience(S1)) -> -greater(zero,growth_rate(S2,T)))) # label(a12) # label(hypothesis) # label(non_clause). [assumption].
% 0.44/1.03 6 -(all E all T (environment(E) & subpopulations(first_movers,efficient_producers,E,T) -> -outcompetes(first_movers,efficient_producers,T))) # label(prove_t5) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.44/1.03 7 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) # label(mp_time_point_occur) # label(axiom). [clausify(2)].
% 0.44/1.03 8 environment(c1) # label(prove_t5) # label(negated_conjecture). [clausify(6)].
% 0.44/1.03 9 environment(A) | -greater(zero,growth_rate(B,C)) # label(mp_growth_rate_relationships) # label(axiom). [clausify(3)].
% 0.44/1.03 10 -environment(A) | -subpopulations(first_movers,efficient_producers,A,B) | subpopulations(efficient_producers,first_movers,A,B) # label(mp_symmetry_of_FM_and_EP) # label(axiom). [clausify(1)].
% 0.44/1.03 11 -environment(A) | -subpopulations(B,C,A,D) | greater_or_equal(growth_rate(C,D),zero) | -outcompetes(C,B,D) # label(d2) # label(hypothesis). [clausify(4)].
% 0.44/1.03 12 -environment(A) | -subpopulations(B,C,A,D) | greater(zero,growth_rate(B,D)) | -outcompetes(C,B,D) # label(d2) # label(hypothesis). [clausify(4)].
% 0.44/1.03 14 -environment(A) | -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) # label(a12) # label(hypothesis). [clausify(5)].
% 0.44/1.03 16 -subpopulations(A,B,c1,C) | greater_or_equal(growth_rate(B,C),zero) | -outcompetes(B,A,C). [resolve(11,a,8,a)].
% 0.44/1.03 17 outcompetes(first_movers,efficient_producers,c2) # label(prove_t5) # label(negated_conjecture). [clausify(6)].
% 0.44/1.03 19 -subpopulations(A,B,c1,C) | greater(zero,growth_rate(A,C)) | -outcompetes(B,A,C). [resolve(12,a,8,a)].
% 0.44/1.03 24 -greater_or_equal(growth_rate(A,B),zero) | -greater(zero,growth_rate(A,B)) # label(mp_growth_rate_relationships) # label(axiom). [clausify(3)].
% 0.44/1.03 26 -subpopulations(efficient_producers,first_movers,c1,c2) | greater_or_equal(growth_rate(first_movers,c2),zero). [resolve(16,c,17,a)].
% 0.44/1.03 30 -subpopulations(first_movers,efficient_producers,A,B) | in_environment(A,B) | -greater(zero,growth_rate(C,D)). [resolve(7,a,9,a)].
% 0.44/1.03 31 -in_environment(A,B) | greater(zero,growth_rate(C,B)) | -greater(resilience(D),resilience(C)) | -greater(zero,growth_rate(D,B)) | -greater(zero,growth_rate(E,F)). [resolve(14,a,9,a)].
% 0.44/1.03 32 greater(resilience(efficient_producers),resilience(first_movers)) # label(a2) # label(hypothesis). [assumption].
% 0.44/1.03 33 subpopulations(first_movers,efficient_producers,c1,c2) # label(prove_t5) # label(negated_conjecture). [clausify(6)].
% 0.44/1.03 35 -subpopulations(first_movers,efficient_producers,c1,A) | subpopulations(efficient_producers,first_movers,c1,A). [resolve(10,a,8,a)].
% 0.44/1.03 37 -subpopulations(efficient_producers,first_movers,c1,c2) | greater(zero,growth_rate(efficient_producers,c2)). [resolve(19,c,17,a)].
% 0.44/1.03 39 -subpopulations(efficient_producers,first_movers,c1,c2) | -greater(zero,growth_rate(first_movers,c2)). [resolve(26,b,24,a)].
% 0.44/1.03 42 greater(zero,growth_rate(A,B)) | -greater(resilience(C),resilience(A)) | -greater(zero,growth_rate(C,B)) | -greater(zero,growth_rate(D,E)) | -subpopulations(first_movers,efficient_producers,F,B) | -greater(zero,growth_rate(V6,V7)). [resolve(31,a,30,b)].
% 0.44/1.03 43 subpopulations(efficient_producers,first_movers,c1,c2). [hyper(35,a,33,a)].
% 0.44/1.03 44 -greater(zero,growth_rate(first_movers,c2)). [back_unit_del(39),unit_del(a,43)].
% 0.44/1.03 45 greater(zero,growth_rate(efficient_producers,c2)). [back_unit_del(37),unit_del(a,43)].
% 0.44/1.03 46 $F. [hyper(42,b,32,a,c,45,a,d,45,a,e,33,a,f,45,a),unit_del(a,44)].
% 0.44/1.03
% 0.44/1.03 % SZS output end Refutation
% 0.44/1.03 ============================== end of proof ==========================
% 0.44/1.03 % Redundant proof: 47 $F. [hyper(42,b,32,a,c,45,a,d,45,a,e,33,a,f,45,a),unit_del(a,44)].
% 0.44/1.03 % Redundant proof: 48 $F. [hyper(42,b,32,a,c,45,a,d,45,a,e,33,a,f,45,a),unit_del(a,44)].
% 0.44/1.03 % Redundant proof: 49 $F. [hyper(41,b,32,a,c,45,a,d,33,a),unit_del(a,44)].
% 0.44/1.03
% 0.44/1.03 % Disable descendants (x means already disabled):
% 0.44/1.03 0x 24x 39x 40x 44
% 0.44/1.03
% 0.44/1.03 ============================== STATISTICS ============================
% 0.44/1.03
% 0.44/1.03 Given=11. Generated=20. Kept=15. proofs=1.
% 0.44/1.03 Usable=9. Sos=0. Demods=0. Limbo=0, Disabled=42. Hints=0.
% 0.44/1.03 Megabytes=0.07.
% 0.44/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.44/1.03
% 0.44/1.03 ============================== end of statistics =====================
% 0.44/1.03
% 0.44/1.03 ============================== end of search =========================
% 0.44/1.03
% 0.44/1.03 SEARCH FAILED
% 0.44/1.03
% 0.44/1.03 Exiting with 1 proof.
% 0.44/1.03
% 0.44/1.03 Process 5305 exit (sos_empty) Thu Jun 9 10:00:03 2022
% 0.44/1.03 Prover9 interrupted
%------------------------------------------------------------------------------