%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT023+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 : n006.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:45 AM UTC 2026 % Result : Theorem 0.10s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT023+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.10/0.36 % Computer : n006.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Mon Sep 7 12:06:01 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_S032N % 0.10/0.38 # and selection function SelectUnlessUniqMax. % 0.10/0.38 # % 0.10/0.38 # Presaturation interreduction done % 0.10/0.38 # Number of axioms: 9 Number of unprocessed: 9 % 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.38 # The folding up rule is enabled... % 0.10/0.38 # Local unification is enabled... % 0.10/0.38 # Any saturation attempts will use folding labels... % 0.10/0.38 # 9 beginning clauses after preprocessing and clausification % 0.10/0.38 # Creating start rules for all 3 conjectures. % 0.10/0.38 # There are 3 start rule candidates: % 0.10/0.38 # Found 3 unit axioms. % 0.10/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.10/0.38 # 3 start rule tableaux created. % 0.10/0.38 # 6 extension rule candidate clauses % 0.10/0.38 # 3 unit axiom clauses % 0.10/0.38 % 0.10/0.38 # Requested 8, 32 cores available to the main process. % 0.10/0.38 # There are not enough tableaux to fork, creating more from the initial 3 % 0.10/0.38 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 0.10/0.38 # We now have 9 tableaux to operate on % 0.10/0.39 # Creating equality axioms % 0.10/0.39 # Ran out of tableaux, making start rules for all clauses % 0.10/0.39 # Creating equality axioms % 0.10/0.39 # Ran out of tableaux, making start rules for all clauses % 0.10/0.39 # There were 1 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 1 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 1 successful branch saturations after the branch. % 0.10/0.39 # SZS status Theorem 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_9, negated_conjecture, (environment(esk3_0))). % 0.10/0.39 cnf(i_0_8, negated_conjecture, (stable(esk3_0))). % 0.10/0.39 cnf(i_0_7, negated_conjecture, (~in_environment(esk3_0,critical_point(esk3_0)))). % 0.10/0.39 cnf(i_0_6, hypothesis, (in_environment(X1,esk2_1(X1))|~stable(X1)|~environment(X1))). % 0.10/0.39 cnf(i_0_5, hypothesis, (~stable(X1)|~greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))|~environment(X1))). % 0.10/0.39 cnf(i_0_2, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(esk1_2(X2,X1),X1)|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_4, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~greater(X1,esk2_1(X2))|~environment(X2))). % 0.10/0.39 cnf(i_0_1, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~greater(growth_rate(efficient_producers,esk1_2(X2,X1)),growth_rate(first_movers,esk1_2(X2,X1)))|~environment(X2))). % 0.10/0.39 cnf(i_0_3, hypothesis, (X1=critical_point(X2)|subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X1))|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_143, plain, (X11=X11)). % 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 6 steps % 0.10/0.39 cnf(i_0_143, plain, (esk3_0=esk3_0), inference(start_rule)). % 0.10/0.39 cnf(i_0_183, plain, (esk3_0=esk3_0), inference(extension_rule, [i_0_147])). % 0.10/0.39 cnf(i_0_219, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_9])). % 0.10/0.39 cnf(i_0_217, plain, (environment(esk3_0)), inference(extension_rule, [i_0_6])). % 0.10/0.39 cnf(i_0_221, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_8])). % 0.10/0.39 cnf(i_0_220, plain, (in_environment(esk3_0,esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_220, ...])). % 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.39 # Creating equality axioms % 0.10/0.39 # Ran out of tableaux, making start rules for all clauses % 0.10/0.39 # There were 1 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 1 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 1 successful branch saturations after the branch. % 0.10/0.39 # SZS status Theorem 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_9, negated_conjecture, (environment(esk3_0))). % 0.10/0.39 cnf(i_0_8, negated_conjecture, (stable(esk3_0))). % 0.10/0.39 cnf(i_0_7, negated_conjecture, (~in_environment(esk3_0,critical_point(esk3_0)))). % 0.10/0.39 cnf(i_0_6, hypothesis, (in_environment(X1,esk2_1(X1))|~stable(X1)|~environment(X1))). % 0.10/0.39 cnf(i_0_5, hypothesis, (~stable(X1)|~greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))|~environment(X1))). % 0.10/0.39 cnf(i_0_2, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(esk1_2(X2,X1),X1)|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_4, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~greater(X1,esk2_1(X2))|~environment(X2))). % 0.10/0.39 cnf(i_0_1, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~greater(growth_rate(efficient_producers,esk1_2(X2,X1)),growth_rate(first_movers,esk1_2(X2,X1)))|~environment(X2))). % 0.10/0.39 cnf(i_0_3, hypothesis, (X1=critical_point(X2)|subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X1))|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_117, plain, (X11=X11)). % 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 6 steps % 0.10/0.39 cnf(i_0_117, plain, (esk3_0=esk3_0), inference(start_rule)). % 0.10/0.39 cnf(i_0_157, plain, (esk3_0=esk3_0), inference(extension_rule, [i_0_121])). % 0.10/0.39 cnf(i_0_193, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_9])). % 0.10/0.39 cnf(i_0_191, plain, (environment(esk3_0)), inference(extension_rule, [i_0_6])). % 0.10/0.39 cnf(i_0_195, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_8])). % 0.10/0.39 cnf(i_0_194, plain, (in_environment(esk3_0,esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_194, ...])). % 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.39 # There were 1 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 1 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 1 successful branch saturations after the branch. % 0.10/0.39 # There were 3 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 3 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 3 successful branch saturations after the branch. % 0.10/0.39 # SZS status Theorem 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_9, negated_conjecture, (environment(esk3_0))). % 0.10/0.39 cnf(i_0_8, negated_conjecture, (stable(esk3_0))). % 0.10/0.39 cnf(i_0_7, negated_conjecture, (~in_environment(esk3_0,critical_point(esk3_0)))). % 0.10/0.39 cnf(i_0_6, hypothesis, (in_environment(X1,esk2_1(X1))|~stable(X1)|~environment(X1))). % 0.10/0.39 cnf(i_0_5, hypothesis, (~stable(X1)|~greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))|~environment(X1))). % 0.10/0.39 cnf(i_0_2, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(esk1_2(X2,X1),X1)|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_4, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~greater(X1,esk2_1(X2))|~environment(X2))). % 0.10/0.39 cnf(i_0_1, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~greater(growth_rate(efficient_producers,esk1_2(X2,X1)),growth_rate(first_movers,esk1_2(X2,X1)))|~environment(X2))). % 0.10/0.39 cnf(i_0_3, hypothesis, (X1=critical_point(X2)|subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X1))|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(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_8, negated_conjecture, (stable(esk3_0)), inference(start_rule)). % 0.10/0.39 cnf(i_0_11, plain, (stable(esk3_0)), inference(extension_rule, [i_0_5])). % 0.10/0.39 cnf(i_0_44, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_9])). % 0.10/0.39 cnf(i_0_43, plain, (~greater(growth_rate(efficient_producers,esk2_1(esk3_0)),growth_rate(first_movers,esk2_1(esk3_0)))), inference(extension_rule, [i_0_2])). % 0.10/0.39 cnf(i_0_101, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_9])). % 0.10/0.39 cnf(i_0_97, plain, (esk2_1(esk3_0)=critical_point(esk3_0)), inference(etableau_closure_rule, [i_0_97, ...])). % 0.10/0.39 cnf(i_0_99, plain, (greater(esk1_2(esk3_0,esk2_1(esk3_0)),esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_99, ...])). % 0.10/0.39 cnf(i_0_100, plain, (~in_environment(esk3_0,esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_100, ...])). % 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 # There were 1 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 1 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 1 successful branch saturations after the branch. % 0.10/0.39 # SZS status Theorem 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_9, negated_conjecture, (environment(esk3_0))). % 0.10/0.39 cnf(i_0_8, negated_conjecture, (stable(esk3_0))). % 0.10/0.39 cnf(i_0_7, negated_conjecture, (~in_environment(esk3_0,critical_point(esk3_0)))). % 0.10/0.39 cnf(i_0_6, hypothesis, (in_environment(X1,esk2_1(X1))|~stable(X1)|~environment(X1))). % 0.10/0.39 cnf(i_0_5, hypothesis, (~stable(X1)|~greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))|~environment(X1))). % 0.10/0.39 cnf(i_0_2, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(esk1_2(X2,X1),X1)|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_4, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~greater(X1,esk2_1(X2))|~environment(X2))). % 0.10/0.39 cnf(i_0_1, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~greater(growth_rate(efficient_producers,esk1_2(X2,X1)),growth_rate(first_movers,esk1_2(X2,X1)))|~environment(X2))). % 0.10/0.39 cnf(i_0_3, hypothesis, (X1=critical_point(X2)|subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X1))|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_201, plain, (X11=X11)). % 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 6 steps % 0.10/0.39 cnf(i_0_201, plain, (esk3_0=esk3_0), inference(start_rule)). % 0.10/0.39 cnf(i_0_241, plain, (esk3_0=esk3_0), inference(extension_rule, [i_0_205])). % 0.10/0.39 cnf(i_0_277, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_9])). % 0.10/0.39 cnf(i_0_275, plain, (environment(esk3_0)), inference(extension_rule, [i_0_6])). % 0.10/0.39 cnf(i_0_279, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_8])). % 0.10/0.39 cnf(i_0_278, plain, (in_environment(esk3_0,esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_278, ...])). % 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 # SZS status Theorem 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_9, negated_conjecture, (environment(esk3_0))). % 0.10/0.39 cnf(i_0_8, negated_conjecture, (stable(esk3_0))). % 0.10/0.39 cnf(i_0_7, negated_conjecture, (~in_environment(esk3_0,critical_point(esk3_0)))). % 0.10/0.39 cnf(i_0_6, hypothesis, (in_environment(X1,esk2_1(X1))|~stable(X1)|~environment(X1))). % 0.10/0.39 cnf(i_0_5, hypothesis, (~stable(X1)|~greater(growth_rate(efficient_producers,esk2_1(X1)),growth_rate(first_movers,esk2_1(X1)))|~environment(X1))). % 0.10/0.39 cnf(i_0_2, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|greater(esk1_2(X2,X1),X1)|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_4, hypothesis, (greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~stable(X2)|~subpopulations(first_movers,efficient_producers,X2,X1)|~greater(X1,esk2_1(X2))|~environment(X2))). % 0.10/0.39 cnf(i_0_1, hypothesis, (X1=critical_point(X2)|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~greater(growth_rate(efficient_producers,esk1_2(X2,X1)),growth_rate(first_movers,esk1_2(X2,X1)))|~environment(X2))). % 0.10/0.39 cnf(i_0_3, hypothesis, (X1=critical_point(X2)|subpopulations(first_movers,efficient_producers,X2,esk1_2(X2,X1))|greater(growth_rate(efficient_producers,X1),growth_rate(first_movers,X1))|~in_environment(X2,X1)|~environment(X2))). % 0.10/0.39 cnf(i_0_117, plain, (X11=X11)). % 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 6 steps % 0.10/0.39 cnf(i_0_117, plain, (esk3_0=esk3_0), inference(start_rule)). % 0.10/0.39 cnf(i_0_157, plain, (esk3_0=esk3_0), inference(extension_rule, [i_0_121])). % 0.10/0.39 cnf(i_0_193, plain, (~environment(esk3_0)), inference(closure_rule, [i_0_9])). % 0.10/0.39 cnf(i_0_191, plain, (environment(esk3_0)), inference(extension_rule, [i_0_6])). % 0.10/0.39 cnf(i_0_195, plain, (~stable(esk3_0)), inference(closure_rule, [i_0_8])). % 0.10/0.39 cnf(i_0_194, plain, (in_environment(esk3_0,esk2_1(esk3_0))), inference(etableau_closure_rule, [i_0_194, ...])). % 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 # Child (3120243) has found a proof. % 0.10/0.39 % 0.10/0.39 # Creating equality axioms % 0.10/0.39 # Ran out of tableaux, making start rules for all clauses % 0.10/0.39 # Proof search is over... % 0.10/0.39 # Freeing feature tree %------------------------------------------------------------------------------