%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : MGT002-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 : n004.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:42 AM UTC 2026 % Result : Unsatisfiable 0.12s 0.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : MGT002-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.07/0.34 % Computer : n004.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Mon Sep 7 11:34:00 UTC 2026 % 0.07/0.35 % CPUTime : % 0.12/0.38 # No SInE strategy applied % 0.12/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.38 # % 0.12/0.38 # Presaturation interreduction done % 0.12/0.38 # Number of axioms: 13 Number of unprocessed: 13 % 0.12/0.38 # Tableaux proof search. % 0.12/0.38 # APR header successfully linked. % 0.12/0.38 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 13 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 7 conjectures. % 0.12/0.38 # There are 7 start rule candidates: % 0.12/0.38 # Found 7 unit axioms. % 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.38 # 7 start rule tableaux created. % 0.12/0.38 # 6 extension rule candidate clauses % 0.12/0.38 # 7 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 7 % 0.12/0.38 # Returning from population with 15 new_tableaux and 0 remaining starting tableaux. % 0.12/0.38 # We now have 15 tableaux to operate on % 0.12/0.39 # There were 3 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 3 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 3 successful branch saturations after the branch. % 0.12/0.39 # There were 6 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 6 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 6 successful branch saturations after the branch. % 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_20, negated_conjecture, (organization(sk2,sk5))). % 0.12/0.39 cnf(i_0_21, negated_conjecture, (organization(sk2,sk6))). % 0.12/0.39 cnf(i_0_25, negated_conjecture, (greater(sk6,sk5))). % 0.12/0.39 cnf(i_0_22, negated_conjecture, (reorganization_free(sk2,sk5,sk6))). % 0.12/0.39 cnf(i_0_23, negated_conjecture, (inertia(sk2,sk3,sk5))). % 0.12/0.39 cnf(i_0_24, negated_conjecture, (inertia(sk2,sk4,sk6))). % 0.12/0.39 cnf(i_0_26, negated_conjecture, (~greater(sk4,sk3))). % 0.12/0.39 cnf(i_0_16, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X3,X2))). % 0.12/0.39 cnf(i_0_15, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X2,X3))). % 0.12/0.39 cnf(i_0_14, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))). % 0.12/0.39 cnf(i_0_19, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reorganization_free(X5,X4,X3)|~reproducibility(X5,X1,X3)|~reproducibility(X5,X2,X4)|~organization(X5,X3)|~organization(X5,X4))). % 0.12/0.39 cnf(i_0_17, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.12/0.39 cnf(i_0_18, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X3,X6)|~inertia(X7,X4,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X1,X6)|~reproducibility(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 14 steps % 0.12/0.39 cnf(i_0_25, negated_conjecture, (greater(sk6,sk5)), inference(start_rule)). % 0.12/0.39 cnf(i_0_31, plain, (greater(sk6,sk5)), inference(extension_rule, [i_0_17])). % 0.12/0.39 cnf(i_0_317, plain, (greater(sk4,sk3)), inference(closure_rule, [i_0_26])). % 0.12/0.39 cnf(i_0_319, plain, (~inertia(sk2,sk4,sk6)), inference(closure_rule, [i_0_24])). % 0.12/0.39 cnf(i_0_320, plain, (~inertia(sk2,sk3,sk5)), inference(closure_rule, [i_0_23])). % 0.12/0.39 cnf(i_0_325, plain, (~organization(sk2,sk6)), inference(closure_rule, [i_0_21])). % 0.12/0.39 cnf(i_0_326, plain, (~organization(sk2,sk5)), inference(closure_rule, [i_0_20])). % 0.12/0.39 cnf(i_0_321, plain, (~reorganization_free(sk2,sk6,sk6)), inference(extension_rule, [i_0_16])). % 0.12/0.39 cnf(i_0_328, plain, (~reorganization_free(sk2,sk5,sk6)), inference(closure_rule, [i_0_22])). % 0.12/0.39 cnf(i_0_322, plain, (~reorganization_free(sk2,sk5,sk5)), inference(extension_rule, [i_0_15])). % 0.12/0.39 cnf(i_0_330, plain, (~reorganization_free(sk2,sk5,sk5)), inference(extension_rule, [i_0_16])). % 0.12/0.39 cnf(i_0_323, plain, (~reproducibility(sk2,sk6,sk6)), inference(etableau_closure_rule, [i_0_323, ...])). % 0.12/0.39 cnf(i_0_324, plain, (~reproducibility(sk2,sk5,sk5)), inference(etableau_closure_rule, [i_0_324, ...])). % 0.12/0.39 cnf(i_0_394, plain, (~reorganization_free(sk2,X7,sk5)), inference(etableau_closure_rule, [i_0_394, ...])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_20, negated_conjecture, (organization(sk2,sk5))). % 0.12/0.39 cnf(i_0_21, negated_conjecture, (organization(sk2,sk6))). % 0.12/0.39 cnf(i_0_25, negated_conjecture, (greater(sk6,sk5))). % 0.12/0.39 cnf(i_0_22, negated_conjecture, (reorganization_free(sk2,sk5,sk6))). % 0.12/0.39 cnf(i_0_23, negated_conjecture, (inertia(sk2,sk3,sk5))). % 0.12/0.39 cnf(i_0_24, negated_conjecture, (inertia(sk2,sk4,sk6))). % 0.12/0.39 cnf(i_0_26, negated_conjecture, (~greater(sk4,sk3))). % 0.12/0.39 cnf(i_0_16, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X3,X2))). % 0.12/0.39 cnf(i_0_15, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X2,X3))). % 0.12/0.39 cnf(i_0_14, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))). % 0.12/0.39 cnf(i_0_19, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reorganization_free(X5,X4,X3)|~reproducibility(X5,X1,X3)|~reproducibility(X5,X2,X4)|~organization(X5,X3)|~organization(X5,X4))). % 0.12/0.39 cnf(i_0_17, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.12/0.39 cnf(i_0_18, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X3,X6)|~inertia(X7,X4,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X1,X6)|~reproducibility(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 17 steps % 0.12/0.39 cnf(i_0_23, negated_conjecture, (inertia(sk2,sk3,sk5)), inference(start_rule)). % 0.12/0.39 cnf(i_0_29, plain, (inertia(sk2,sk3,sk5)), inference(extension_rule, [i_0_18])). % 0.12/0.39 cnf(i_0_123, plain, (greater(sk4,sk3)), inference(closure_rule, [i_0_26])). % 0.12/0.39 cnf(i_0_125, plain, (~inertia(sk2,sk4,sk6)), inference(closure_rule, [i_0_24])). % 0.12/0.39 cnf(i_0_131, plain, (~organization(sk2,sk6)), inference(closure_rule, [i_0_21])). % 0.12/0.39 cnf(i_0_132, plain, (~organization(sk2,sk5)), inference(closure_rule, [i_0_20])). % 0.12/0.39 cnf(i_0_124, plain, (~greater(sk4,sk3)), inference(extension_rule, [i_0_19])). % 0.12/0.39 cnf(i_0_140, plain, (~greater(sk6,sk5)), inference(closure_rule, [i_0_25])). % 0.12/0.39 cnf(i_0_141, plain, (~reorganization_free(sk2,sk5,sk6)), inference(closure_rule, [i_0_22])). % 0.12/0.39 cnf(i_0_144, plain, (~organization(sk2,sk6)), inference(closure_rule, [i_0_21])). % 0.12/0.39 cnf(i_0_145, plain, (~organization(sk2,sk5)), inference(closure_rule, [i_0_20])). % 0.12/0.39 cnf(i_0_127, plain, (~reorganization_free(sk2,sk6,sk6)), inference(etableau_closure_rule, [i_0_127, ...])). % 0.12/0.39 cnf(i_0_128, plain, (~reorganization_free(sk2,sk5,sk5)), inference(etableau_closure_rule, [i_0_128, ...])). % 0.12/0.39 cnf(i_0_129, plain, (~reproducibility(sk2,sk4,sk6)), inference(etableau_closure_rule, [i_0_129, ...])). % 0.12/0.39 cnf(i_0_130, plain, (~reproducibility(sk2,sk3,sk5)), inference(etableau_closure_rule, [i_0_130, ...])). % 0.12/0.39 cnf(i_0_142, plain, (~reproducibility(sk2,sk4,sk6)), inference(etableau_closure_rule, [i_0_142, ...])). % 0.12/0.39 cnf(i_0_143, plain, (~reproducibility(sk2,sk3,sk5)), inference(etableau_closure_rule, [i_0_143, ...])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # There were 3 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 3 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 3 successful branch saturations after the branch. % 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_20, negated_conjecture, (organization(sk2,sk5))). % 0.12/0.39 cnf(i_0_21, negated_conjecture, (organization(sk2,sk6))). % 0.12/0.39 cnf(i_0_25, negated_conjecture, (greater(sk6,sk5))). % 0.12/0.39 cnf(i_0_22, negated_conjecture, (reorganization_free(sk2,sk5,sk6))). % 0.12/0.39 cnf(i_0_23, negated_conjecture, (inertia(sk2,sk3,sk5))). % 0.12/0.39 cnf(i_0_24, negated_conjecture, (inertia(sk2,sk4,sk6))). % 0.12/0.39 cnf(i_0_26, negated_conjecture, (~greater(sk4,sk3))). % 0.12/0.39 cnf(i_0_16, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X3,X2))). % 0.12/0.39 cnf(i_0_15, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X2,X3))). % 0.12/0.39 cnf(i_0_14, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))). % 0.12/0.39 cnf(i_0_19, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reorganization_free(X5,X4,X3)|~reproducibility(X5,X1,X3)|~reproducibility(X5,X2,X4)|~organization(X5,X3)|~organization(X5,X4))). % 0.12/0.39 cnf(i_0_17, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.12/0.39 cnf(i_0_18, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X3,X6)|~inertia(X7,X4,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X1,X6)|~reproducibility(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 14 steps % 0.12/0.39 cnf(i_0_21, negated_conjecture, (organization(sk2,sk6)), inference(start_rule)). % 0.12/0.39 cnf(i_0_32, plain, (organization(sk2,sk6)), inference(extension_rule, [i_0_17])). % 0.12/0.39 cnf(i_0_352, plain, (greater(sk4,sk3)), inference(closure_rule, [i_0_26])). % 0.12/0.39 cnf(i_0_353, plain, (~greater(sk6,sk5)), inference(closure_rule, [i_0_25])). % 0.12/0.39 cnf(i_0_354, plain, (~inertia(sk2,sk4,sk6)), inference(closure_rule, [i_0_24])). % 0.12/0.39 cnf(i_0_355, plain, (~inertia(sk2,sk3,sk5)), inference(closure_rule, [i_0_23])). % 0.12/0.39 cnf(i_0_361, plain, (~organization(sk2,sk5)), inference(closure_rule, [i_0_20])). % 0.12/0.39 cnf(i_0_356, plain, (~reorganization_free(sk2,sk6,sk6)), inference(extension_rule, [i_0_16])). % 0.12/0.39 cnf(i_0_363, plain, (~reorganization_free(sk2,sk5,sk6)), inference(closure_rule, [i_0_22])). % 0.12/0.39 cnf(i_0_357, plain, (~reorganization_free(sk2,sk5,sk5)), inference(extension_rule, [i_0_15])). % 0.12/0.39 cnf(i_0_365, plain, (~reorganization_free(sk2,sk5,sk5)), inference(extension_rule, [i_0_16])). % 0.12/0.39 cnf(i_0_358, plain, (~reproducibility(sk2,sk6,sk6)), inference(etableau_closure_rule, [i_0_358, ...])). % 0.12/0.39 cnf(i_0_359, plain, (~reproducibility(sk2,sk5,sk5)), inference(etableau_closure_rule, [i_0_359, ...])). % 0.12/0.39 cnf(i_0_429, plain, (~reorganization_free(sk2,X7,sk5)), inference(etableau_closure_rule, [i_0_429, ...])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # There were 3 total branch saturation attempts. % 0.12/0.39 # There were 0 of these attempts blocked. % 0.12/0.39 # There were 0 deferred branch saturation attempts. % 0.12/0.39 # There were 0 free duplicated saturations. % 0.12/0.39 # There were 3 total successful branch saturations. % 0.12/0.39 # There were 0 successful branch saturations in interreduction. % 0.12/0.39 # There were 0 successful branch saturations on the branch. % 0.12/0.39 # There were 3 successful branch saturations after the branch. % 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.39 # Begin clausification derivation % 0.12/0.39 % 0.12/0.39 # End clausification derivation % 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.39 cnf(i_0_20, negated_conjecture, (organization(sk2,sk5))). % 0.12/0.39 cnf(i_0_21, negated_conjecture, (organization(sk2,sk6))). % 0.12/0.39 cnf(i_0_25, negated_conjecture, (greater(sk6,sk5))). % 0.12/0.39 cnf(i_0_22, negated_conjecture, (reorganization_free(sk2,sk5,sk6))). % 0.12/0.39 cnf(i_0_23, negated_conjecture, (inertia(sk2,sk3,sk5))). % 0.12/0.39 cnf(i_0_24, negated_conjecture, (inertia(sk2,sk4,sk6))). % 0.12/0.39 cnf(i_0_26, negated_conjecture, (~greater(sk4,sk3))). % 0.12/0.39 cnf(i_0_16, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X3,X2))). % 0.12/0.39 cnf(i_0_15, plain, (reorganization_free(X1,X2,X2)|~reorganization_free(X1,X2,X3))). % 0.12/0.39 cnf(i_0_14, plain, (reproducibility(X1,sk1(X2,X1),X2)|~organization(X1,X2))). % 0.12/0.39 cnf(i_0_19, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~reorganization_free(X5,X4,X3)|~reproducibility(X5,X1,X3)|~reproducibility(X5,X2,X4)|~organization(X5,X3)|~organization(X5,X4))). % 0.12/0.39 cnf(i_0_17, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X1,X6)|~inertia(X7,X2,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X3,X6)|~reproducibility(X7,X4,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.12/0.39 cnf(i_0_18, hypothesis, (greater(X1,X2)|~greater(X3,X4)|~inertia(X5,X3,X6)|~inertia(X7,X4,X8)|~reorganization_free(X5,X6,X6)|~reorganization_free(X7,X8,X8)|~reproducibility(X5,X1,X6)|~reproducibility(X7,X2,X8)|~organization(X5,X6)|~organization(X7,X8))). % 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.39 # Begin printing tableau % 0.12/0.39 # Found 9 steps % 0.12/0.39 cnf(i_0_22, negated_conjecture, (reorganization_free(sk2,sk5,sk6)), inference(start_rule)). % 0.12/0.39 cnf(i_0_30, plain, (reorganization_free(sk2,sk5,sk6)), inference(extension_rule, [i_0_16])). % 0.12/0.39 cnf(i_0_133, plain, (reorganization_free(sk2,sk6,sk6)), inference(extension_rule, [i_0_19])). % 0.12/0.39 cnf(i_0_139, plain, (greater(sk4,sk3)), inference(closure_rule, [i_0_26])). % 0.12/0.39 cnf(i_0_144, plain, (~organization(sk2,sk6)), inference(closure_rule, [i_0_21])). % 0.12/0.39 cnf(i_0_145, plain, (~organization(sk2,sk6)), inference(closure_rule, [i_0_21])). % 0.12/0.39 cnf(i_0_140, plain, (~greater(sk6,sk6)), inference(etableau_closure_rule, [i_0_140, ...])). % 0.12/0.39 cnf(i_0_142, plain, (~reproducibility(sk2,sk4,sk6)), inference(etableau_closure_rule, [i_0_142, ...])). % 0.12/0.39 cnf(i_0_143, plain, (~reproducibility(sk2,sk3,sk6)), inference(etableau_closure_rule, [i_0_143, ...])). % 0.12/0.39 # End printing tableau % 0.12/0.39 # SZS output end % 0.12/0.39 # Branches closed with saturation will be marked with an "s" % 0.12/0.39 # Child (3307455) has found a proof. % 0.12/0.39 % 0.12/0.40 # Proof search is over... % 0.12/0.40 # Freeing feature tree %------------------------------------------------------------------------------