%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT023-1 : 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 : n011.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:45 AM UTC 2026 % Result : Unsatisfiable 0.14s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT023-1 : 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.09/0.36 % Computer : n011.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 12:06:30 UTC 2026 % 0.09/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N % 0.14/0.39 # and selection function SelectUnlessUniqMax. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 9 Number of unprocessed: 9 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 9 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 3 conjectures. % 0.14/0.39 # There are 3 start rule candidates: % 0.14/0.39 # Found 3 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 3 start rule tableaux created. % 0.14/0.39 # 6 extension rule candidate clauses % 0.14/0.39 # 3 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 3 % 0.14/0.39 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.14/0.39 # We now have 9 tableaux to operate on % 0.14/0.40 # Creating equality axioms % 0.14/0.40 # Ran out of tableaux, making start rules for all clauses % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 1 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 1 successful branch saturations after the branch. % 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_16, negated_conjecture, (environment(sk3))). % 0.14/0.40 cnf(i_0_17, negated_conjecture, (stable(sk3))). % 0.14/0.40 cnf(i_0_18, negated_conjecture, (~in_environment(sk3,critical_point(sk3)))). % 0.14/0.40 cnf(i_0_13, hypothesis, (in_environment(X1,sk2(X1))|~stable(X1)|~environment(X1))). % 0.14/0.40 cnf(i_0_14, hypothesis, (~stable(X1)|~greater(growth_rate(efficient_producers,sk2(X1)),growth_rate(first_movers,sk2(X1)))|~environment(X1))). % 0.14/0.40 cnf(i_0_11, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(sk1(X1,X2),X1)|~in_environment(X2,X1)|~environment(X2))). % 0.14/0.40 cnf(i_0_15, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~greater(X1,sk2(X2))|~environment(X2))). % 0.14/0.40 cnf(i_0_12, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~greater(growth_rate(efficient_producers,sk1(X1,X2)),growth_rate(first_movers,sk1(X1,X2)))|~environment(X2))). % 0.14/0.40 cnf(i_0_10, hypothesis, (X1=critical_point(X2)|subpopulations(first_movers,efficient_producers,X2,sk1(X1,X2))|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~environment(X2))). % 0.14/0.40 cnf(i_0_210, plain, (X3=X3)). % 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.40 # Begin printing tableau % 0.14/0.40 # Found 6 steps % 0.14/0.40 cnf(i_0_210, plain, (sk3=sk3), inference(start_rule)). % 0.14/0.40 cnf(i_0_252, plain, (sk3=sk3), inference(extension_rule, [i_0_214])). % 0.14/0.40 cnf(i_0_288, plain, (~environment(sk3)), inference(closure_rule, [i_0_16])). % 0.14/0.40 cnf(i_0_286, plain, (environment(sk3)), inference(extension_rule, [i_0_13])). % 0.14/0.40 cnf(i_0_290, plain, (~stable(sk3)), inference(closure_rule, [i_0_17])). % 0.14/0.40 cnf(i_0_289, plain, (in_environment(sk3,sk2(sk3))), inference(etableau_closure_rule, [i_0_289, ...])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will be marked with an "s" % 0.14/0.40 # Creating equality axioms % 0.14/0.40 # Ran out of tableaux, making start rules for all clauses % 0.14/0.40 # Creating equality axioms % 0.14/0.40 # Ran out of tableaux, making start rules for all clauses % 0.14/0.40 # There were 1 total branch saturation attempts. % 0.14/0.40 # There were 0 of these attempts blocked. % 0.14/0.40 # There were 0 deferred branch saturation attempts. % 0.14/0.40 # There were 0 free duplicated saturations. % 0.14/0.40 # There were 1 total successful branch saturations. % 0.14/0.40 # There were 0 successful branch saturations in interreduction. % 0.14/0.40 # There were 0 successful branch saturations on the branch. % 0.14/0.40 # There were 1 successful branch saturations after the branch. % 0.14/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.40 # Begin clausification derivation % 0.14/0.40 % 0.14/0.40 # End clausification derivation % 0.14/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.40 cnf(i_0_16, negated_conjecture, (environment(sk3))). % 0.14/0.40 cnf(i_0_17, negated_conjecture, (stable(sk3))). % 0.14/0.40 cnf(i_0_18, negated_conjecture, (~in_environment(sk3,critical_point(sk3)))). % 0.14/0.40 cnf(i_0_13, hypothesis, (in_environment(X1,sk2(X1))|~stable(X1)|~environment(X1))). % 0.14/0.40 cnf(i_0_14, hypothesis, (~stable(X1)|~greater(growth_rate(efficient_producers,sk2(X1)),growth_rate(first_movers,sk2(X1)))|~environment(X1))). % 0.14/0.40 cnf(i_0_11, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(sk1(X1,X2),X1)|~in_environment(X2,X1)|~environment(X2))). % 0.14/0.40 cnf(i_0_15, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~greater(X1,sk2(X2))|~environment(X2))). % 0.14/0.40 cnf(i_0_12, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~greater(growth_rate(efficient_producers,sk1(X1,X2)),growth_rate(first_movers,sk1(X1,X2)))|~environment(X2))). % 0.14/0.40 cnf(i_0_10, hypothesis, (X1=critical_point(X2)|subpopulations(first_movers,efficient_producers,X2,sk1(X1,X2))|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~environment(X2))). % 0.14/0.40 cnf(i_0_152, plain, (X3=X3)). % 0.14/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.40 # Begin printing tableau % 0.14/0.40 # Found 6 steps % 0.14/0.40 cnf(i_0_152, plain, (sk3=sk3), inference(start_rule)). % 0.14/0.40 cnf(i_0_194, plain, (sk3=sk3), inference(extension_rule, [i_0_156])). % 0.14/0.40 cnf(i_0_230, plain, (~environment(sk3)), inference(closure_rule, [i_0_16])). % 0.14/0.40 cnf(i_0_228, plain, (environment(sk3)), inference(extension_rule, [i_0_13])). % 0.14/0.40 cnf(i_0_232, plain, (~stable(sk3)), inference(closure_rule, [i_0_17])). % 0.14/0.40 cnf(i_0_231, plain, (in_environment(sk3,sk2(sk3))), inference(etableau_closure_rule, [i_0_231, ...])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will be marked with an "s" % 0.14/0.40 # Child (1629808) has found a proof. % 0.14/0.40 % 0.14/0.40 # Proof search is over... % 0.14/0.40 # Freeing feature tree %------------------------------------------------------------------------------