%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT026+1 : 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 : n002.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:46 AM UTC 2026 % Result : Theorem 0.09s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT026+1 : 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.09/0.38 % Computer : n002.cluster.edu % 0.09/0.38 % Model : x86_64 x86_64 % 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.38 % Memory : 8046.5625MB % 0.09/0.38 % OS : Linux 6.8.0-71-generic % 0.09/0.38 % CPULimit : 300 % 0.09/0.38 % WCLimit : 300 % 0.09/0.38 % DateTime : Mon Sep 7 12:13:37 UTC 2026 % 0.09/0.38 % CPUTime : % 0.09/0.42 # No SInE strategy applied % 0.09/0.42 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.09/0.42 # and selection function SelectComplexExceptUniqMaxHorn. % 0.09/0.42 # % 0.09/0.42 # Presaturation interreduction done % 0.09/0.42 # Number of axioms: 18 Number of unprocessed: 18 % 0.09/0.42 # Tableaux proof search. % 0.09/0.42 # APR header successfully linked. % 0.09/0.42 # Hello from C++ % 0.09/0.42 # The folding up rule is enabled... % 0.09/0.42 # Local unification is enabled... % 0.09/0.42 # Any saturation attempts will use folding labels... % 0.09/0.42 # 18 beginning clauses after preprocessing and clausification % 0.09/0.42 # Creating start rules for all 4 conjectures. % 0.09/0.42 # There are 4 start rule candidates: % 0.09/0.42 # Found 5 unit axioms. % 0.09/0.42 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.09/0.42 # 4 start rule tableaux created. % 0.09/0.42 # 13 extension rule candidate clauses % 0.09/0.42 # 5 unit axiom clauses % 0.09/0.42 % 0.09/0.42 # Requested 8, 32 cores available to the main process. % 0.09/0.42 # There are not enough tableaux to fork, creating more from the initial 4 % 0.09/0.42 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.09/0.42 # We now have 12 tableaux to operate on % 0.09/0.42 # Creating equality axioms % 0.09/0.42 # Ran out of tableaux, making start rules for all clauses % 0.09/0.42 # There were 1 total branch saturation attempts. % 0.09/0.42 # There were 0 of these attempts blocked. % 0.09/0.42 # There were 0 deferred branch saturation attempts. % 0.09/0.42 # There were 0 free duplicated saturations. % 0.09/0.42 # There were 1 total successful branch saturations. % 0.09/0.42 # There were 0 successful branch saturations in interreduction. % 0.09/0.42 # There were 0 successful branch saturations on the branch. % 0.09/0.42 # There were 1 successful branch saturations after the branch. % 0.09/0.42 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.09/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.09/0.42 # Begin clausification derivation % 0.09/0.42 % 0.09/0.42 # End clausification derivation % 0.09/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.09/0.42 cnf(i_0_18, negated_conjecture, (environment(esk1_0))). % 0.09/0.42 cnf(i_0_17, negated_conjecture, (in_environment(esk1_0,esk2_0))). % 0.09/0.42 cnf(i_0_16, negated_conjecture, (greater(esk2_0,critical_point(esk1_0)))). % 0.09/0.42 cnf(i_0_9, plain, (greater_or_equal(X1,X1))). % 0.09/0.42 cnf(i_0_15, negated_conjecture, (~selection_favors(efficient_producers,first_movers,esk2_0))). % 0.09/0.42 cnf(i_0_10, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.09/0.42 cnf(i_0_11, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.09/0.42 cnf(i_0_8, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.09/0.42 cnf(i_0_6, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.09/0.42 cnf(i_0_5, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.09/0.42 cnf(i_0_7, plain, (greater_or_equal(critical_point(X1),appear(efficient_producers,X1))|~environment(X1))). % 0.09/0.42 cnf(i_0_13, hypothesis, (~greater(growth_rate(efficient_producers,critical_point(X1)),growth_rate(first_movers,critical_point(X1)))|~environment(X1))). % 0.09/0.42 cnf(i_0_4, plain, (greater_or_equal(cardinality_at_time(first_movers,X1),zero)|~in_environment(X2,X1)|~environment(X2))). % 0.09/0.42 cnf(i_0_14, hypothesis, (greater(cardinality_at_time(efficient_producers,X1),zero)|~greater_or_equal(X1,appear(efficient_producers,X2))|~in_environment(X2,X1)|~environment(X2))). % 0.09/0.42 cnf(i_0_2, plain, (selection_favors(X1,X2,X3)|cardinality_at_time(X2,X3)!=zero|~subpopulation(X2,X4,X3)|~subpopulation(X1,X4,X3)|~greater(cardinality_at_time(X1,X3),zero)|~environment(X4))). % 0.09/0.42 cnf(i_0_3, plain, (subpopulations(first_movers,efficient_producers,X1,X2)|~in_environment(X1,X2)|~greater(cardinality_at_time(first_movers,X2),zero)|~greater(cardinality_at_time(efficient_producers,X2),zero)|~environment(X1))). % 0.09/0.42 cnf(i_0_1, plain, (selection_favors(X1,X2,X3)|~greater(growth_rate(X1,X3),growth_rate(X2,X3))|~subpopulations(X2,X1,X4,X3)|~environment(X4))). % 0.09/0.42 cnf(i_0_12, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater(X1,critical_point(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.09/0.42 cnf(i_0_202, plain, (X36=X36)). % 0.09/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.09/0.42 # Begin printing tableau % 0.09/0.42 # Found 6 steps % 0.09/0.42 cnf(i_0_202, plain, (esk1_0=esk1_0), inference(start_rule)). % 0.09/0.42 cnf(i_0_266, plain, (esk1_0=esk1_0), inference(extension_rule, [i_0_206])). % 0.09/0.42 cnf(i_0_320, plain, (~environment(esk1_0)), inference(closure_rule, [i_0_18])). % 0.09/0.42 cnf(i_0_318, plain, (environment(esk1_0)), inference(extension_rule, [i_0_6])). % 0.09/0.42 cnf(i_0_330, plain, (~in_environment(esk1_0,esk2_0)), inference(closure_rule, [i_0_17])). % 0.09/0.42 cnf(i_0_329, plain, (subpopulation(first_movers,esk1_0,esk2_0)), inference(etableau_closure_rule, [i_0_329, ...])). % 0.09/0.42 # End printing tableau % 0.09/0.42 # SZS output end % 0.09/0.42 # Branches closed with saturation will be marked with an "s" % 0.09/0.43 # Child (3586929) has found a proof. % 0.09/0.43 % 0.09/0.43 # Proof search is over... % 0.09/0.43 # Freeing feature tree %------------------------------------------------------------------------------