%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : KRS174+1 : TPTP v8.1.0. Released v3.1.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 : n024.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 600s % DateTime : Sun Jul 17 03:00:45 EDT 2022 % Result : Theorem 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : KRS174+1 : TPTP v8.1.0. Released v3.1.0. % 0.12/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n024.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jun 7 12:38:49 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA % 0.12/0.37 # and selection function SelectNewComplexAHP. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 16 Number of unprocessed: 16 % 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 # 16 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 6 conjectures. % 0.12/0.37 # There are 6 start rule candidates: % 0.12/0.37 # Found 5 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 6 start rule tableaux created. % 0.12/0.37 # 11 extension rule candidate clauses % 0.12/0.37 # 5 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 6 % 0.12/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux. % 0.12/0.37 # We now have 12 tableaux to operate on % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # Creating equality axioms % 0.12/0.38 # Ran out of tableaux, making start rules for all clauses % 0.12/0.38 # There were 2 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 2 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 2 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_12, plain, (cA(ia))). % 0.12/0.38 cnf(i_0_14, plain, (cA_and_B(ia))). % 0.12/0.38 cnf(i_0_15, plain, (cA_and_B(ib))). % 0.12/0.38 cnf(i_0_17, plain, (cB(ib))). % 0.12/0.38 cnf(i_0_8, plain, (~cowlNothing(X1))). % 0.12/0.38 cnf(i_0_25, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_26, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_22, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.38 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.38 cnf(i_0_13, plain, (X1=ia|~cA(X1))). % 0.12/0.38 cnf(i_0_24, negated_conjecture, (xsd_integer(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_21, negated_conjecture, (xsd_string(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_18, plain, (X1=ib|~cB(X1))). % 0.12/0.38 cnf(i_0_16, plain, (X1=ib|X1=ia|~cA_and_B(X1))). % 0.12/0.38 cnf(i_0_405, plain, (X26=X26)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 8 steps % 0.12/0.38 cnf(i_0_405, plain, (ia=ia), inference(start_rule)). % 0.12/0.38 cnf(i_0_455, plain, (ia=ia), inference(extension_rule, [i_0_409])). % 0.12/0.38 cnf(i_0_500, plain, (~cA(ia)), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_498, plain, (cA(ia)), inference(extension_rule, [i_0_409])). % 0.12/0.38 cnf(i_0_558, plain, (cA(ib)), inference(extension_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_559, plain, (ia!=ib), inference(extension_rule, [i_0_18])). % 0.12/0.38 cnf(i_0_565, plain, (ib=ia), inference(etableau_closure_rule, [i_0_565, ...])). % 0.12/0.38 cnf(i_0_572, plain, (~cB(ia)), inference(etableau_closure_rule, [i_0_572, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 2 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 2 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 2 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_12, plain, (cA(ia))). % 0.12/0.38 cnf(i_0_14, plain, (cA_and_B(ia))). % 0.12/0.38 cnf(i_0_15, plain, (cA_and_B(ib))). % 0.12/0.38 cnf(i_0_17, plain, (cB(ib))). % 0.12/0.38 cnf(i_0_8, plain, (~cowlNothing(X1))). % 0.12/0.38 cnf(i_0_25, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_26, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_22, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.38 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.38 cnf(i_0_13, plain, (X1=ia|~cA(X1))). % 0.12/0.38 cnf(i_0_24, negated_conjecture, (xsd_integer(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_21, negated_conjecture, (xsd_string(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_18, plain, (X1=ib|~cB(X1))). % 0.12/0.38 cnf(i_0_16, plain, (X1=ib|X1=ia|~cA_and_B(X1))). % 0.12/0.38 cnf(i_0_405, plain, (X26=X26)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 8 steps % 0.12/0.38 cnf(i_0_405, plain, (ia=ia), inference(start_rule)). % 0.12/0.38 cnf(i_0_455, plain, (ia=ia), inference(extension_rule, [i_0_409])). % 0.12/0.38 cnf(i_0_500, plain, (~cA(ia)), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_498, plain, (cA(ia)), inference(extension_rule, [i_0_409])). % 0.12/0.38 cnf(i_0_558, plain, (cA(ib)), inference(extension_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_559, plain, (ia!=ib), inference(extension_rule, [i_0_18])). % 0.12/0.38 cnf(i_0_565, plain, (ib=ia), inference(etableau_closure_rule, [i_0_565, ...])). % 0.12/0.38 cnf(i_0_572, plain, (~cB(ia)), inference(etableau_closure_rule, [i_0_572, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 2 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 2 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 2 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_12, plain, (cA(ia))). % 0.12/0.38 cnf(i_0_14, plain, (cA_and_B(ia))). % 0.12/0.38 cnf(i_0_15, plain, (cA_and_B(ib))). % 0.12/0.38 cnf(i_0_17, plain, (cB(ib))). % 0.12/0.38 cnf(i_0_8, plain, (~cowlNothing(X1))). % 0.12/0.38 cnf(i_0_25, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_26, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_22, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.38 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.38 cnf(i_0_13, plain, (X1=ia|~cA(X1))). % 0.12/0.38 cnf(i_0_24, negated_conjecture, (xsd_integer(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_21, negated_conjecture, (xsd_string(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_18, plain, (X1=ib|~cB(X1))). % 0.12/0.38 cnf(i_0_16, plain, (X1=ib|X1=ia|~cA_and_B(X1))). % 0.12/0.38 cnf(i_0_405, plain, (X26=X26)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 8 steps % 0.12/0.38 cnf(i_0_405, plain, (ia=ia), inference(start_rule)). % 0.12/0.38 cnf(i_0_455, plain, (ia=ia), inference(extension_rule, [i_0_409])). % 0.12/0.38 cnf(i_0_500, plain, (~cA(ia)), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_498, plain, (cA(ia)), inference(extension_rule, [i_0_409])). % 0.12/0.38 cnf(i_0_558, plain, (cA(ib)), inference(extension_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_559, plain, (ia!=ib), inference(extension_rule, [i_0_18])). % 0.12/0.38 cnf(i_0_565, plain, (ib=ia), inference(etableau_closure_rule, [i_0_565, ...])). % 0.12/0.38 cnf(i_0_572, plain, (~cB(ia)), inference(etableau_closure_rule, [i_0_572, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 2 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 2 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 2 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_12, plain, (cA(ia))). % 0.12/0.38 cnf(i_0_14, plain, (cA_and_B(ia))). % 0.12/0.38 cnf(i_0_15, plain, (cA_and_B(ib))). % 0.12/0.38 cnf(i_0_17, plain, (cB(ib))). % 0.12/0.38 cnf(i_0_8, plain, (~cowlNothing(X1))). % 0.12/0.38 cnf(i_0_25, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_26, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_22, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.38 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.38 cnf(i_0_13, plain, (X1=ia|~cA(X1))). % 0.12/0.38 cnf(i_0_24, negated_conjecture, (xsd_integer(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_21, negated_conjecture, (xsd_string(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_18, plain, (X1=ib|~cB(X1))). % 0.12/0.38 cnf(i_0_16, plain, (X1=ib|X1=ia|~cA_and_B(X1))). % 0.12/0.38 cnf(i_0_370, plain, (X26=X26)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 8 steps % 0.12/0.38 cnf(i_0_370, plain, (ia=ia), inference(start_rule)). % 0.12/0.38 cnf(i_0_420, plain, (ia=ia), inference(extension_rule, [i_0_374])). % 0.12/0.38 cnf(i_0_465, plain, (~cA(ia)), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_463, plain, (cA(ia)), inference(extension_rule, [i_0_374])). % 0.12/0.38 cnf(i_0_523, plain, (cA(ib)), inference(extension_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_524, plain, (ia!=ib), inference(extension_rule, [i_0_18])). % 0.12/0.38 cnf(i_0_530, plain, (ib=ia), inference(etableau_closure_rule, [i_0_530, ...])). % 0.12/0.38 cnf(i_0_537, plain, (~cB(ia)), inference(etableau_closure_rule, [i_0_537, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # There were 2 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 2 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 2 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_12, plain, (cA(ia))). % 0.12/0.38 cnf(i_0_14, plain, (cA_and_B(ia))). % 0.12/0.38 cnf(i_0_15, plain, (cA_and_B(ib))). % 0.12/0.38 cnf(i_0_17, plain, (cB(ib))). % 0.12/0.38 cnf(i_0_8, plain, (~cowlNothing(X1))). % 0.12/0.38 cnf(i_0_25, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_26, negated_conjecture, (xsd_integer(esk2_0)|~xsd_string(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_22, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cA_and_B(esk3_0)|~cA(esk3_0))). % 0.12/0.38 cnf(i_0_23, negated_conjecture, (xsd_string(esk2_0)|~xsd_integer(esk2_0)|~cB(esk3_0)|~cA_and_B(esk3_0))). % 0.12/0.38 cnf(i_0_10, plain, (xsd_string(X1)|xsd_integer(X1))). % 0.12/0.38 cnf(i_0_11, plain, (~xsd_string(X1)|~xsd_integer(X1))). % 0.12/0.38 cnf(i_0_13, plain, (X1=ia|~cA(X1))). % 0.12/0.38 cnf(i_0_24, negated_conjecture, (xsd_integer(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_21, negated_conjecture, (xsd_string(esk2_0)|cB(esk3_0)|cA_and_B(esk3_0)|cA(esk3_0))). % 0.12/0.38 cnf(i_0_18, plain, (X1=ib|~cB(X1))). % 0.12/0.38 cnf(i_0_16, plain, (X1=ib|X1=ia|~cA_and_B(X1))). % 0.12/0.38 cnf(i_0_370, plain, (X26=X26)). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 8 steps % 0.12/0.38 cnf(i_0_370, plain, (ia=ia), inference(start_rule)). % 0.12/0.38 cnf(i_0_420, plain, (ia=ia), inference(extension_rule, [i_0_374])). % 0.12/0.38 cnf(i_0_465, plain, (~cA(ia)), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_463, plain, (cA(ia)), inference(extension_rule, [i_0_374])). % 0.12/0.38 cnf(i_0_523, plain, (cA(ib)), inference(extension_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_524, plain, (ia!=ib), inference(extension_rule, [i_0_18])). % 0.12/0.38 cnf(i_0_530, plain, (ib=ia), inference(etableau_closure_rule, [i_0_530, ...])). % 0.12/0.38 cnf(i_0_537, plain, (~cB(ia)), inference(etableau_closure_rule, [i_0_537, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Child (21762) has found a proof. % 0.12/0.38 % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------