%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT019-2 : 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 : n007.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:44 AM UTC 2026 % Result : Satisfiable 0.09s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT019-2 : 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.09/0.37 % Computer : n007.cluster.edu % 0.09/0.37 % Model : x86_64 x86_64 % 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.37 % Memory : 8046.5625MB % 0.09/0.37 % OS : Linux 6.8.0-71-generic % 0.09/0.37 % CPULimit : 300 % 0.09/0.37 % WCLimit : 300 % 0.09/0.37 % DateTime : Mon Sep 7 11:57:11 UTC 2026 % 0.09/0.38 % CPUTime : % 0.09/0.41 # No SInE strategy applied % 0.09/0.41 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.09/0.41 # and selection function SelectComplexExceptUniqMaxHorn. % 0.09/0.41 # % 0.09/0.41 # Presaturation interreduction done % 0.09/0.41 # Number of axioms: 12 Number of unprocessed: 12 % 0.09/0.41 # Tableaux proof search. % 0.09/0.41 # APR header successfully linked. % 0.09/0.41 # Hello from C++ % 0.09/0.41 # The folding up rule is enabled... % 0.09/0.41 # Local unification is enabled... % 0.09/0.41 # Any saturation attempts will use folding labels... % 0.09/0.41 # 12 beginning clauses after preprocessing and clausification % 0.09/0.41 # Creating start rules for all 5 conjectures. % 0.09/0.41 # There are 5 start rule candidates: % 0.09/0.41 # Found 5 unit axioms. % 0.09/0.41 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.09/0.41 # 5 start rule tableaux created. % 0.09/0.41 # 7 extension rule candidate clauses % 0.09/0.41 # 5 unit axiom clauses % 0.09/0.41 % 0.09/0.41 # Requested 8, 32 cores available to the main process. % 0.09/0.41 # There are not enough tableaux to fork, creating more from the initial 5 % 0.09/0.41 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux. % 0.09/0.41 # We now have 10 tableaux to operate on % 0.09/0.41 # 1336253 Satisfiable branch % 0.09/0.41 # Satisfiable branch found. % 0.09/0.41 # There were 1 total branch saturation attempts. % 0.09/0.41 # There were 0 of these attempts blocked. % 0.09/0.41 # There were 0 deferred branch saturation attempts. % 0.09/0.41 # There were 0 free duplicated saturations. % 0.09/0.41 # There were 0 total successful branch saturations. % 0.09/0.41 # There were 0 successful branch saturations in interreduction. % 0.09/0.41 # There were 0 successful branch saturations on the branch. % 0.09/0.41 # There were 0 successful branch saturations after the branch. % 0.09/0.41 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.41 # Begin clausification derivation % 0.09/0.41 % 0.09/0.41 # End clausification derivation % 0.09/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.09/0.41 cnf(i_0_20, negated_conjecture, (environment(sk4))). % 0.09/0.41 cnf(i_0_21, negated_conjecture, (stable(sk4))). % 0.09/0.41 cnf(i_0_13, plain, (environment(sk1))). % 0.09/0.41 cnf(i_0_14, plain, (subpopulations(first_movers,efficient_producers,sk1,sk2))). % 0.09/0.41 cnf(i_0_15, plain, (~greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))). % 0.09/0.41 cnf(i_0_22, negated_conjecture, (subpopulations(first_movers,efficient_producers,sk4,sk5(X1))|~in_environment(sk4,X1))). % 0.09/0.41 cnf(i_0_18, hypothesis, (in_environment(X1,sk3(X1))|~stable(X1)|~environment(X1))). % 0.09/0.41 cnf(i_0_23, negated_conjecture, (greater_or_equal(sk5(X1),X1)|~in_environment(sk4,X1))). % 0.09/0.41 cnf(i_0_17, plain, (X1=X2|greater(X1,X2)|~greater_or_equal(X1,X2))). % 0.09/0.41 cnf(i_0_24, negated_conjecture, (~in_environment(sk4,X1)|~greater(growth_rate(efficient_producers,sk5(X1)),growth_rate(first_movers,sk5(X1))))). % 0.09/0.41 cnf(i_0_16, plain, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1))|~greater(disbanding_rate(first_movers,X1),disbanding_rate(efficient_producers,X1)))). % 0.09/0.41 cnf(i_0_19, hypothesis, (greater_or_equal(founding_rate(efficient_producers,X1),founding_rate(first_movers,X1))|~stable(X2)|~greater_or_equal(X1,sk3(X2))|~subpopulations(first_movers,efficient_producers,X2,X1)|~environment(X2))). % 0.09/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.09/0.41 # Begin printing tableau % 0.09/0.41 # Found 4 steps % 0.09/0.41 cnf(i_0_20, negated_conjecture, (environment(sk4)), inference(start_rule)). % 0.09/0.41 cnf(i_0_32, plain, (environment(sk4)), inference(extension_rule, [i_0_18])). % 0.09/0.41 cnf(i_0_154, plain, (~stable(sk4)), inference(closure_rule, [i_0_21])). % 0.09/0.41 cnf(i_0_153, plain, (in_environment(sk4,sk3(sk4))), inference(extension_rule, [i_0_24])). % 0.09/0.41 # End printing tableau % 0.09/0.41 # SZS output end % 0.09/0.41 # Branches closed with saturation will be marked with an "s" % 0.09/0.41 # Creating equality axioms % 0.09/0.41 # Ran out of tableaux, making start rules for all clauses % 0.09/0.41 # 1336258 Satisfiable branch % 0.09/0.41 # Child (1336253) has found a proof. % 0.09/0.41 % 0.09/0.41 # Proof search is over... % 0.09/0.41 # Freeing feature tree %------------------------------------------------------------------------------