%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT036+2 : TPTP v9.3.0. Released v2.0.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 : n026.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:09:48 AM UTC 2026 % Result : Theorem 0.02s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT036+2 : TPTP v9.3.0. Released v2.0.0. % 0.00/0.04 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.08/0.36 % Computer : n026.cluster.edu % 0.08/0.36 % Model : x86_64 x86_64 % 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.36 % Memory : 8046.5625MB % 0.08/0.36 % OS : Linux 6.8.0-71-generic % 0.02/0.36 % CPULimit : 300 % 0.02/0.36 % WCLimit : 300 % 0.02/0.36 % DateTime : Mon Sep 7 12:43:12 UTC 2026 % 0.02/0.36 % CPUTime : % 0.02/0.39 # No SInE strategy applied % 0.02/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.02/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.02/0.39 # % 0.02/0.39 # Presaturation interreduction done % 0.02/0.39 # Number of axioms: 14 Number of unprocessed: 14 % 0.02/0.39 # Tableaux proof search. % 0.02/0.39 # APR header successfully linked. % 0.02/0.39 # Hello from C++ % 0.02/0.39 # The folding up rule is enabled... % 0.02/0.39 # Local unification is enabled... % 0.02/0.39 # Any saturation attempts will use folding labels... % 0.02/0.39 # 14 beginning clauses after preprocessing and clausification % 0.02/0.39 # Creating start rules for all 3 conjectures. % 0.02/0.39 # There are 3 start rule candidates: % 0.02/0.39 # Found 4 unit axioms. % 0.02/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.02/0.39 # 3 start rule tableaux created. % 0.02/0.39 # 10 extension rule candidate clauses % 0.02/0.39 # 4 unit axiom clauses % 0.02/0.39 % 0.02/0.39 # Requested 8, 32 cores available to the main process. % 0.02/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.02/0.39 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.02/0.39 # We now have 12 tableaux to operate on % 0.02/0.40 # There were 2 total branch saturation attempts. % 0.02/0.40 # There were 0 of these attempts blocked. % 0.02/0.40 # There were 0 deferred branch saturation attempts. % 0.02/0.40 # There were 0 free duplicated saturations. % 0.02/0.40 # There were 2 total successful branch saturations. % 0.02/0.40 # There were 0 successful branch saturations in interreduction. % 0.02/0.40 # There were 0 successful branch saturations on the branch. % 0.02/0.40 # There were 2 successful branch saturations after the branch. % 0.02/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # Begin clausification derivation % 0.02/0.40 % 0.02/0.40 # End clausification derivation % 0.02/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.02/0.40 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.02/0.40 cnf(i_0_12, negated_conjecture, (outcompetes(first_movers,efficient_producers,esk2_0))). % 0.02/0.40 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.02/0.40 cnf(i_0_10, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))). % 0.02/0.40 cnf(i_0_6, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))). % 0.02/0.40 cnf(i_0_4, plain, (~greater(zero,growth_rate(X1,X2))|~greater_or_equal(growth_rate(X1,X2),zero))). % 0.02/0.40 cnf(i_0_2, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.02/0.40 cnf(i_0_5, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))). % 0.02/0.40 cnf(i_0_1, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))). % 0.02/0.40 cnf(i_0_7, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_8, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_3, plain, (greater(zero,growth_rate(X1,X2))|greater_or_equal(growth_rate(X1,X2),zero)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_9, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero))). % 0.02/0.40 cnf(i_0_11, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))). % 0.02/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.02/0.40 # Begin printing tableau % 0.02/0.40 # Found 6 steps % 0.02/0.40 cnf(i_0_14, negated_conjecture, (environment(esk1_0)), inference(start_rule)). % 0.02/0.40 cnf(i_0_17, plain, (environment(esk1_0)), inference(extension_rule, [i_0_7])). % 0.02/0.40 cnf(i_0_93, plain, (~outcompetes(first_movers,efficient_producers,esk2_0)), inference(closure_rule, [i_0_12])). % 0.02/0.40 cnf(i_0_92, plain, (greater(zero,growth_rate(efficient_producers,esk2_0))), inference(extension_rule, [i_0_6])). % 0.02/0.40 cnf(i_0_94, plain, (~subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_94, ...])). % 0.02/0.40 cnf(i_0_111, plain, (environment(X4)), inference(etableau_closure_rule, [i_0_111, ...])). % 0.02/0.40 # End printing tableau % 0.02/0.40 # SZS output end % 0.02/0.40 # Branches closed with saturation will be marked with an "s" % 0.02/0.40 # There were 2 total branch saturation attempts. % 0.02/0.40 # There were 0 of these attempts blocked. % 0.02/0.40 # There were 0 deferred branch saturation attempts. % 0.02/0.40 # There were 0 free duplicated saturations. % 0.02/0.40 # There were 2 total successful branch saturations. % 0.02/0.40 # There were 0 successful branch saturations in interreduction. % 0.02/0.40 # There were 0 successful branch saturations on the branch. % 0.02/0.40 # There were 2 successful branch saturations after the branch. % 0.02/0.40 # There were 2 total branch saturation attempts. % 0.02/0.40 # There were 0 of these attempts blocked. % 0.02/0.40 # There were 0 deferred branch saturation attempts. % 0.02/0.40 # There were 0 free duplicated saturations. % 0.02/0.40 # There were 2 total successful branch saturations. % 0.02/0.40 # There were 0 successful branch saturations in interreduction. % 0.02/0.40 # There were 0 successful branch saturations on the branch. % 0.02/0.40 # There were 2 successful branch saturations after the branch. % 0.02/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # Begin clausification derivation % 0.02/0.40 % 0.02/0.40 # End clausification derivation % 0.02/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.02/0.40 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.02/0.40 cnf(i_0_12, negated_conjecture, (outcompetes(first_movers,efficient_producers,esk2_0))). % 0.02/0.40 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.02/0.40 cnf(i_0_10, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))). % 0.02/0.40 cnf(i_0_6, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))). % 0.02/0.40 cnf(i_0_4, plain, (~greater(zero,growth_rate(X1,X2))|~greater_or_equal(growth_rate(X1,X2),zero))). % 0.02/0.40 cnf(i_0_2, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.02/0.40 cnf(i_0_5, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))). % 0.02/0.40 cnf(i_0_1, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))). % 0.02/0.40 cnf(i_0_7, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_8, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_3, plain, (greater(zero,growth_rate(X1,X2))|greater_or_equal(growth_rate(X1,X2),zero)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_9, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero))). % 0.02/0.40 cnf(i_0_11, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))). % 0.02/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.02/0.40 # Begin printing tableau % 0.02/0.40 # Found 6 steps % 0.02/0.40 cnf(i_0_14, negated_conjecture, (environment(esk1_0)), inference(start_rule)). % 0.02/0.40 cnf(i_0_17, plain, (environment(esk1_0)), inference(extension_rule, [i_0_3])). % 0.02/0.40 cnf(i_0_102, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_13])). % 0.02/0.40 cnf(i_0_100, plain, (greater(zero,growth_rate(first_movers,esk2_0))), inference(extension_rule, [i_0_6])). % 0.02/0.40 cnf(i_0_101, plain, (greater_or_equal(growth_rate(first_movers,esk2_0),zero)), inference(etableau_closure_rule, [i_0_101, ...])). % 0.02/0.40 cnf(i_0_111, plain, (environment(X4)), inference(etableau_closure_rule, [i_0_111, ...])). % 0.02/0.40 # End printing tableau % 0.02/0.40 # SZS output end % 0.02/0.40 # Branches closed with saturation will be marked with an "s" % 0.02/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # Begin clausification derivation % 0.02/0.40 % 0.02/0.40 # End clausification derivation % 0.02/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.02/0.40 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.02/0.40 cnf(i_0_12, negated_conjecture, (outcompetes(first_movers,efficient_producers,esk2_0))). % 0.02/0.40 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.02/0.40 cnf(i_0_10, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))). % 0.02/0.40 cnf(i_0_6, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))). % 0.02/0.40 cnf(i_0_4, plain, (~greater(zero,growth_rate(X1,X2))|~greater_or_equal(growth_rate(X1,X2),zero))). % 0.02/0.40 cnf(i_0_2, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.02/0.40 cnf(i_0_5, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))). % 0.02/0.40 cnf(i_0_1, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))). % 0.02/0.40 cnf(i_0_7, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_8, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_3, plain, (greater(zero,growth_rate(X1,X2))|greater_or_equal(growth_rate(X1,X2),zero)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_9, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero))). % 0.02/0.40 cnf(i_0_11, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))). % 0.02/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.02/0.40 # Begin printing tableau % 0.02/0.40 # Found 6 steps % 0.02/0.40 cnf(i_0_14, negated_conjecture, (environment(esk1_0)), inference(start_rule)). % 0.02/0.40 cnf(i_0_17, plain, (environment(esk1_0)), inference(extension_rule, [i_0_8])). % 0.02/0.40 cnf(i_0_97, plain, (~outcompetes(first_movers,efficient_producers,esk2_0)), inference(closure_rule, [i_0_12])). % 0.02/0.40 cnf(i_0_96, plain, (greater_or_equal(growth_rate(first_movers,esk2_0),zero)), inference(extension_rule, [i_0_4])). % 0.02/0.40 cnf(i_0_98, plain, (~subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_98, ...])). % 0.02/0.40 cnf(i_0_113, plain, (~greater(zero,growth_rate(first_movers,esk2_0))), inference(etableau_closure_rule, [i_0_113, ...])). % 0.02/0.40 # End printing tableau % 0.02/0.40 # SZS output end % 0.02/0.40 # Branches closed with saturation will be marked with an "s" % 0.02/0.40 # There were 2 total branch saturation attempts. % 0.02/0.40 # There were 0 of these attempts blocked. % 0.02/0.40 # There were 0 deferred branch saturation attempts. % 0.02/0.40 # There were 0 free duplicated saturations. % 0.02/0.40 # There were 2 total successful branch saturations. % 0.02/0.40 # There were 0 successful branch saturations in interreduction. % 0.02/0.40 # There were 0 successful branch saturations on the branch. % 0.02/0.40 # There were 2 successful branch saturations after the branch. % 0.02/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # Begin clausification derivation % 0.02/0.40 % 0.02/0.40 # End clausification derivation % 0.02/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.02/0.40 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.02/0.40 cnf(i_0_12, negated_conjecture, (outcompetes(first_movers,efficient_producers,esk2_0))). % 0.02/0.40 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.02/0.40 cnf(i_0_10, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))). % 0.02/0.40 cnf(i_0_6, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))). % 0.02/0.40 cnf(i_0_4, plain, (~greater(zero,growth_rate(X1,X2))|~greater_or_equal(growth_rate(X1,X2),zero))). % 0.02/0.40 cnf(i_0_2, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.02/0.40 cnf(i_0_5, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))). % 0.02/0.40 cnf(i_0_1, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))). % 0.02/0.40 cnf(i_0_7, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_8, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_3, plain, (greater(zero,growth_rate(X1,X2))|greater_or_equal(growth_rate(X1,X2),zero)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_9, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero))). % 0.02/0.40 cnf(i_0_11, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))). % 0.02/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.02/0.40 # Begin printing tableau % 0.02/0.40 # Found 7 steps % 0.02/0.40 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(start_rule)). % 0.02/0.40 cnf(i_0_15, plain, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(extension_rule, [i_0_2])). % 0.02/0.40 cnf(i_0_24, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_14])). % 0.02/0.40 cnf(i_0_22, plain, (in_environment(esk1_0,esk2_0)), inference(extension_rule, [i_0_11])). % 0.02/0.40 cnf(i_0_171, plain, (~greater(resilience(efficient_producers),resilience(first_movers))), inference(closure_rule, [i_0_10])). % 0.02/0.40 cnf(i_0_169, plain, (greater(zero,growth_rate(first_movers,esk2_0))), inference(etableau_closure_rule, [i_0_169, ...])). % 0.02/0.40 cnf(i_0_170, plain, (~greater(zero,growth_rate(efficient_producers,esk2_0))), inference(etableau_closure_rule, [i_0_170, ...])). % 0.02/0.40 # End printing tableau % 0.02/0.40 # SZS output end % 0.02/0.40 # Branches closed with saturation will be marked with an "s" % 0.02/0.40 # There were 2 total branch saturation attempts. % 0.02/0.40 # There were 0 of these attempts blocked. % 0.02/0.40 # There were 0 deferred branch saturation attempts. % 0.02/0.40 # There were 0 free duplicated saturations. % 0.02/0.40 # There were 2 total successful branch saturations. % 0.02/0.40 # There were 0 successful branch saturations in interreduction. % 0.02/0.40 # There were 0 successful branch saturations on the branch. % 0.02/0.40 # There were 2 successful branch saturations after the branch. % 0.02/0.40 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.02/0.40 # Begin clausification derivation % 0.02/0.40 % 0.02/0.40 # End clausification derivation % 0.02/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.02/0.40 cnf(i_0_14, negated_conjecture, (environment(esk1_0))). % 0.02/0.40 cnf(i_0_12, negated_conjecture, (outcompetes(first_movers,efficient_producers,esk2_0))). % 0.02/0.40 cnf(i_0_13, negated_conjecture, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.02/0.40 cnf(i_0_10, hypothesis, (greater(resilience(efficient_producers),resilience(first_movers)))). % 0.02/0.40 cnf(i_0_6, plain, (environment(X1)|~greater(zero,growth_rate(X2,X3)))). % 0.02/0.40 cnf(i_0_4, plain, (~greater(zero,growth_rate(X1,X2))|~greater_or_equal(growth_rate(X1,X2),zero))). % 0.02/0.40 cnf(i_0_2, plain, (in_environment(X1,X2)|~subpopulations(first_movers,efficient_producers,X1,X2)|~environment(X1))). % 0.02/0.40 cnf(i_0_5, plain, (subpopulations(X1,X2,X3,X4)|~greater(zero,growth_rate(X1,X4)))). % 0.02/0.40 cnf(i_0_1, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))). % 0.02/0.40 cnf(i_0_7, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_8, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_3, plain, (greater(zero,growth_rate(X1,X2))|greater_or_equal(growth_rate(X1,X2),zero)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.02/0.40 cnf(i_0_9, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero))). % 0.02/0.40 cnf(i_0_11, hypothesis, (greater(zero,growth_rate(X1,X2))|~greater(zero,growth_rate(X3,X2))|~greater(resilience(X3),resilience(X1))|~in_environment(X4,X2))). % 0.02/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.02/0.40 # Begin printing tableau % 0.02/0.40 # Found 7 steps % 0.02/0.40 cnf(i_0_14, negated_conjecture, (environment(esk1_0)), inference(start_rule)). % 0.02/0.40 cnf(i_0_17, plain, (environment(esk1_0)), inference(extension_rule, [i_0_2])). % 0.02/0.40 cnf(i_0_85, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_13])). % 0.02/0.40 cnf(i_0_84, plain, (in_environment(esk1_0,esk2_0)), inference(extension_rule, [i_0_11])). % 0.02/0.40 cnf(i_0_140, plain, (~greater(resilience(efficient_producers),resilience(first_movers))), inference(closure_rule, [i_0_10])). % 0.02/0.40 cnf(i_0_138, plain, (greater(zero,growth_rate(first_movers,esk2_0))), inference(etableau_closure_rule, [i_0_138, ...])). % 0.02/0.40 cnf(i_0_139, plain, (~greater(zero,growth_rate(efficient_producers,esk2_0))), inference(etableau_closure_rule, [i_0_139, ...])). % 0.02/0.40 # End printing tableau % 0.02/0.40 # SZS output end % 0.02/0.40 # Branches closed with saturation will be marked with an "s" % 0.02/0.40 # Child (2542157) has found a proof. % 0.02/0.40 % 0.02/0.40 # Proof search is over... % 0.02/0.40 # Freeing feature tree %------------------------------------------------------------------------------