%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX205-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 : 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 : 300s % DateTime : Tue May 5 07:00:43 PM UTC 2026 % Result : Satisfiable 0.06s 0.26s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.06 % Problem : SWX205-1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.06 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.06/0.24 % Computer : n024.cluster.edu % 0.06/0.24 % Model : x86_64 x86_64 % 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.06/0.24 % Memory : 8042.1875MB % 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64 % 0.06/0.24 % CPULimit : 300 % 0.06/0.24 % WCLimit : 300 % 0.06/0.24 % DateTime : Tue May 5 06:31:56 EDT 2026 % 0.06/0.24 % CPUTime : % 0.06/0.26 # No SInE strategy applied % 0.06/0.26 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S % 0.06/0.26 # and selection function SelectNewComplexAHP. % 0.06/0.26 # % 0.06/0.26 # Presaturation interreduction done % 0.06/0.26 # Number of axioms: 11 Number of unprocessed: 11 % 0.06/0.26 # Tableaux proof search. % 0.06/0.26 # APR header successfully linked. % 0.06/0.26 # Hello from C++ % 0.06/0.26 # The folding up rule is enabled... % 0.06/0.26 # Local unification is enabled... % 0.06/0.26 # Any saturation attempts will use folding labels... % 0.06/0.26 # 11 beginning clauses after preprocessing and clausification % 0.06/0.26 # Creating start rules for all 1 conjectures. % 0.06/0.26 # There are 1 start rule candidates: % 0.06/0.26 # Found 11 unit axioms. % 0.06/0.26 # 1 start rule tableaux created. % 0.06/0.26 # 0 extension rule candidate clauses % 0.06/0.26 # 11 unit axiom clauses % 0.06/0.26 % 0.06/0.26 # Requested 8, 32 cores available to the main process. % 0.06/0.26 # There are not enough tableaux to fork, creating more from the initial 1 % 0.06/0.26 # Creating equality axioms % 0.06/0.26 # Ran out of tableaux, making start rules for all clauses % 0.06/0.26 # Returning from population with 21 new_tableaux and 0 remaining starting tableaux. % 0.06/0.26 # We now have 21 tableaux to operate on % 0.06/0.26 # 31156 Satisfiable branch % 0.06/0.26 # 31158 Satisfiable branch % 0.06/0.26 # 31157 Satisfiable branch % 0.06/0.26 # Satisfiable branch found. % 0.06/0.26 # 31159 Satisfiable branch % 0.06/0.26 # There were 1 total branch saturation attempts. % 0.06/0.26 # There were 0 of these attempts blocked. % 0.06/0.26 # There were 0 deferred branch saturation attempts. % 0.06/0.26 # There were 0 free duplicated saturations. % 0.06/0.26 # There were 0 total successful branch saturations. % 0.06/0.26 # There were 0 successful branch saturations in interreduction. % 0.06/0.26 # There were 0 successful branch saturations on the branch. % 0.06/0.26 # There were 0 successful branch saturations after the branch. % 0.06/0.26 # 31160 Satisfiable branch % 0.06/0.26 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # Begin clausification derivation % 0.06/0.26 % 0.06/0.26 # End clausification derivation % 0.06/0.26 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse)). % 0.06/0.26 cnf(i_0_15, plain, (eq2(bfalse,btrue)=bfalse)). % 0.06/0.26 cnf(i_0_13, plain, (impl(bfalse,X1)=btrue)). % 0.06/0.26 cnf(i_0_12, plain, (impl(btrue,X1)=X1)). % 0.06/0.26 cnf(i_0_20, plain, (eq(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_21, plain, (eq2(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_18, plain, (eq(z,s(X1))=bfalse)). % 0.06/0.26 cnf(i_0_19, plain, (eq(s(X1),z)=bfalse)). % 0.06/0.26 cnf(i_0_17, plain, (eq(s(X1),s(X2))=eq(X1,X2))). % 0.06/0.26 cnf(i_0_14, plain, (impl(eq(s(X1),X1),bfalse)=plus_ninf(X1))). % 0.06/0.26 cnf(i_0_22, negated_conjecture, (eq2(plus_ninf(X1),bfalse)!=btrue)). % 0.06/0.26 cnf(i_0_24, plain, (X3=X3)). % 0.06/0.26 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.26 # Begin printing tableau % 0.06/0.26 # Found 5 steps % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)). % 0.06/0.26 cnf(i_0_33, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_32])). % 0.06/0.26 cnf(i_0_63, plain, (eq2(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_16])). % 0.06/0.26 cnf(i_0_62, plain, (eq2(eq2(btrue,bfalse),eq2(btrue,bfalse))=eq2(bfalse,bfalse)), inference(extension_rule, [i_0_27])). % 0.06/0.26 cnf(i_0_71, plain, (eq2(bfalse,bfalse)!=impl(btrue,eq2(bfalse,bfalse))), inference(closure_rule, [i_0_12])). % 0.06/0.26 # End printing tableau % 0.06/0.26 # SZS output end % 0.06/0.26 # Branches closed with saturation will be marked with an "s" % 0.06/0.26 # Satisfiable branch found. % 0.06/0.26 # There were 1 total branch saturation attempts. % 0.06/0.26 # There were 0 of these attempts blocked. % 0.06/0.26 # There were 0 deferred branch saturation attempts. % 0.06/0.26 # There were 0 free duplicated saturations. % 0.06/0.26 # There were 0 total successful branch saturations. % 0.06/0.26 # There were 0 successful branch saturations in interreduction. % 0.06/0.26 # There were 0 successful branch saturations on the branch. % 0.06/0.26 # There were 0 successful branch saturations after the branch. % 0.06/0.26 # Satisfiable branch found. % 0.06/0.26 # There were 1 total branch saturation attempts. % 0.06/0.26 # There were 0 of these attempts blocked. % 0.06/0.26 # There were 0 deferred branch saturation attempts. % 0.06/0.26 # There were 0 free duplicated saturations. % 0.06/0.26 # There were 0 total successful branch saturations. % 0.06/0.26 # There were 0 successful branch saturations in interreduction. % 0.06/0.26 # There were 0 successful branch saturations on the branch. % 0.06/0.26 # There were 0 successful branch saturations after the branch. % 0.06/0.26 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # Begin clausification derivation % 0.06/0.26 % 0.06/0.26 # End clausification derivation % 0.06/0.26 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse)). % 0.06/0.26 cnf(i_0_15, plain, (eq2(bfalse,btrue)=bfalse)). % 0.06/0.26 cnf(i_0_13, plain, (impl(bfalse,X1)=btrue)). % 0.06/0.26 cnf(i_0_12, plain, (impl(btrue,X1)=X1)). % 0.06/0.26 cnf(i_0_20, plain, (eq(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_21, plain, (eq2(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_18, plain, (eq(z,s(X1))=bfalse)). % 0.06/0.26 cnf(i_0_19, plain, (eq(s(X1),z)=bfalse)). % 0.06/0.26 cnf(i_0_17, plain, (eq(s(X1),s(X2))=eq(X1,X2))). % 0.06/0.26 cnf(i_0_14, plain, (impl(eq(s(X1),X1),bfalse)=plus_ninf(X1))). % 0.06/0.26 cnf(i_0_22, negated_conjecture, (eq2(plus_ninf(X1),bfalse)!=btrue)). % 0.06/0.26 cnf(i_0_24, plain, (X3=X3)). % 0.06/0.26 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.26 # Begin printing tableau % 0.06/0.26 # Found 5 steps % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)). % 0.06/0.26 cnf(i_0_33, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_32])). % 0.06/0.26 cnf(i_0_64, plain, (eq2(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_16])). % 0.06/0.26 cnf(i_0_62, plain, (eq2(eq2(btrue,bfalse),eq2(btrue,bfalse))=eq2(bfalse,bfalse)), inference(extension_rule, [i_0_27])). % 0.06/0.26 cnf(i_0_71, plain, (eq2(bfalse,bfalse)!=impl(btrue,eq2(bfalse,bfalse))), inference(closure_rule, [i_0_12])). % 0.06/0.26 # End printing tableau % 0.06/0.26 # SZS output end % 0.06/0.26 # Branches closed with saturation will be marked with an "s" % 0.06/0.26 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # Begin clausification derivation % 0.06/0.26 % 0.06/0.26 # End clausification derivation % 0.06/0.26 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse)). % 0.06/0.26 cnf(i_0_15, plain, (eq2(bfalse,btrue)=bfalse)). % 0.06/0.26 cnf(i_0_13, plain, (impl(bfalse,X1)=btrue)). % 0.06/0.26 cnf(i_0_12, plain, (impl(btrue,X1)=X1)). % 0.06/0.26 cnf(i_0_20, plain, (eq(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_21, plain, (eq2(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_18, plain, (eq(z,s(X1))=bfalse)). % 0.06/0.26 cnf(i_0_19, plain, (eq(s(X1),z)=bfalse)). % 0.06/0.26 cnf(i_0_17, plain, (eq(s(X1),s(X2))=eq(X1,X2))). % 0.06/0.26 cnf(i_0_14, plain, (impl(eq(s(X1),X1),bfalse)=plus_ninf(X1))). % 0.06/0.26 cnf(i_0_22, negated_conjecture, (eq2(plus_ninf(X1),bfalse)!=btrue)). % 0.06/0.26 cnf(i_0_24, plain, (X3=X3)). % 0.06/0.26 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.26 # Begin printing tableau % 0.06/0.26 # Found 5 steps % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)). % 0.06/0.26 cnf(i_0_33, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_31])). % 0.06/0.26 cnf(i_0_60, plain, (eq2(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_16])). % 0.06/0.26 cnf(i_0_59, plain, (eq(eq2(btrue,bfalse),eq2(btrue,bfalse))=eq(bfalse,bfalse)), inference(extension_rule, [i_0_27])). % 0.06/0.26 cnf(i_0_71, plain, (eq(bfalse,bfalse)!=impl(btrue,eq(bfalse,bfalse))), inference(closure_rule, [i_0_12])). % 0.06/0.26 # End printing tableau % 0.06/0.26 # SZS output end % 0.06/0.26 # Branches closed with saturation will be marked with an "s" % 0.06/0.26 # 31161 Satisfiable branch % 0.06/0.26 # Satisfiable branch found. % 0.06/0.26 # There were 1 total branch saturation attempts. % 0.06/0.26 # There were 0 of these attempts blocked. % 0.06/0.26 # There were 0 deferred branch saturation attempts. % 0.06/0.26 # There were 0 free duplicated saturations. % 0.06/0.26 # There were 0 total successful branch saturations. % 0.06/0.26 # There were 0 successful branch saturations in interreduction. % 0.06/0.26 # There were 0 successful branch saturations on the branch. % 0.06/0.26 # There were 0 successful branch saturations after the branch. % 0.06/0.26 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # Begin clausification derivation % 0.06/0.26 % 0.06/0.26 # End clausification derivation % 0.06/0.26 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse)). % 0.06/0.26 cnf(i_0_15, plain, (eq2(bfalse,btrue)=bfalse)). % 0.06/0.26 cnf(i_0_13, plain, (impl(bfalse,X1)=btrue)). % 0.06/0.26 cnf(i_0_12, plain, (impl(btrue,X1)=X1)). % 0.06/0.26 cnf(i_0_20, plain, (eq(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_21, plain, (eq2(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_18, plain, (eq(z,s(X1))=bfalse)). % 0.06/0.26 cnf(i_0_19, plain, (eq(s(X1),z)=bfalse)). % 0.06/0.26 cnf(i_0_17, plain, (eq(s(X1),s(X2))=eq(X1,X2))). % 0.06/0.26 cnf(i_0_14, plain, (impl(eq(s(X1),X1),bfalse)=plus_ninf(X1))). % 0.06/0.26 cnf(i_0_22, negated_conjecture, (eq2(plus_ninf(X1),bfalse)!=btrue)). % 0.06/0.26 cnf(i_0_24, plain, (X3=X3)). % 0.06/0.26 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.26 # Begin printing tableau % 0.06/0.26 # Found 5 steps % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)). % 0.06/0.26 cnf(i_0_33, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_31])). % 0.06/0.26 cnf(i_0_61, plain, (eq2(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_16])). % 0.06/0.26 cnf(i_0_59, plain, (eq(eq2(btrue,bfalse),eq2(btrue,bfalse))=eq(bfalse,bfalse)), inference(extension_rule, [i_0_27])). % 0.06/0.26 cnf(i_0_71, plain, (eq(bfalse,bfalse)!=impl(btrue,eq(bfalse,bfalse))), inference(closure_rule, [i_0_12])). % 0.06/0.26 # End printing tableau % 0.06/0.26 # SZS output end % 0.06/0.26 # Branches closed with saturation will be marked with an "s" % 0.06/0.26 # Satisfiable branch found. % 0.06/0.26 # There were 1 total branch saturation attempts. % 0.06/0.26 # There were 0 of these attempts blocked. % 0.06/0.26 # There were 0 deferred branch saturation attempts. % 0.06/0.26 # There were 0 free duplicated saturations. % 0.06/0.26 # There were 0 total successful branch saturations. % 0.06/0.26 # There were 0 successful branch saturations in interreduction. % 0.06/0.26 # There were 0 successful branch saturations on the branch. % 0.06/0.26 # There were 0 successful branch saturations after the branch. % 0.06/0.26 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # Begin clausification derivation % 0.06/0.26 % 0.06/0.26 # End clausification derivation % 0.06/0.26 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse)). % 0.06/0.26 cnf(i_0_15, plain, (eq2(bfalse,btrue)=bfalse)). % 0.06/0.26 cnf(i_0_13, plain, (impl(bfalse,X1)=btrue)). % 0.06/0.26 cnf(i_0_12, plain, (impl(btrue,X1)=X1)). % 0.06/0.26 cnf(i_0_20, plain, (eq(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_21, plain, (eq2(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_18, plain, (eq(z,s(X1))=bfalse)). % 0.06/0.26 cnf(i_0_19, plain, (eq(s(X1),z)=bfalse)). % 0.06/0.26 cnf(i_0_17, plain, (eq(s(X1),s(X2))=eq(X1,X2))). % 0.06/0.26 cnf(i_0_14, plain, (impl(eq(s(X1),X1),bfalse)=plus_ninf(X1))). % 0.06/0.26 cnf(i_0_22, negated_conjecture, (eq2(plus_ninf(X1),bfalse)!=btrue)). % 0.06/0.26 cnf(i_0_24, plain, (X3=X3)). % 0.06/0.26 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.26 # Begin printing tableau % 0.06/0.26 # Found 4 steps % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)). % 0.06/0.26 cnf(i_0_33, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_30])). % 0.06/0.26 cnf(i_0_57, plain, (s(eq2(btrue,bfalse))=s(bfalse)), inference(extension_rule, [i_0_27])). % 0.06/0.26 cnf(i_0_71, plain, (s(bfalse)!=impl(btrue,s(bfalse))), inference(closure_rule, [i_0_12])). % 0.06/0.26 # End printing tableau % 0.06/0.26 # SZS output end % 0.06/0.26 # Branches closed with saturation will be marked with an "s" % 0.06/0.26 # 31162 Satisfiable branch % 0.06/0.26 # Satisfiable branch found. % 0.06/0.26 # There were 1 total branch saturation attempts. % 0.06/0.26 # There were 0 of these attempts blocked. % 0.06/0.26 # There were 0 deferred branch saturation attempts. % 0.06/0.26 # There were 0 free duplicated saturations. % 0.06/0.26 # There were 0 total successful branch saturations. % 0.06/0.26 # There were 0 successful branch saturations in interreduction. % 0.06/0.26 # There were 0 successful branch saturations on the branch. % 0.06/0.26 # There were 0 successful branch saturations after the branch. % 0.06/0.26 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.26 # Begin clausification derivation % 0.06/0.26 % 0.06/0.26 # End clausification derivation % 0.06/0.26 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse)). % 0.06/0.26 cnf(i_0_15, plain, (eq2(bfalse,btrue)=bfalse)). % 0.06/0.26 cnf(i_0_13, plain, (impl(bfalse,X1)=btrue)). % 0.06/0.26 cnf(i_0_12, plain, (impl(btrue,X1)=X1)). % 0.06/0.26 cnf(i_0_20, plain, (eq(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_21, plain, (eq2(X1,X1)=btrue)). % 0.06/0.26 cnf(i_0_18, plain, (eq(z,s(X1))=bfalse)). % 0.06/0.26 cnf(i_0_19, plain, (eq(s(X1),z)=bfalse)). % 0.06/0.26 cnf(i_0_17, plain, (eq(s(X1),s(X2))=eq(X1,X2))). % 0.06/0.26 cnf(i_0_14, plain, (impl(eq(s(X1),X1),bfalse)=plus_ninf(X1))). % 0.06/0.26 cnf(i_0_22, negated_conjecture, (eq2(plus_ninf(X1),bfalse)!=btrue)). % 0.06/0.26 cnf(i_0_24, plain, (X3=X3)). % 0.06/0.26 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.26 # Begin printing tableau % 0.06/0.26 # Found 4 steps % 0.06/0.26 cnf(i_0_16, plain, (eq2(btrue,bfalse)=bfalse), inference(start_rule)). % 0.06/0.26 cnf(i_0_33, plain, (eq2(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_29])). % 0.06/0.26 cnf(i_0_55, plain, (plus_ninf(eq2(btrue,bfalse))=plus_ninf(bfalse)), inference(extension_rule, [i_0_27])). % 0.06/0.26 cnf(i_0_71, plain, (plus_ninf(bfalse)!=impl(btrue,plus_ninf(bfalse))), inference(closure_rule, [i_0_12])). % 0.06/0.26 # End printing tableau % 0.06/0.26 # SZS output end % 0.06/0.26 # Branches closed with saturation will be marked with an "s" % 0.06/0.26 # Child (31157) has found a proof. % 0.06/0.26 % 0.06/0.26 # Proof search is over... % 0.06/0.26 # Freeing feature tree %------------------------------------------------------------------------------