TSTP Solution File: MGT036-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT036-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%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:10:33 EDT 2022
% Result : Unsatisfiable 0.18s 0.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT036-2 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n029.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 08:42:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36 # Number of axioms: 14 Number of unprocessed: 14
% 0.18/0.36 # Tableaux proof search.
% 0.18/0.36 # APR header successfully linked.
% 0.18/0.36 # Hello from C++
% 0.18/0.36 # The folding up rule is enabled...
% 0.18/0.36 # Local unification is enabled...
% 0.18/0.36 # Any saturation attempts will use folding labels...
% 0.18/0.36 # 14 beginning clauses after preprocessing and clausification
% 0.18/0.36 # Creating start rules for all 3 conjectures.
% 0.18/0.36 # There are 3 start rule candidates:
% 0.18/0.36 # Found 4 unit axioms.
% 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.36 # 3 start rule tableaux created.
% 0.18/0.36 # 10 extension rule candidate clauses
% 0.18/0.36 # 4 unit axiom clauses
% 0.18/0.36
% 0.18/0.36 # Requested 8, 32 cores available to the main process.
% 0.18/0.36 # There are not enough tableaux to fork, creating more from the initial 3
% 0.18/0.36 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.36 # We now have 12 tableaux to operate on
% 0.18/0.36 # There were 2 total branch saturation attempts.
% 0.18/0.36 # There were 0 of these attempts blocked.
% 0.18/0.36 # There were 0 deferred branch saturation attempts.
% 0.18/0.36 # There were 0 free duplicated saturations.
% 0.18/0.36 # There were 2 total successful branch saturations.
% 0.18/0.36 # There were 0 successful branch saturations in interreduction.
% 0.18/0.36 # There were 0 successful branch saturations on the branch.
% 0.18/0.36 # There were 2 successful branch saturations after the branch.
% 0.18/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # Begin clausification derivation
% 0.18/0.36
% 0.18/0.36 # End clausification derivation
% 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36 cnf(i_0_26, negated_conjecture, (environment(sk1))).
% 0.18/0.36 cnf(i_0_28, negated_conjecture, (outcompetes(first_movers,efficient_producers,sk2))).
% 0.18/0.36 cnf(i_0_27, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2))).
% 0.18/0.36 cnf(i_0_24, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))).
% 0.18/0.36 cnf(i_0_17, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_19, plain, (~greater_or_equal(growth_rate(X1,X2),zero)|~greater(zero,growth_rate(X1,X2)))).
% 0.18/0.36 cnf(i_0_16, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.18/0.36 cnf(i_0_18, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))).
% 0.18/0.36 cnf(i_0_15, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))).
% 0.18/0.36 cnf(i_0_23, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_22, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_20, plain, (greater_or_equal(growth_rate(X1,X2),zero)|greater(zero,growth_rate(X1,X2))|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_21, hypothesis, (outcompetes(X1,X2,X3)|~greater_or_equal(growth_rate(X1,X3),zero)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_25, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))).
% 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.36 # Begin printing tableau
% 0.18/0.36 # Found 6 steps
% 0.18/0.36 cnf(i_0_26, negated_conjecture, (environment(sk1)), inference(start_rule)).
% 0.18/0.36 cnf(i_0_31, plain, (environment(sk1)), inference(extension_rule, [i_0_23])).
% 0.18/0.36 cnf(i_0_107, plain, (~outcompetes(first_movers,efficient_producers,sk2)), inference(closure_rule, [i_0_28])).
% 0.18/0.36 cnf(i_0_106, plain, (greater(zero,growth_rate(efficient_producers,sk2))), inference(extension_rule, [i_0_17])).
% 0.18/0.36 cnf(i_0_108, plain, (~subpopulations(efficient_producers,first_movers,sk1,sk2)), inference(etableau_closure_rule, [i_0_108, ...])).
% 0.18/0.36 cnf(i_0_125, plain, (environment(X4)), inference(etableau_closure_rule, [i_0_125, ...])).
% 0.18/0.36 # End printing tableau
% 0.18/0.36 # SZS output end
% 0.18/0.36 # Branches closed with saturation will be marked with an "s"
% 0.18/0.36 # There were 2 total branch saturation attempts.
% 0.18/0.36 # There were 0 of these attempts blocked.
% 0.18/0.36 # There were 0 deferred branch saturation attempts.
% 0.18/0.36 # There were 0 free duplicated saturations.
% 0.18/0.36 # There were 2 total successful branch saturations.
% 0.18/0.36 # There were 0 successful branch saturations in interreduction.
% 0.18/0.36 # There were 0 successful branch saturations on the branch.
% 0.18/0.36 # There were 2 successful branch saturations after the branch.
% 0.18/0.36 # There were 2 total branch saturation attempts.
% 0.18/0.36 # There were 0 of these attempts blocked.
% 0.18/0.36 # There were 0 deferred branch saturation attempts.
% 0.18/0.36 # There were 0 free duplicated saturations.
% 0.18/0.36 # There were 2 total successful branch saturations.
% 0.18/0.36 # There were 0 successful branch saturations in interreduction.
% 0.18/0.36 # There were 0 successful branch saturations on the branch.
% 0.18/0.36 # There were 2 successful branch saturations after the branch.
% 0.18/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # Begin clausification derivation
% 0.18/0.36
% 0.18/0.36 # End clausification derivation
% 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36 cnf(i_0_26, negated_conjecture, (environment(sk1))).
% 0.18/0.36 cnf(i_0_28, negated_conjecture, (outcompetes(first_movers,efficient_producers,sk2))).
% 0.18/0.36 cnf(i_0_27, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2))).
% 0.18/0.36 cnf(i_0_24, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))).
% 0.18/0.36 cnf(i_0_17, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_19, plain, (~greater_or_equal(growth_rate(X1,X2),zero)|~greater(zero,growth_rate(X1,X2)))).
% 0.18/0.36 cnf(i_0_16, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.18/0.36 cnf(i_0_18, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))).
% 0.18/0.36 cnf(i_0_15, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))).
% 0.18/0.36 cnf(i_0_23, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_22, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_20, plain, (greater_or_equal(growth_rate(X1,X2),zero)|greater(zero,growth_rate(X1,X2))|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_21, hypothesis, (outcompetes(X1,X2,X3)|~greater_or_equal(growth_rate(X1,X3),zero)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_25, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))).
% 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.36 # Begin printing tableau
% 0.18/0.36 # Found 6 steps
% 0.18/0.36 cnf(i_0_26, negated_conjecture, (environment(sk1)), inference(start_rule)).
% 0.18/0.36 cnf(i_0_31, plain, (environment(sk1)), inference(extension_rule, [i_0_22])).
% 0.18/0.36 cnf(i_0_111, plain, (~outcompetes(first_movers,efficient_producers,sk2)), inference(closure_rule, [i_0_28])).
% 0.18/0.36 cnf(i_0_110, plain, (greater_or_equal(growth_rate(first_movers,sk2),zero)), inference(extension_rule, [i_0_19])).
% 0.18/0.36 cnf(i_0_112, plain, (~subpopulations(efficient_producers,first_movers,sk1,sk2)), inference(etableau_closure_rule, [i_0_112, ...])).
% 0.18/0.36 cnf(i_0_128, plain, (~greater(zero,growth_rate(first_movers,sk2))), inference(etableau_closure_rule, [i_0_128, ...])).
% 0.18/0.36 # End printing tableau
% 0.18/0.36 # SZS output end
% 0.18/0.36 # Branches closed with saturation will be marked with an "s"
% 0.18/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # Begin clausification derivation
% 0.18/0.36
% 0.18/0.36 # End clausification derivation
% 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36 cnf(i_0_26, negated_conjecture, (environment(sk1))).
% 0.18/0.36 cnf(i_0_28, negated_conjecture, (outcompetes(first_movers,efficient_producers,sk2))).
% 0.18/0.36 cnf(i_0_27, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2))).
% 0.18/0.36 cnf(i_0_24, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))).
% 0.18/0.36 cnf(i_0_17, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_19, plain, (~greater_or_equal(growth_rate(X1,X2),zero)|~greater(zero,growth_rate(X1,X2)))).
% 0.18/0.36 cnf(i_0_16, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.18/0.36 cnf(i_0_18, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))).
% 0.18/0.36 cnf(i_0_15, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))).
% 0.18/0.36 cnf(i_0_23, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_22, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_20, plain, (greater_or_equal(growth_rate(X1,X2),zero)|greater(zero,growth_rate(X1,X2))|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_21, hypothesis, (outcompetes(X1,X2,X3)|~greater_or_equal(growth_rate(X1,X3),zero)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_25, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))).
% 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.36 # Begin printing tableau
% 0.18/0.36 # Found 7 steps
% 0.18/0.36 cnf(i_0_27, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(start_rule)).
% 0.18/0.36 cnf(i_0_29, plain, (subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(extension_rule, [i_0_16])).
% 0.18/0.36 cnf(i_0_38, plain, (~environment(sk1)), inference(closure_rule, [i_0_26])).
% 0.18/0.36 cnf(i_0_36, plain, (in_environment(sk1,sk2)), inference(extension_rule, [i_0_25])).
% 0.18/0.36 cnf(i_0_185, plain, (~greater(resilience(efficient_producers),resilience(first_movers))), inference(closure_rule, [i_0_24])).
% 0.18/0.36 cnf(i_0_183, plain, (greater(zero,growth_rate(first_movers,sk2))), inference(etableau_closure_rule, [i_0_183, ...])).
% 0.18/0.36 cnf(i_0_184, plain, (~greater(zero,growth_rate(efficient_producers,sk2))), inference(etableau_closure_rule, [i_0_184, ...])).
% 0.18/0.36 # End printing tableau
% 0.18/0.36 # SZS output end
% 0.18/0.36 # Branches closed with saturation will be marked with an "s"
% 0.18/0.36 # There were 2 total branch saturation attempts.
% 0.18/0.36 # There were 0 of these attempts blocked.
% 0.18/0.36 # There were 0 deferred branch saturation attempts.
% 0.18/0.36 # There were 0 free duplicated saturations.
% 0.18/0.36 # There were 2 total successful branch saturations.
% 0.18/0.36 # There were 0 successful branch saturations in interreduction.
% 0.18/0.36 # There were 0 successful branch saturations on the branch.
% 0.18/0.36 # There were 2 successful branch saturations after the branch.
% 0.18/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # Begin clausification derivation
% 0.18/0.36
% 0.18/0.36 # End clausification derivation
% 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36 cnf(i_0_26, negated_conjecture, (environment(sk1))).
% 0.18/0.36 cnf(i_0_28, negated_conjecture, (outcompetes(first_movers,efficient_producers,sk2))).
% 0.18/0.36 cnf(i_0_27, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2))).
% 0.18/0.36 cnf(i_0_24, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))).
% 0.18/0.36 cnf(i_0_17, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_19, plain, (~greater_or_equal(growth_rate(X1,X2),zero)|~greater(zero,growth_rate(X1,X2)))).
% 0.18/0.36 cnf(i_0_16, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.18/0.36 cnf(i_0_18, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))).
% 0.18/0.36 cnf(i_0_15, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))).
% 0.18/0.36 cnf(i_0_23, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_22, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_20, plain, (greater_or_equal(growth_rate(X1,X2),zero)|greater(zero,growth_rate(X1,X2))|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_21, hypothesis, (outcompetes(X1,X2,X3)|~greater_or_equal(growth_rate(X1,X3),zero)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_25, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))).
% 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.36 # Begin printing tableau
% 0.18/0.36 # Found 7 steps
% 0.18/0.36 cnf(i_0_26, negated_conjecture, (environment(sk1)), inference(start_rule)).
% 0.18/0.36 cnf(i_0_31, plain, (environment(sk1)), inference(extension_rule, [i_0_16])).
% 0.18/0.36 cnf(i_0_99, plain, (~subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(closure_rule, [i_0_27])).
% 0.18/0.36 cnf(i_0_98, plain, (in_environment(sk1,sk2)), inference(extension_rule, [i_0_25])).
% 0.18/0.36 cnf(i_0_154, plain, (~greater(resilience(efficient_producers),resilience(first_movers))), inference(closure_rule, [i_0_24])).
% 0.18/0.36 cnf(i_0_152, plain, (greater(zero,growth_rate(first_movers,sk2))), inference(etableau_closure_rule, [i_0_152, ...])).
% 0.18/0.36 cnf(i_0_153, plain, (~greater(zero,growth_rate(efficient_producers,sk2))), inference(etableau_closure_rule, [i_0_153, ...])).
% 0.18/0.36 # End printing tableau
% 0.18/0.36 # SZS output end
% 0.18/0.36 # Branches closed with saturation will be marked with an "s"
% 0.18/0.36 # There were 2 total branch saturation attempts.
% 0.18/0.36 # There were 0 of these attempts blocked.
% 0.18/0.36 # There were 0 deferred branch saturation attempts.
% 0.18/0.36 # There were 0 free duplicated saturations.
% 0.18/0.36 # There were 2 total successful branch saturations.
% 0.18/0.36 # There were 0 successful branch saturations in interreduction.
% 0.18/0.36 # There were 0 successful branch saturations on the branch.
% 0.18/0.36 # There were 2 successful branch saturations after the branch.
% 0.18/0.36 # Child (14508) has found a proof.
% 0.18/0.36
% 0.18/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.36 # Begin clausification derivation
% 0.18/0.36
% 0.18/0.36 # End clausification derivation
% 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.36 cnf(i_0_26, negated_conjecture, (environment(sk1))).
% 0.18/0.36 cnf(i_0_28, negated_conjecture, (outcompetes(first_movers,efficient_producers,sk2))).
% 0.18/0.36 cnf(i_0_27, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk1,sk2))).
% 0.18/0.36 cnf(i_0_24, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))).
% 0.18/0.36 cnf(i_0_17, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_19, plain, (~greater_or_equal(growth_rate(X1,X2),zero)|~greater(zero,growth_rate(X1,X2)))).
% 0.18/0.36 cnf(i_0_16, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))).
% 0.18/0.36 cnf(i_0_18, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))).
% 0.18/0.36 cnf(i_0_15, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))).
% 0.18/0.36 cnf(i_0_23, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_22, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_20, plain, (greater_or_equal(growth_rate(X1,X2),zero)|greater(zero,growth_rate(X1,X2))|~subpopulations(X1,X3,X4,X2)|~environment(X4))).
% 0.18/0.36 cnf(i_0_21, hypothesis, (outcompetes(X1,X2,X3)|~greater_or_equal(growth_rate(X1,X3),zero)|~greater(zero,growth_rate(X2,X3)))).
% 0.18/0.36 cnf(i_0_25, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))).
% 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.36 # Begin printing tableau
% 0.18/0.36 # Found 6 steps
% 0.18/0.36 cnf(i_0_28, negated_conjecture, (outcompetes(first_movers,efficient_producers,sk2)), inference(start_rule)).
% 0.18/0.36 cnf(i_0_30, plain, (outcompetes(first_movers,efficient_producers,sk2)), inference(extension_rule, [i_0_23])).
% 0.18/0.36 cnf(i_0_78, plain, (~environment(sk1)), inference(closure_rule, [i_0_26])).
% 0.18/0.36 cnf(i_0_75, plain, (greater(zero,growth_rate(efficient_producers,sk2))), inference(extension_rule, [i_0_17])).
% 0.18/0.36 cnf(i_0_77, plain, (~subpopulations(efficient_producers,first_movers,sk1,sk2)), inference(etableau_closure_rule, [i_0_77, ...])).
% 0.18/0.36 cnf(i_0_125, plain, (environment(X4)), inference(etableau_closure_rule, [i_0_125, ...])).
% 0.18/0.36 # End printing tableau
% 0.18/0.36 # SZS output end
% 0.18/0.36 # Branches closed with saturation will be marked with an "s"
% 0.18/0.36 # Proof search is over...
% 0.18/0.36 # Freeing feature tree
%------------------------------------------------------------------------------