%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX204+1 : TPTP v9.3.0. Released v9.3.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 : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Tue May 5 07:00:43 PM UTC 2026 % Result : Theorem 0.20s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX204+1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.33 % Computer : n007.cluster.edu % 0.15/0.33 % Model : x86_64 x86_64 % 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.33 % Memory : 8042.1875MB % 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.33 % CPULimit : 300 % 0.15/0.33 % WCLimit : 300 % 0.15/0.33 % DateTime : Tue May 5 11:27:23 EDT 2026 % 0.15/0.34 % CPUTime : % 0.20/0.36 # No SInE strategy applied % 0.20/0.36 # Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.36 # % 0.20/0.36 # Presaturation interreduction done % 0.20/0.36 # Number of axioms: 7 Number of unprocessed: 7 % 0.20/0.36 # Tableaux proof search. % 0.20/0.36 # APR header successfully linked. % 0.20/0.36 # Hello from C++ % 0.20/0.36 # The folding up rule is enabled... % 0.20/0.36 # Local unification is enabled... % 0.20/0.36 # Any saturation attempts will use folding labels... % 0.20/0.36 # 7 beginning clauses after preprocessing and clausification % 0.20/0.36 # Creating start rules for all 1 conjectures. % 0.20/0.36 # There are 1 start rule candidates: % 0.20/0.36 # Found 7 unit axioms. % 0.20/0.36 # 1 start rule tableaux created. % 0.20/0.36 # 0 extension rule candidate clauses % 0.20/0.36 # 7 unit axiom clauses % 0.20/0.36 % 0.20/0.36 # Requested 8, 32 cores available to the main process. % 0.20/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.36 # Creating equality axioms % 0.20/0.36 # Ran out of tableaux, making start rules for all clauses % 0.20/0.36 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux. % 0.20/0.36 # We now have 14 tableaux to operate on % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(X1))=X1)). % 0.20/0.37 cnf(i_0_5, plain, (x22(z,X1)=z)). % 0.20/0.37 cnf(i_0_3, plain, (x2(z,X1)=X1)). % 0.20/0.37 cnf(i_0_7, negated_conjecture, (x22(X1,X1)=X1)). % 0.20/0.37 cnf(i_0_4, plain, (x2(s(X1),X2)=s(x2(X1,X2)))). % 0.20/0.37 cnf(i_0_6, plain, (x22(s(X1),X2)=x2(X2,x22(X1,X2)))). % 0.20/0.37 cnf(i_0_2, plain, (s(X1)!=z)). % 0.20/0.37 cnf(i_0_9, plain, (X13=X13)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 6 steps % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(X5))=X5), inference(start_rule)). % 0.20/0.37 cnf(i_0_17, plain, (proj1S(s(X5))=X5), inference(extension_rule, [i_0_16])). % 0.20/0.37 cnf(i_0_40, plain, (proj1S(s(X3))!=X3), inference(closure_rule, [i_0_1])). % 0.20/0.37 cnf(i_0_39, plain, (x22(proj1S(s(X3)),proj1S(s(X5)))=x22(X3,X5)), inference(extension_rule, [i_0_12])). % 0.20/0.37 cnf(i_0_48, plain, (x22(X3,X5)!=proj1S(s(x22(X3,X5)))), inference(closure_rule, [i_0_1])). % 0.20/0.37 cnf(i_0_46, plain, (x22(proj1S(s(X3)),proj1S(s(X5)))=proj1S(s(x22(X3,X5)))), inference(etableau_closure_rule, [i_0_46, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(X1))=X1)). % 0.20/0.37 cnf(i_0_5, plain, (x22(z,X1)=z)). % 0.20/0.37 cnf(i_0_3, plain, (x2(z,X1)=X1)). % 0.20/0.37 cnf(i_0_7, negated_conjecture, (x22(X1,X1)=X1)). % 0.20/0.37 cnf(i_0_4, plain, (x2(s(X1),X2)=s(x2(X1,X2)))). % 0.20/0.37 cnf(i_0_6, plain, (x22(s(X1),X2)=x2(X2,x22(X1,X2)))). % 0.20/0.37 cnf(i_0_2, plain, (s(X1)!=z)). % 0.20/0.37 cnf(i_0_9, plain, (X13=X13)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 6 steps % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(X3))=X3), inference(start_rule)). % 0.20/0.37 cnf(i_0_17, plain, (proj1S(s(X3))=X3), inference(extension_rule, [i_0_16])). % 0.20/0.37 cnf(i_0_41, plain, (proj1S(s(X5))!=X5), inference(closure_rule, [i_0_1])). % 0.20/0.37 cnf(i_0_39, plain, (x22(proj1S(s(X3)),proj1S(s(X5)))=x22(X3,X5)), inference(extension_rule, [i_0_12])). % 0.20/0.37 cnf(i_0_48, plain, (x22(X3,X5)!=proj1S(s(x22(X3,X5)))), inference(closure_rule, [i_0_1])). % 0.20/0.37 cnf(i_0_46, plain, (x22(proj1S(s(X3)),proj1S(s(X5)))=proj1S(s(x22(X3,X5)))), inference(etableau_closure_rule, [i_0_46, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(X1))=X1)). % 0.20/0.37 cnf(i_0_5, plain, (x22(z,X1)=z)). % 0.20/0.37 cnf(i_0_3, plain, (x2(z,X1)=X1)). % 0.20/0.37 cnf(i_0_7, negated_conjecture, (x22(X1,X1)=X1)). % 0.20/0.37 cnf(i_0_4, plain, (x2(s(X1),X2)=s(x2(X1,X2)))). % 0.20/0.37 cnf(i_0_6, plain, (x22(s(X1),X2)=x2(X2,x22(X1,X2)))). % 0.20/0.37 cnf(i_0_2, plain, (s(X1)!=z)). % 0.20/0.37 cnf(i_0_9, plain, (X13=X13)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 6 steps % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(X5))=X5), inference(start_rule)). % 0.20/0.37 cnf(i_0_17, plain, (proj1S(s(X5))=X5), inference(extension_rule, [i_0_15])). % 0.20/0.37 cnf(i_0_37, plain, (proj1S(s(X3))!=X3), inference(closure_rule, [i_0_1])). % 0.20/0.37 cnf(i_0_36, plain, (x2(proj1S(s(X3)),proj1S(s(X5)))=x2(X3,X5)), inference(extension_rule, [i_0_12])). % 0.20/0.37 cnf(i_0_48, plain, (x2(X3,X5)!=proj1S(s(x2(X3,X5)))), inference(closure_rule, [i_0_1])). % 0.20/0.37 cnf(i_0_46, plain, (x2(proj1S(s(X3)),proj1S(s(X5)))=proj1S(s(x2(X3,X5)))), inference(etableau_closure_rule, [i_0_46, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(X1))=X1)). % 0.20/0.37 cnf(i_0_5, plain, (x22(z,X1)=z)). % 0.20/0.37 cnf(i_0_3, plain, (x2(z,X1)=X1)). % 0.20/0.37 cnf(i_0_7, negated_conjecture, (x22(X1,X1)=X1)). % 0.20/0.37 cnf(i_0_4, plain, (x2(s(X1),X2)=s(x2(X1,X2)))). % 0.20/0.37 cnf(i_0_6, plain, (x22(s(X1),X2)=x2(X2,x22(X1,X2)))). % 0.20/0.37 cnf(i_0_2, plain, (s(X1)!=z)). % 0.20/0.37 cnf(i_0_9, plain, (X13=X13)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 6 steps % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(X3))=X3), inference(start_rule)). % 0.20/0.37 cnf(i_0_17, plain, (proj1S(s(X3))=X3), inference(extension_rule, [i_0_15])). % 0.20/0.37 cnf(i_0_38, plain, (proj1S(s(X5))!=X5), inference(closure_rule, [i_0_1])). % 0.20/0.37 cnf(i_0_36, plain, (x2(proj1S(s(X3)),proj1S(s(X5)))=x2(X3,X5)), inference(extension_rule, [i_0_12])). % 0.20/0.37 cnf(i_0_48, plain, (x2(X3,X5)!=proj1S(s(x2(X3,X5)))), inference(closure_rule, [i_0_1])). % 0.20/0.37 cnf(i_0_46, plain, (x2(proj1S(s(X3)),proj1S(s(X5)))=proj1S(s(x2(X3,X5)))), inference(etableau_closure_rule, [i_0_46, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.37 # Begin clausification derivation % 0.20/0.37 % 0.20/0.37 # End clausification derivation % 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(X1))=X1)). % 0.20/0.37 cnf(i_0_5, plain, (x22(z,X1)=z)). % 0.20/0.37 cnf(i_0_3, plain, (x2(z,X1)=X1)). % 0.20/0.37 cnf(i_0_7, negated_conjecture, (x22(X1,X1)=X1)). % 0.20/0.37 cnf(i_0_4, plain, (x2(s(X1),X2)=s(x2(X1,X2)))). % 0.20/0.37 cnf(i_0_6, plain, (x22(s(X1),X2)=x2(X2,x22(X1,X2)))). % 0.20/0.37 cnf(i_0_2, plain, (s(X1)!=z)). % 0.20/0.37 cnf(i_0_9, plain, (X13=X13)). % 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.37 # Begin printing tableau % 0.20/0.37 # Found 5 steps % 0.20/0.37 cnf(i_0_1, plain, (proj1S(s(s(X4)))=s(X4)), inference(start_rule)). % 0.20/0.37 cnf(i_0_17, plain, (proj1S(s(s(X4)))=s(X4)), inference(extension_rule, [i_0_14])). % 0.20/0.37 cnf(i_0_34, plain, (proj1S(proj1S(s(s(X4))))=proj1S(s(X4))), inference(extension_rule, [i_0_12])). % 0.20/0.37 cnf(i_0_48, plain, (proj1S(s(X4))!=X4), inference(closure_rule, [i_0_1])). % 0.20/0.37 cnf(i_0_46, plain, (proj1S(proj1S(s(s(X4))))=X4), inference(etableau_closure_rule, [i_0_46, ...])). % 0.20/0.37 # End printing tableau % 0.20/0.37 # SZS output end % 0.20/0.37 # Branches closed with saturation will be marked with an "s" % 0.20/0.37 # There were 1 total branch saturation attempts. % 0.20/0.37 # There were 0 of these attempts blocked. % 0.20/0.37 # There were 0 deferred branch saturation attempts. % 0.20/0.37 # There were 0 free duplicated saturations. % 0.20/0.37 # There were 1 total successful branch saturations. % 0.20/0.37 # There were 0 successful branch saturations in interreduction. % 0.20/0.37 # There were 0 successful branch saturations on the branch. % 0.20/0.37 # There were 1 successful branch saturations after the branch. % 0.20/0.37 # Child (13276) has found a proof. % 0.20/0.37 % 0.20/0.37 # Proof search is over... % 0.20/0.37 # Freeing feature tree %------------------------------------------------------------------------------