%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT026-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 : 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:46 AM UTC 2026 % Result : Unsatisfiable 0.10s 0.39s % 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.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.37 % Computer : n009.cluster.edu % 0.10/0.37 % Model : x86_64 x86_64 % 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.37 % Memory : 8046.5625MB % 0.10/0.37 % OS : Linux 6.8.0-71-generic % 0.10/0.37 % CPULimit : 300 % 0.10/0.37 % WCLimit : 300 % 0.10/0.37 % DateTime : Mon Sep 7 12:12:37 UTC 2026 % 0.10/0.37 % CPUTime : % 0.10/0.38 # No SInE strategy applied % 0.10/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.10/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.10/0.38 # % 0.10/0.38 # Presaturation interreduction done % 0.10/0.38 # Number of axioms: 18 Number of unprocessed: 18 % 0.10/0.38 # Tableaux proof search. % 0.10/0.38 # APR header successfully linked. % 0.10/0.38 # Hello from C++ % 0.10/0.39 # The folding up rule is enabled... % 0.10/0.39 # Local unification is enabled... % 0.10/0.39 # Any saturation attempts will use folding labels... % 0.10/0.39 # 18 beginning clauses after preprocessing and clausification % 0.10/0.39 # Creating start rules for all 4 conjectures. % 0.10/0.39 # There are 4 start rule candidates: % 0.10/0.39 # Found 5 unit axioms. % 0.10/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.39 # 4 start rule tableaux created. % 0.10/0.39 # 13 extension rule candidate clauses % 0.10/0.39 # 5 unit axiom clauses % 0.10/0.39 % 0.10/0.39 # Requested 8, 32 cores available to the main process. % 0.10/0.39 # There are not enough tableaux to fork, creating more from the initial 4 % 0.10/0.39 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.10/0.39 # We now have 12 tableaux to operate on % 0.10/0.39 # There were 2 total branch saturation attempts. % 0.10/0.39 # There were 0 of these attempts blocked. % 0.10/0.39 # There were 0 deferred branch saturation attempts. % 0.10/0.39 # There were 0 free duplicated saturations. % 0.10/0.39 # There were 2 total successful branch saturations. % 0.10/0.39 # There were 0 successful branch saturations in interreduction. % 0.10/0.39 # There were 0 successful branch saturations on the branch. % 0.10/0.39 # There were 2 successful branch saturations after the branch. % 0.10/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.10/0.39 # Begin clausification derivation % 0.10/0.39 % 0.10/0.39 # End clausification derivation % 0.10/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.10/0.39 cnf(i_0_33, negated_conjecture, (environment(sk1))). % 0.10/0.39 cnf(i_0_34, negated_conjecture, (in_environment(sk1,sk2))). % 0.10/0.39 cnf(i_0_35, negated_conjecture, (greater(sk2,critical_point(sk1)))). % 0.10/0.39 cnf(i_0_29, plain, (greater_or_equal(X1,X1))). % 0.10/0.39 cnf(i_0_36, negated_conjecture, (~selection_favors(efficient_producers,first_movers,sk2))). % 0.10/0.39 cnf(i_0_28, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.10/0.39 cnf(i_0_27, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.10/0.39 cnf(i_0_26, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.10/0.39 cnf(i_0_23, plain, (subpopulation(first_movers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.10/0.39 cnf(i_0_24, plain, (subpopulation(efficient_producers,X1,X2)|~in_environment(X1,X2)|~environment(X1))). % 0.10/0.39 cnf(i_0_25, plain, (greater_or_equal(critical_point(X1),appear(efficient_producers,X1))|~environment(X1))). % 0.10/0.39 cnf(i_0_30, hypothesis, (~greater(growth_rate(efficient_producers,critical_point(X1)),growth_rate(first_movers,critical_point(X1)))|~environment(X1))). % 0.10/0.39 cnf(i_0_22, plain, (greater_or_equal(cardinality_at_time(first_movers,X1),zero)|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_32, hypothesis, (greater(cardinality_at_time(efficient_producers,X1),zero)|~greater_or_equal(X1,appear(efficient_producers,X2))|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_20, 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.10/0.39 cnf(i_0_21, 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.10/0.39 cnf(i_0_19, plain, (selection_favors(X1,X2,X3)|~greater(growth_rate(X1,X3),growth_rate(X2,X3))|~subpopulations(X2,X1,X4,X3)|~environment(X4))). % 0.10/0.39 cnf(i_0_31, 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.10/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.10/0.39 # Begin printing tableau % 0.10/0.39 # Found 8 steps % 0.10/0.39 cnf(i_0_35, negated_conjecture, (greater(sk2,critical_point(sk1))), inference(start_rule)). % 0.10/0.39 cnf(i_0_41, plain, (greater(sk2,critical_point(sk1))), inference(extension_rule, [i_0_26])). % 0.10/0.39 cnf(i_0_93, plain, (greater(sk2,appear(efficient_producers,sk1))), inference(extension_rule, [i_0_28])). % 0.10/0.39 cnf(i_0_176, plain, (greater_or_equal(sk2,appear(efficient_producers,sk1))), inference(extension_rule, [i_0_32])). % 0.10/0.39 cnf(i_0_199, plain, (~in_environment(sk1,sk2)), inference(closure_rule, [i_0_34])). % 0.10/0.39 cnf(i_0_200, plain, (~environment(sk1)), inference(closure_rule, [i_0_33])). % 0.10/0.39 cnf(i_0_94, plain, (~greater(critical_point(sk1),appear(efficient_producers,sk1))), inference(etableau_closure_rule, [i_0_94, ...])). % 0.10/0.39 cnf(i_0_197, plain, (greater(cardinality_at_time(efficient_producers,sk2),zero)), inference(etableau_closure_rule, [i_0_197, ...])). % 0.10/0.39 # End printing tableau % 0.10/0.39 # SZS output end % 0.10/0.39 # Branches closed with saturation will be marked with an "s" % 0.10/0.39 # Creating equality axioms % 0.10/0.39 # Ran out of tableaux, making start rules for all clauses % 0.10/0.40 # Child (1509444) has found a proof. % 0.10/0.40 % 0.10/0.40 # Proof search is over... % 0.10/0.40 # Freeing feature tree %------------------------------------------------------------------------------