%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT036-3 : 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:48 AM UTC 2026 % Result : Unsatisfiable 0.13s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT036-3 : 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.10/0.34 % Computer : n018.cluster.edu % 0.10/0.34 % Model : x86_64 x86_64 % 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.34 % Memory : 8046.5625MB % 0.10/0.34 % OS : Linux 6.8.0-71-generic % 0.10/0.35 % CPULimit : 300 % 0.10/0.35 % WCLimit : 300 % 0.10/0.35 % DateTime : Mon Sep 7 12:44:22 UTC 2026 % 0.10/0.35 % 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: 9 Number of unprocessed: 9 % 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.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 9 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 1 conjectures. % 0.13/0.38 # There are 1 start rule candidates: % 0.13/0.38 # Found 4 unit axioms. % 0.13/0.38 # 1 start rule tableaux created. % 0.13/0.38 # 5 extension rule candidate clauses % 0.13/0.38 # 4 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.38 # Ran out of tableaux, making start rules for all clauses % 0.13/0.38 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 13 tableaux to operate on % 0.13/0.38 # There were 1 total branch saturation attempts. % 0.13/0.38 # There were 0 of these attempts blocked. % 0.13/0.38 # There were 0 deferred branch saturation attempts. % 0.13/0.38 # There were 0 free duplicated saturations. % 0.13/0.38 # There were 1 total successful branch saturations. % 0.13/0.38 # There were 0 successful branch saturations in interreduction. % 0.13/0.38 # There were 0 successful branch saturations on the branch. % 0.13/0.38 # There were 1 successful branch saturations after the branch. % 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.38 # Begin clausification derivation % 0.13/0.38 % 0.13/0.38 # End clausification derivation % 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.38 cnf(i_0_14, hypothesis, (environment(sk1))). % 0.13/0.38 cnf(i_0_15, hypothesis, (subpopulations(first_movers,efficient_producers,sk1,sk2))). % 0.13/0.38 cnf(i_0_17, hypothesis, (greater(zero,growth_rate(efficient_producers,sk2)))). % 0.13/0.38 cnf(i_0_16, hypothesis, (greater_or_equal(growth_rate(first_movers,sk2),zero))). % 0.13/0.38 cnf(i_0_18, negated_conjecture, (~outcompetes(first_movers,efficient_producers,X1)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.38 cnf(i_0_13, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.13/0.38 cnf(i_0_10, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))). % 0.13/0.38 cnf(i_0_12, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))). % 0.13/0.38 cnf(i_0_11, hypothesis, (outcompetes(X1,X2,X3)|~greater(zero,growth_rate(X2,X3))|~greater_or_equal(growth_rate(X1,X3),zero)|~subpopulations(X2,X1,X4,X3)|~environment(X4))). % 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.38 # Begin printing tableau % 0.13/0.38 # Found 8 steps % 0.13/0.38 cnf(i_0_14, hypothesis, (environment(sk1)), inference(start_rule)). % 0.13/0.38 cnf(i_0_60, plain, (environment(sk1)), inference(extension_rule, [i_0_18])). % 0.13/0.38 cnf(i_0_100, plain, (~subpopulations(first_movers,efficient_producers,sk1,sk2)), inference(closure_rule, [i_0_15])). % 0.13/0.38 cnf(i_0_99, plain, (~outcompetes(first_movers,efficient_producers,sk2)), inference(extension_rule, [i_0_11])). % 0.13/0.38 cnf(i_0_114, plain, (~greater(zero,growth_rate(efficient_producers,sk2))), inference(closure_rule, [i_0_17])). % 0.13/0.38 cnf(i_0_115, plain, (~greater_or_equal(growth_rate(first_movers,sk2),zero)), inference(closure_rule, [i_0_16])). % 0.13/0.38 cnf(i_0_117, plain, (~environment(sk1)), inference(closure_rule, [i_0_14])). % 0.13/0.38 cnf(i_0_116, plain, (~subpopulations(efficient_producers,first_movers,sk1,sk2)), inference(etableau_closure_rule, [i_0_116, ...])). % 0.13/0.38 # End printing tableau % 0.13/0.38 # SZS output end % 0.13/0.38 # Branches closed with saturation will be marked with an "s" % 0.13/0.38 # Child (1733910) has found a proof. % 0.13/0.38 % 0.13/0.38 # Proof search is over... % 0.13/0.38 # Freeing feature tree %------------------------------------------------------------------------------