%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT035-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 : n003.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:47 AM UTC 2026 % Result : Unsatisfiable 0.12s 0.44s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT035-1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.03 % 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 : n003.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:35:39 UTC 2026 % 0.08/0.35 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 25 Number of unprocessed: 25 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 25 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 5 conjectures. % 0.12/0.37 # There are 5 start rule candidates: % 0.12/0.37 # Found 3 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 5 start rule tableaux created. % 0.12/0.37 # 22 extension rule candidate clauses % 0.12/0.37 # 3 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 5 % 0.12/0.37 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 14 tableaux to operate on % 0.12/0.40 # Creating equality axioms % 0.12/0.40 # Ran out of tableaux, making start rules for all clauses % 0.12/0.40 # Creating equality axioms % 0.12/0.40 # Ran out of tableaux, making start rules for all clauses % 0.12/0.42 # Creating equality axioms % 0.12/0.42 # Ran out of tableaux, making start rules for all clauses % 0.12/0.44 # There were 6 total branch saturation attempts. % 0.12/0.44 # There were 0 of these attempts blocked. % 0.12/0.44 # There were 0 deferred branch saturation attempts. % 0.12/0.44 # There were 0 free duplicated saturations. % 0.12/0.44 # There were 6 total successful branch saturations. % 0.12/0.44 # There were 0 successful branch saturations in interreduction. % 0.12/0.44 # There were 0 successful branch saturations on the branch. % 0.12/0.44 # There were 6 successful branch saturations after the branch. % 0.12/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.44 # Begin clausification derivation % 0.12/0.44 % 0.12/0.44 # End clausification derivation % 0.12/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.44 cnf(i_0_46, negated_conjecture, (environment(sk3))). % 0.12/0.44 cnf(i_0_47, negated_conjecture, (stable(sk3))). % 0.12/0.44 cnf(i_0_30, plain, (greater_or_equal(X1,X1))). % 0.12/0.44 cnf(i_0_50, negated_conjecture, (~outcompetes(efficient_producers,first_movers,sk4(X1))|~in_environment(sk3,X1))). % 0.12/0.44 cnf(i_0_48, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk3,sk4(X1))|~in_environment(sk3,X1))). % 0.12/0.44 cnf(i_0_49, negated_conjecture, (greater_or_equal(sk4(X1),X1)|~in_environment(sk3,X1))). % 0.12/0.44 cnf(i_0_29, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.12/0.44 cnf(i_0_42, hypothesis, (in_environment(X1,sk1(X1))|~stable(X1)|~environment(X1))). % 0.12/0.44 cnf(i_0_44, hypothesis, (in_environment(X1,sk2(X1))|~stable(X1)|~environment(X1))). % 0.12/0.44 cnf(i_0_28, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.12/0.44 cnf(i_0_45, hypothesis, (greater_or_equal(sk2(X1),equilibrium(X1))|~stable(X1)|~environment(X1))). % 0.12/0.44 cnf(i_0_26, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.12/0.44 cnf(i_0_32, hypothesis, (greater_or_equal(growth_rate(X1,X2),zero)|~outcompetes(X1,X3,X2)|~subpopulations(X3,X1,X4,X2)|~environment(X4))). % 0.12/0.44 cnf(i_0_43, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,sk1(X2)))). % 0.12/0.44 cnf(i_0_33, hypothesis, (greater(zero,growth_rate(X1,X2))|~outcompetes(X3,X1,X2)|~subpopulations(X1,X3,X4,X2)|~environment(X4))). % 0.12/0.44 cnf(i_0_27, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~in_environment(X3,X2)|~in_environment(X3,X1))). % 0.12/0.44 cnf(i_0_31, hypothesis, (outcompetes(X1,X2,X3)|~subpopulations(X2,X1,X4,X3)|~environment(X4)|~greater_or_equal(growth_rate(X1,X3),zero)|~greater(zero,growth_rate(X2,X3)))). % 0.12/0.44 cnf(i_0_37, hypothesis, (growth_rate(first_movers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.12/0.44 cnf(i_0_41, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(zero,growth_rate(efficient_producers,X1))|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.12/0.44 cnf(i_0_35, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.12/0.44 cnf(i_0_36, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.12/0.44 cnf(i_0_39, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(first_movers,X1),zero)|greater(zero,growth_rate(first_movers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.12/0.44 cnf(i_0_40, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(zero,growth_rate(efficient_producers,X1))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.12/0.44 cnf(i_0_34, hypothesis, (growth_rate(first_movers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.12/0.44 cnf(i_0_38, hypothesis, (growth_rate(efficient_producers,X1)=zero|greater(growth_rate(efficient_producers,X1),zero)|greater(growth_rate(first_movers,X1),zero)|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2)|~greater_or_equal(X1,equilibrium(X2)))). % 0.12/0.44 cnf(i_0_248, plain, (X5=X5)). % 0.12/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.44 # Begin printing tableau % 0.12/0.44 # Found 18 steps % 0.12/0.44 cnf(i_0_248, plain, (sk2(sk3)=sk2(sk3)), inference(start_rule)). % 0.12/0.44 cnf(i_0_361, plain, (sk2(sk3)=sk2(sk3)), inference(extension_rule, [i_0_252])). % 0.12/0.44 cnf(i_0_465, plain, ($false), inference(closure_rule, [i_0_248])). % 0.12/0.44 cnf(i_0_463, plain, (greater(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_29])). % 0.12/0.44 cnf(i_0_467, plain, (greater_or_equal(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_43])). % 0.12/0.44 cnf(i_0_489, plain, (~stable(sk3)), inference(closure_rule, [i_0_47])). % 0.12/0.44 cnf(i_0_491, plain, (~environment(sk3)), inference(closure_rule, [i_0_46])). % 0.12/0.44 cnf(i_0_466, plain, (~greater(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_27])). % 0.12/0.44 cnf(i_0_2384, plain, (sk2(sk3)=sk1(sk3)), inference(extension_rule, [i_0_255])). % 0.12/0.44 cnf(i_0_2387, plain, (~in_environment(sk3,sk2(sk3))), inference(extension_rule, [i_0_44])). % 0.12/0.44 cnf(i_0_2472, plain, (~stable(sk3)), inference(closure_rule, [i_0_47])). % 0.12/0.44 cnf(i_0_2473, plain, (~environment(sk3)), inference(closure_rule, [i_0_46])). % 0.12/0.44 cnf(i_0_488, plain, (greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))), inference(etableau_closure_rule, [i_0_488, ...])). % 0.12/0.44 cnf(i_0_490, plain, (~subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))), inference(etableau_closure_rule, [i_0_490, ...])). % 0.12/0.44 cnf(i_0_2388, plain, (~in_environment(sk3,sk1(sk3))), inference(etableau_closure_rule, [i_0_2388, ...])). % 0.12/0.44 cnf(i_0_2385, plain, (greater(sk1(sk3),sk2(sk3))), inference(etableau_closure_rule, [i_0_2385, ...])). % 0.12/0.44 cnf(i_0_2468, plain, (environment(sk2(sk3))), inference(etableau_closure_rule, [i_0_2468, ...])). % 0.12/0.44 cnf(i_0_2470, plain, (~environment(sk1(sk3))), inference(etableau_closure_rule, [i_0_2470, ...])). % 0.12/0.44 # End printing tableau % 0.12/0.44 # SZS output end % 0.12/0.44 # Branches closed with saturation will be marked with an "s" % 0.12/0.44 # Child (127711) has found a proof. % 0.12/0.44 % 0.12/0.44 # Proof search is over... % 0.12/0.44 # Freeing feature tree %------------------------------------------------------------------------------