TSTP Solution File: MGT028-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : MGT028-1 : 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 : n025.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:29 EDT 2022
% Result : Unsatisfiable 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : MGT028-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n025.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 11:04:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.13/0.37 # and selection function SelectNewComplexAHP.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 14 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 5 conjectures.
% 0.13/0.37 # There are 5 start rule candidates:
% 0.13/0.37 # Found 2 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 5 start rule tableaux created.
% 0.13/0.37 # 12 extension rule candidate clauses
% 0.13/0.37 # 2 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 5
% 0.13/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 12 tableaux to operate on
% 0.19/0.38 # There were 3 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 3 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 3 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_24, negated_conjecture, (environment(sk4))).
% 0.19/0.38 cnf(i_0_25, negated_conjecture, (stable(sk4))).
% 0.19/0.38 cnf(i_0_28, negated_conjecture, (~greater(zero,growth_rate(first_movers,sk5(X1)))|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_26, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk4,sk5(X1))|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_27, negated_conjecture, (greater_or_equal(sk5(X1),X1)|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_21, hypothesis, (in_environment(X1,sk3(X1))|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_23, hypothesis, (greater(zero,growth_rate(first_movers,X1))|~greater_or_equal(X1,sk3(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_22, hypothesis, (greater(growth_rate(efficient_producers,X1),zero)|~greater_or_equal(X1,sk3(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_19, plain, (greater(sk2(X1),appear(efficient_producers,X1))|~greater(zero,growth_rate(first_movers,sk1(X2,X1)))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_16, plain, (greater_or_equal(sk1(X1,X2),X1)|greater(sk2(X2),appear(efficient_producers,X2))|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_15, plain, (greater(sk2(X1),appear(efficient_producers,X1))|subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_18, plain, (greater_or_equal(sk1(X1,X2),X1)|greater(zero,growth_rate(first_movers,X3))|~greater_or_equal(X3,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X3)|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_20, plain, (greater(zero,growth_rate(first_movers,X1))|~greater_or_equal(X1,sk2(X2))|~greater(zero,growth_rate(first_movers,sk1(X3,X2)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_17, plain, (greater(zero,growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,sk1(X3,X2))|~greater_or_equal(X1,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 8 steps
% 0.19/0.38 cnf(i_0_28, negated_conjecture, (~greater(zero,growth_rate(first_movers,sk5(sk3(sk4))))|~greater(sk3(sk4),appear(efficient_producers,sk4))), inference(start_rule)).
% 0.19/0.38 cnf(i_0_33, plain, (~greater(zero,growth_rate(first_movers,sk5(sk3(sk4))))), inference(extension_rule, [i_0_23])).
% 0.19/0.38 cnf(i_0_153, plain, (~stable(sk4)), inference(closure_rule, [i_0_25])).
% 0.19/0.38 cnf(i_0_154, plain, (~environment(sk4)), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_151, plain, (~greater_or_equal(sk5(sk3(sk4)),sk3(sk4))), inference(extension_rule, [i_0_27])).
% 0.19/0.38 cnf(i_0_34, plain, (~greater(sk3(sk4),appear(efficient_producers,sk4))), inference(etableau_closure_rule, [i_0_34, ...])).
% 0.19/0.38 cnf(i_0_152, plain, (~subpopulations(first_movers,efficient_producers,sk4,sk5(sk3(sk4)))), inference(etableau_closure_rule, [i_0_152, ...])).
% 0.19/0.38 cnf(i_0_200, plain, (~greater(sk3(sk4),appear(efficient_producers,sk4))), inference(etableau_closure_rule, [i_0_200, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # There were 4 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 4 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 4 successful branch saturations after the branch.
% 0.19/0.38 # There were 4 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 4 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 4 successful branch saturations after the branch.
% 0.19/0.38 # There were 4 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 4 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 4 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_24, negated_conjecture, (environment(sk4))).
% 0.19/0.38 cnf(i_0_25, negated_conjecture, (stable(sk4))).
% 0.19/0.38 cnf(i_0_28, negated_conjecture, (~greater(zero,growth_rate(first_movers,sk5(X1)))|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_26, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk4,sk5(X1))|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_27, negated_conjecture, (greater_or_equal(sk5(X1),X1)|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_21, hypothesis, (in_environment(X1,sk3(X1))|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_23, hypothesis, (greater(zero,growth_rate(first_movers,X1))|~greater_or_equal(X1,sk3(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_22, hypothesis, (greater(growth_rate(efficient_producers,X1),zero)|~greater_or_equal(X1,sk3(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_19, plain, (greater(sk2(X1),appear(efficient_producers,X1))|~greater(zero,growth_rate(first_movers,sk1(X2,X1)))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_16, plain, (greater_or_equal(sk1(X1,X2),X1)|greater(sk2(X2),appear(efficient_producers,X2))|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_15, plain, (greater(sk2(X1),appear(efficient_producers,X1))|subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_18, plain, (greater_or_equal(sk1(X1,X2),X1)|greater(zero,growth_rate(first_movers,X3))|~greater_or_equal(X3,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X3)|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_20, plain, (greater(zero,growth_rate(first_movers,X1))|~greater_or_equal(X1,sk2(X2))|~greater(zero,growth_rate(first_movers,sk1(X3,X2)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_17, plain, (greater(zero,growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,sk1(X3,X2))|~greater_or_equal(X1,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 10 steps
% 0.19/0.38 cnf(i_0_24, negated_conjecture, (environment(sk4)), inference(start_rule)).
% 0.19/0.38 cnf(i_0_36, plain, (environment(sk4)), inference(extension_rule, [i_0_23])).
% 0.19/0.38 cnf(i_0_263, plain, (~stable(sk4)), inference(closure_rule, [i_0_25])).
% 0.19/0.38 cnf(i_0_261, plain, (~greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4))), inference(extension_rule, [i_0_16])).
% 0.19/0.38 cnf(i_0_541, plain, (~stable(sk4)), inference(closure_rule, [i_0_25])).
% 0.19/0.38 cnf(i_0_542, plain, (~environment(sk4)), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_262, plain, (~subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4))), inference(etableau_closure_rule, [i_0_262, ...])).
% 0.19/0.38 cnf(i_0_260, plain, (greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4)))), inference(etableau_closure_rule, [i_0_260, ...])).
% 0.19/0.38 cnf(i_0_539, plain, (greater(sk2(sk4),appear(efficient_producers,sk4))), inference(etableau_closure_rule, [i_0_539, ...])).
% 0.19/0.38 cnf(i_0_540, plain, (~in_environment(sk4,sk3(sk4))), inference(etableau_closure_rule, [i_0_540, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_24, negated_conjecture, (environment(sk4))).
% 0.19/0.38 cnf(i_0_25, negated_conjecture, (stable(sk4))).
% 0.19/0.38 cnf(i_0_28, negated_conjecture, (~greater(zero,growth_rate(first_movers,sk5(X1)))|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_26, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk4,sk5(X1))|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_27, negated_conjecture, (greater_or_equal(sk5(X1),X1)|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_21, hypothesis, (in_environment(X1,sk3(X1))|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_23, hypothesis, (greater(zero,growth_rate(first_movers,X1))|~greater_or_equal(X1,sk3(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_22, hypothesis, (greater(growth_rate(efficient_producers,X1),zero)|~greater_or_equal(X1,sk3(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_19, plain, (greater(sk2(X1),appear(efficient_producers,X1))|~greater(zero,growth_rate(first_movers,sk1(X2,X1)))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_16, plain, (greater_or_equal(sk1(X1,X2),X1)|greater(sk2(X2),appear(efficient_producers,X2))|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_15, plain, (greater(sk2(X1),appear(efficient_producers,X1))|subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_18, plain, (greater_or_equal(sk1(X1,X2),X1)|greater(zero,growth_rate(first_movers,X3))|~greater_or_equal(X3,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X3)|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_20, plain, (greater(zero,growth_rate(first_movers,X1))|~greater_or_equal(X1,sk2(X2))|~greater(zero,growth_rate(first_movers,sk1(X3,X2)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_17, plain, (greater(zero,growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,sk1(X3,X2))|~greater_or_equal(X1,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 10 steps
% 0.19/0.38 cnf(i_0_25, negated_conjecture, (stable(sk4)), inference(start_rule)).
% 0.19/0.38 cnf(i_0_35, plain, (stable(sk4)), inference(extension_rule, [i_0_23])).
% 0.19/0.38 cnf(i_0_264, plain, (~environment(sk4)), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_261, plain, (~greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4))), inference(extension_rule, [i_0_16])).
% 0.19/0.38 cnf(i_0_541, plain, (~stable(sk4)), inference(closure_rule, [i_0_25])).
% 0.19/0.38 cnf(i_0_542, plain, (~environment(sk4)), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_262, plain, (~subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4))), inference(etableau_closure_rule, [i_0_262, ...])).
% 0.19/0.38 cnf(i_0_260, plain, (greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4)))), inference(etableau_closure_rule, [i_0_260, ...])).
% 0.19/0.38 cnf(i_0_539, plain, (greater(sk2(sk4),appear(efficient_producers,sk4))), inference(etableau_closure_rule, [i_0_539, ...])).
% 0.19/0.38 cnf(i_0_540, plain, (~in_environment(sk4,sk3(sk4))), inference(etableau_closure_rule, [i_0_540, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_24, negated_conjecture, (environment(sk4))).
% 0.19/0.38 cnf(i_0_25, negated_conjecture, (stable(sk4))).
% 0.19/0.38 cnf(i_0_28, negated_conjecture, (~greater(zero,growth_rate(first_movers,sk5(X1)))|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_26, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk4,sk5(X1))|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_27, negated_conjecture, (greater_or_equal(sk5(X1),X1)|~greater(X1,appear(efficient_producers,sk4)))).
% 0.19/0.38 cnf(i_0_21, hypothesis, (in_environment(X1,sk3(X1))|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_23, hypothesis, (greater(zero,growth_rate(first_movers,X1))|~greater_or_equal(X1,sk3(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_22, hypothesis, (greater(growth_rate(efficient_producers,X1),zero)|~greater_or_equal(X1,sk3(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_19, plain, (greater(sk2(X1),appear(efficient_producers,X1))|~greater(zero,growth_rate(first_movers,sk1(X2,X1)))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_16, plain, (greater_or_equal(sk1(X1,X2),X1)|greater(sk2(X2),appear(efficient_producers,X2))|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_15, plain, (greater(sk2(X1),appear(efficient_producers,X1))|subpopulations(first_movers,efficient_producers,X1,sk1(X2,X1))|~in_environment(X1,X2)|~stable(X1)|~environment(X1))).
% 0.19/0.38 cnf(i_0_18, plain, (greater_or_equal(sk1(X1,X2),X1)|greater(zero,growth_rate(first_movers,X3))|~greater_or_equal(X3,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X3)|~in_environment(X2,X1)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_20, plain, (greater(zero,growth_rate(first_movers,X1))|~greater_or_equal(X1,sk2(X2))|~greater(zero,growth_rate(first_movers,sk1(X3,X2)))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))).
% 0.19/0.38 cnf(i_0_17, plain, (greater(zero,growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,sk1(X3,X2))|~greater_or_equal(X1,sk2(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~stable(X2)|~environment(X2))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 11 steps
% 0.19/0.38 cnf(i_0_27, negated_conjecture, (greater_or_equal(sk5(sk2(sk4)),sk2(sk4))|~greater(sk2(sk4),appear(efficient_producers,sk4))), inference(start_rule)).
% 0.19/0.38 cnf(i_0_30, plain, (~greater(sk2(sk4),appear(efficient_producers,sk4))), inference(extension_rule, [i_0_16])).
% 0.19/0.38 cnf(i_0_113, plain, (~stable(sk4)), inference(closure_rule, [i_0_25])).
% 0.19/0.38 cnf(i_0_114, plain, (~environment(sk4)), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_110, plain, (greater_or_equal(sk1(sk3(sk4),sk4),sk3(sk4))), inference(extension_rule, [i_0_23])).
% 0.19/0.38 cnf(i_0_153, plain, (~stable(sk4)), inference(closure_rule, [i_0_25])).
% 0.19/0.38 cnf(i_0_154, plain, (~environment(sk4)), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_29, plain, (greater_or_equal(sk5(sk2(sk4)),sk2(sk4))), inference(etableau_closure_rule, [i_0_29, ...])).
% 0.19/0.38 cnf(i_0_112, plain, (~in_environment(sk4,sk3(sk4))), inference(etableau_closure_rule, [i_0_112, ...])).
% 0.19/0.38 cnf(i_0_150, plain, (greater(zero,growth_rate(first_movers,sk1(sk3(sk4),sk4)))), inference(etableau_closure_rule, [i_0_150, ...])).
% 0.19/0.38 cnf(i_0_152, plain, (~subpopulations(first_movers,efficient_producers,sk4,sk1(sk3(sk4),sk4))), inference(etableau_closure_rule, [i_0_152, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.39 # Child (5877) has found a proof.
% 0.19/0.39
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------