%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT023+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 : 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 : Theorem 0.13s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT023+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.35 % Computer : n011.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:06:45 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 17 Number of unprocessed: 17 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # 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 # 17 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 3 conjectures. % 0.13/0.39 # There are 3 start rule candidates: % 0.13/0.39 # Found 3 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 3 start rule tableaux created. % 0.13/0.39 # 14 extension rule candidate clauses % 0.13/0.39 # 3 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 3 % 0.13/0.39 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux. % 0.13/0.39 # We now have 16 tableaux to operate on % 0.13/0.40 # Creating equality axioms % 0.13/0.40 # Ran out of tableaux, making start rules for all clauses % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 1 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 1 successful branch saturations after the branch. % 0.13/0.40 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_17, negated_conjecture, (environment(esk5_0))). % 0.13/0.40 cnf(i_0_16, negated_conjecture, (stable(esk5_0))). % 0.13/0.40 cnf(i_0_15, negated_conjecture, (~in_environment(esk5_0,critical_point(esk5_0)))). % 0.13/0.40 cnf(i_0_14, hypothesis, (in_environment(X1,esk4_1(X1))|~stable(X1)|~environment(X1))). % 0.13/0.40 cnf(i_0_6, plain, (greater_or_equal(esk1_2(X1,X2),X2)|in_environment(X1,esk2_1(X1))|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.40 cnf(i_0_11, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(esk3_2(X2,X1),X1)|~in_environment(X2,X1)|~environment(X2))). % 0.13/0.40 cnf(i_0_9, plain, (subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,X2))|in_environment(X1,esk2_1(X1))|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.40 cnf(i_0_3, plain, (in_environment(X1,esk2_1(X1))|~greater(growth_rate(efficient_producers,esk1_2(X1,X2)),growth_rate(first_movers,esk1_2(X1,X2)))|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.40 cnf(i_0_2, plain, (~greater(growth_rate(efficient_producers,esk1_2(X1,X2)),growth_rate(first_movers,esk1_2(X1,X2)))|~greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.40 cnf(i_0_5, plain, (greater_or_equal(esk1_2(X1,X2),X2)|~greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.40 cnf(i_0_13, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~greater_or_equal(X1,esk4_1(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.13/0.40 cnf(i_0_8, plain, (subpopulations(first_movers,efficient_producers,X1,esk1_2(X1,X2))|~greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))|~in_environment(X1,X2)|~environment(X1))). % 0.13/0.40 cnf(i_0_10, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater(growth_rate(efficient_producers,esk3_2(X2,X1)),growth_rate(first_movers,esk3_2(X2,X1)))|~in_environment(X2,X1)|~environment(X2))). % 0.13/0.40 cnf(i_0_12, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,esk3_2(X2,X1))|~in_environment(X2,X1)|~environment(X2))). % 0.13/0.40 cnf(i_0_4, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater_or_equal(esk1_2(X2,X3),X3)|~greater(X1,esk2_1(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~environment(X2))). % 0.13/0.40 cnf(i_0_1, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater(growth_rate(efficient_producers,esk1_2(X2,X3)),growth_rate(first_movers,esk1_2(X2,X3)))|~greater(X1,esk2_1(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~environment(X2))). % 0.13/0.40 cnf(i_0_7, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X3))|~greater(X1,esk2_1(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~in_environment(X2,X3)|~environment(X2))). % 0.13/0.40 cnf(i_0_346, plain, (X16=X16)). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 6 steps % 0.13/0.40 cnf(i_0_346, plain, (esk5_0=esk5_0), inference(start_rule)). % 0.13/0.40 cnf(i_0_426, plain, (esk5_0=esk5_0), inference(extension_rule, [i_0_350])). % 0.13/0.40 cnf(i_0_501, plain, (~environment(esk5_0)), inference(closure_rule, [i_0_17])). % 0.13/0.40 cnf(i_0_499, plain, (environment(esk5_0)), inference(extension_rule, [i_0_14])). % 0.13/0.40 cnf(i_0_503, plain, (~stable(esk5_0)), inference(closure_rule, [i_0_16])). % 0.13/0.40 cnf(i_0_502, plain, (in_environment(esk5_0,esk4_1(esk5_0))), inference(etableau_closure_rule, [i_0_502, ...])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # Child (1630722) has found a proof. % 0.13/0.40 % 0.13/0.40 # Proof search is over... % 0.13/0.40 # Freeing feature tree %------------------------------------------------------------------------------