%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT036+3 : 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 : n009.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.10s 0.40s % 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.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.10/0.36 % Computer : n009.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.37 % DateTime : Mon Sep 7 12:41:52 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.40 # No SInE strategy applied % 0.10/0.40 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.10/0.40 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.40 # % 0.10/0.40 # Presaturation interreduction done % 0.10/0.40 # Number of axioms: 9 Number of unprocessed: 9 % 0.10/0.40 # Tableaux proof search. % 0.10/0.40 # APR header successfully linked. % 0.10/0.40 # Hello from C++ % 0.10/0.40 # The folding up rule is enabled... % 0.10/0.40 # Local unification is enabled... % 0.10/0.40 # Any saturation attempts will use folding labels... % 0.10/0.40 # 9 beginning clauses after preprocessing and clausification % 0.10/0.40 # Creating start rules for all 1 conjectures. % 0.10/0.40 # There are 1 start rule candidates: % 0.10/0.40 # Found 4 unit axioms. % 0.10/0.40 # 1 start rule tableaux created. % 0.10/0.40 # 5 extension rule candidate clauses % 0.10/0.40 # 4 unit axiom clauses % 0.10/0.40 % 0.10/0.40 # Requested 8, 32 cores available to the main process. % 0.10/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.10/0.40 # Ran out of tableaux, making start rules for all clauses % 0.10/0.40 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux. % 0.10/0.40 # We now have 13 tableaux to operate on % 0.10/0.40 # There were 1 total branch saturation attempts. % 0.10/0.40 # There were 0 of these attempts blocked. % 0.10/0.40 # There were 0 deferred branch saturation attempts. % 0.10/0.40 # There were 0 free duplicated saturations. % 0.10/0.40 # There were 1 total successful branch saturations. % 0.10/0.40 # There were 0 successful branch saturations in interreduction. % 0.10/0.40 # There were 0 successful branch saturations on the branch. % 0.10/0.40 # There were 1 successful branch saturations after the branch. % 0.10/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.40 # Begin clausification derivation % 0.10/0.40 % 0.10/0.40 # End clausification derivation % 0.10/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.40 cnf(i_0_8, hypothesis, (environment(esk1_0))). % 0.10/0.40 cnf(i_0_7, hypothesis, (subpopulations(first_movers,efficient_producers,esk1_0,esk2_0))). % 0.10/0.40 cnf(i_0_5, hypothesis, (greater(zero,growth_rate(efficient_producers,esk2_0)))). % 0.10/0.40 cnf(i_0_6, hypothesis, (greater_or_equal(growth_rate(first_movers,esk2_0),zero))). % 0.10/0.40 cnf(i_0_9, negated_conjecture, (~outcompetes(first_movers,efficient_producers,X1)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.10/0.40 cnf(i_0_2, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.10/0.40 cnf(i_0_1, plain, (subpopulations(X1,X2,X3,X4)|~subpopulations(X2,X1,X3,X4)|~environment(X3))). % 0.10/0.40 cnf(i_0_3, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))). % 0.10/0.40 cnf(i_0_4, 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.10/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.40 # Begin printing tableau % 0.10/0.40 # Found 8 steps % 0.10/0.40 cnf(i_0_8, hypothesis, (environment(esk1_0)), inference(start_rule)). % 0.10/0.40 cnf(i_0_51, plain, (environment(esk1_0)), inference(extension_rule, [i_0_9])). % 0.10/0.40 cnf(i_0_91, plain, (~subpopulations(first_movers,efficient_producers,esk1_0,esk2_0)), inference(closure_rule, [i_0_7])). % 0.10/0.40 cnf(i_0_90, plain, (~outcompetes(first_movers,efficient_producers,esk2_0)), inference(extension_rule, [i_0_4])). % 0.10/0.40 cnf(i_0_105, plain, (~greater(zero,growth_rate(efficient_producers,esk2_0))), inference(closure_rule, [i_0_5])). % 0.10/0.40 cnf(i_0_106, plain, (~greater_or_equal(growth_rate(first_movers,esk2_0),zero)), inference(closure_rule, [i_0_6])). % 0.10/0.40 cnf(i_0_108, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_8])). % 0.10/0.40 cnf(i_0_107, plain, (~subpopulations(efficient_producers,first_movers,esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_107, ...])). % 0.10/0.40 # End printing tableau % 0.10/0.40 # SZS output end % 0.10/0.40 # Branches closed with saturation will be marked with an "s" % 0.10/0.41 # Child (1549634) has found a proof. % 0.10/0.41 % 0.10/0.41 # Proof search is over... % 0.10/0.41 # Freeing feature tree %------------------------------------------------------------------------------