%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT029-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 : n017.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.83s 0.52s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT029-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.08/0.34 % Computer : n017.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Mon Sep 7 12:12:24 UTC 2026 % 0.08/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 22 Number of unprocessed: 22 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 22 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 5 conjectures. % 0.13/0.38 # There are 5 start rule candidates: % 0.13/0.38 # Found 3 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 5 start rule tableaux created. % 0.13/0.38 # 19 extension rule candidate clauses % 0.13/0.38 # 3 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 5 % 0.13/0.38 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.13/0.38 # We now have 14 tableaux to operate on % 0.13/0.41 # Creating equality axioms % 0.13/0.41 # Ran out of tableaux, making start rules for all clauses % 0.13/0.44 # Creating equality axioms % 0.13/0.44 # Ran out of tableaux, making start rules for all clauses % 0.13/0.44 # Creating equality axioms % 0.13/0.44 # Ran out of tableaux, making start rules for all clauses % 0.83/0.52 # There were 6 total branch saturation attempts. % 0.83/0.52 # There were 0 of these attempts blocked. % 0.83/0.52 # There were 0 deferred branch saturation attempts. % 0.83/0.52 # There were 0 free duplicated saturations. % 0.83/0.52 # There were 6 total successful branch saturations. % 0.83/0.52 # There were 0 successful branch saturations in interreduction. % 0.83/0.52 # There were 0 successful branch saturations on the branch. % 0.83/0.52 # There were 6 successful branch saturations after the branch. % 0.83/0.52 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.83/0.52 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.83/0.52 # Begin clausification derivation % 0.83/0.52 % 0.83/0.52 # End clausification derivation % 0.83/0.52 # Begin listing active clauses obtained from FOF to CNF conversion % 0.83/0.52 cnf(i_0_40, negated_conjecture, (environment(sk3))). % 0.83/0.52 cnf(i_0_41, negated_conjecture, (stable(sk3))). % 0.83/0.52 cnf(i_0_27, plain, (greater_or_equal(X1,X1))). % 0.83/0.52 cnf(i_0_42, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk3,sk4(X1))|~in_environment(sk3,X1))). % 0.83/0.52 cnf(i_0_44, negated_conjecture, (~in_environment(sk3,X1)|~greater(zero,growth_rate(first_movers,sk4(X1)))|~greater(growth_rate(efficient_producers,sk4(X1)),zero))). % 0.83/0.52 cnf(i_0_43, negated_conjecture, (greater_or_equal(sk4(X1),X1)|~in_environment(sk3,X1))). % 0.83/0.52 cnf(i_0_26, plain, (greater_or_equal(X1,X2)|~greater(X1,X2))). % 0.83/0.52 cnf(i_0_36, hypothesis, (in_environment(X1,sk1(X1))|~stable(X1)|~environment(X1))). % 0.83/0.52 cnf(i_0_38, hypothesis, (in_environment(X1,sk2(X1))|~stable(X1)|~environment(X1))). % 0.83/0.52 cnf(i_0_25, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.83/0.52 cnf(i_0_39, hypothesis, (greater_or_equal(sk2(X1),equilibrium(X1))|~stable(X1)|~environment(X1))). % 0.83/0.52 cnf(i_0_23, plain, (greater(X1,X2)|~greater(X3,X2)|~greater(X1,X3))). % 0.83/0.52 cnf(i_0_37, 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.83/0.52 cnf(i_0_31, 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.83/0.52 cnf(i_0_35, 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.83/0.52 cnf(i_0_24, plain, (X1=X2|greater(X1,X2)|greater(X2,X1)|~in_environment(X3,X2)|~in_environment(X3,X1))). % 0.83/0.52 cnf(i_0_29, 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.83/0.52 cnf(i_0_30, 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.83/0.52 cnf(i_0_33, 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.83/0.52 cnf(i_0_34, 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.83/0.52 cnf(i_0_28, 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.83/0.52 cnf(i_0_32, 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.83/0.52 cnf(i_0_301, plain, (X4=X4)). % 0.83/0.52 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.83/0.52 # Begin printing tableau % 0.83/0.52 # Found 18 steps % 0.83/0.52 cnf(i_0_301, plain, (sk2(sk3)=sk2(sk3)), inference(start_rule)). % 0.83/0.52 cnf(i_0_401, plain, (sk2(sk3)=sk2(sk3)), inference(extension_rule, [i_0_305])). % 0.83/0.52 cnf(i_0_493, plain, ($false), inference(closure_rule, [i_0_301])). % 0.83/0.52 cnf(i_0_491, plain, (greater(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_26])). % 0.83/0.52 cnf(i_0_495, plain, (greater_or_equal(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_37])). % 0.83/0.52 cnf(i_0_513, plain, (~stable(sk3)), inference(closure_rule, [i_0_41])). % 0.83/0.52 cnf(i_0_515, plain, (~environment(sk3)), inference(closure_rule, [i_0_40])). % 0.83/0.52 cnf(i_0_494, plain, (~greater(sk2(sk3),sk1(sk3))), inference(extension_rule, [i_0_24])). % 0.83/0.52 cnf(i_0_2177, plain, (sk2(sk3)=sk1(sk3)), inference(extension_rule, [i_0_308])). % 0.83/0.52 cnf(i_0_2180, plain, (~in_environment(sk3,sk2(sk3))), inference(extension_rule, [i_0_38])). % 0.83/0.52 cnf(i_0_2253, plain, (~stable(sk3)), inference(closure_rule, [i_0_41])). % 0.83/0.52 cnf(i_0_2254, plain, (~environment(sk3)), inference(closure_rule, [i_0_40])). % 0.83/0.52 cnf(i_0_512, plain, (greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))), inference(etableau_closure_rule, [i_0_512, ...])). % 0.83/0.52 cnf(i_0_514, plain, (~subpopulations(first_movers,efficient_producers,sk3,sk2(sk3))), inference(etableau_closure_rule, [i_0_514, ...])). % 0.83/0.52 cnf(i_0_2181, plain, (~in_environment(sk3,sk1(sk3))), inference(etableau_closure_rule, [i_0_2181, ...])). % 0.83/0.52 cnf(i_0_2178, plain, (greater(sk1(sk3),sk2(sk3))), inference(etableau_closure_rule, [i_0_2178, ...])). % 0.83/0.52 cnf(i_0_2249, plain, (environment(sk2(sk3))), inference(etableau_closure_rule, [i_0_2249, ...])). % 0.83/0.52 cnf(i_0_2251, plain, (~environment(sk1(sk3))), inference(etableau_closure_rule, [i_0_2251, ...])). % 0.83/0.52 # End printing tableau % 0.83/0.52 # SZS output end % 0.83/0.52 # Branches closed with saturation will be marked with an "s" % 0.83/0.52 # Child (1795790) has found a proof. % 0.83/0.52 % 0.83/0.53 # Proof search is over... % 0.83/0.53 # Freeing feature tree %------------------------------------------------------------------------------