%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT032-2 : TPTP v9.3.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 : n018.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:47 AM UTC 2026 % Result : Unsatisfiable 0.13s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT032-2 : TPTP v9.3.0. Released v2.4.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.35 % Computer : n018.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 12:24:37 UTC 2026 % 0.08/0.36 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 8 Number of unprocessed: 8 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 8 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 5 conjectures. % 0.13/0.39 # There are 5 start rule candidates: % 0.13/0.39 # Found 2 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 5 start rule tableaux created. % 0.13/0.39 # 6 extension rule candidate clauses % 0.13/0.39 # 2 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There are not enough tableaux to fork, creating more from the initial 5 % 0.13/0.39 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 10 tableaux to operate on % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 1 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 1 successful branch saturations after the branch. % 0.13/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_12, negated_conjecture, (environment(sk2))). % 0.13/0.39 cnf(i_0_13, negated_conjecture, (stable(sk2))). % 0.13/0.39 cnf(i_0_16, negated_conjecture, (~in_environment(sk2,X1)|~selection_favors(efficient_producers,first_movers,sk3(X1)))). % 0.13/0.39 cnf(i_0_14, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk2,sk3(X1))|~in_environment(sk2,X1))). % 0.13/0.39 cnf(i_0_15, negated_conjecture, (greater_or_equal(sk3(X1),X1)|~in_environment(sk2,X1))). % 0.13/0.39 cnf(i_0_10, hypothesis, (in_environment(X1,sk1(X1))|~stable(X1)|~environment(X1))). % 0.13/0.39 cnf(i_0_11, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater_or_equal(X1,sk1(X2))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.39 cnf(i_0_9, plain, (selection_favors(X1,X2,X3)|~greater(growth_rate(X1,X3),growth_rate(X2,X3))|~subpopulations(X2,X1,X4,X3)|~environment(X4))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 5 steps % 0.13/0.39 cnf(i_0_12, negated_conjecture, (environment(sk2)), inference(start_rule)). % 0.13/0.39 cnf(i_0_24, plain, (environment(sk2)), inference(extension_rule, [i_0_10])). % 0.13/0.39 cnf(i_0_152, plain, (~stable(sk2)), inference(closure_rule, [i_0_13])). % 0.13/0.39 cnf(i_0_151, plain, (in_environment(sk2,sk1(sk2))), inference(extension_rule, [i_0_15])). % 0.13/0.39 cnf(i_0_163, plain, (greater_or_equal(sk3(sk1(sk2)),sk1(sk2))), inference(etableau_closure_rule, [i_0_163, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # There were 1 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 1 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 1 successful branch saturations after the branch. % 0.13/0.39 # Child (1722840) has found a proof. % 0.13/0.39 % 0.13/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_12, negated_conjecture, (environment(sk2))). % 0.13/0.39 cnf(i_0_13, negated_conjecture, (stable(sk2))). % 0.13/0.39 cnf(i_0_16, negated_conjecture, (~in_environment(sk2,X1)|~selection_favors(efficient_producers,first_movers,sk3(X1)))). % 0.13/0.39 cnf(i_0_14, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk2,sk3(X1))|~in_environment(sk2,X1))). % 0.13/0.39 cnf(i_0_15, negated_conjecture, (greater_or_equal(sk3(X1),X1)|~in_environment(sk2,X1))). % 0.13/0.39 cnf(i_0_10, hypothesis, (in_environment(X1,sk1(X1))|~stable(X1)|~environment(X1))). % 0.13/0.39 cnf(i_0_11, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater_or_equal(X1,sk1(X2))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.39 cnf(i_0_9, plain, (selection_favors(X1,X2,X3)|~greater(growth_rate(X1,X3),growth_rate(X2,X3))|~subpopulations(X2,X1,X4,X3)|~environment(X4))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 5 steps % 0.13/0.39 cnf(i_0_13, negated_conjecture, (stable(sk2)), inference(start_rule)). % 0.13/0.39 cnf(i_0_23, plain, (stable(sk2)), inference(extension_rule, [i_0_10])). % 0.13/0.39 cnf(i_0_135, plain, (~environment(sk2)), inference(closure_rule, [i_0_12])). % 0.13/0.39 cnf(i_0_133, plain, (in_environment(sk2,sk1(sk2))), inference(extension_rule, [i_0_15])). % 0.13/0.39 cnf(i_0_163, plain, (greater_or_equal(sk3(sk1(sk2)),sk1(sk2))), inference(etableau_closure_rule, [i_0_163, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------