%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX199-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 : n019.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:42 PM UTC 2026 % Result : Unsatisfiable 0.19s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX199-1 : TPTP v9.3.0. Released v9.3.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.16/0.34 % Computer : n019.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue May 5 11:13:14 EDT 2026 % 0.16/0.34 % CPUTime : % 0.19/0.37 # No SInE strategy applied % 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.19/0.37 # and selection function SelectCQIPrecWNTNp. % 0.19/0.37 # % 0.19/0.37 # Presaturation interreduction done % 0.19/0.37 # Number of axioms: 24 Number of unprocessed: 24 % 0.19/0.37 # Tableaux proof search. % 0.19/0.37 # APR header successfully linked. % 0.19/0.37 # Hello from C++ % 0.19/0.37 # The folding up rule is enabled... % 0.19/0.37 # Local unification is enabled... % 0.19/0.37 # Any saturation attempts will use folding labels... % 0.19/0.37 # 24 beginning clauses after preprocessing and clausification % 0.19/0.37 # Creating start rules for all 1 conjectures. % 0.19/0.37 # There are 1 start rule candidates: % 0.19/0.37 # Found 22 unit axioms. % 0.19/0.37 # 1 start rule tableaux created. % 0.19/0.37 # 2 extension rule candidate clauses % 0.19/0.37 # 22 unit axiom clauses % 0.19/0.37 % 0.19/0.37 # Requested 8, 32 cores available to the main process. % 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.37 # Creating equality axioms % 0.19/0.37 # Ran out of tableaux, making start rules for all clauses % 0.19/0.37 # Returning from population with 49 new_tableaux and 0 remaining starting tableaux. % 0.19/0.37 # We now have 49 tableaux to operate on % 0.19/0.41 # There were 1 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 0 free duplicated saturations. % 0.19/0.41 # There were 1 total successful branch saturations. % 0.19/0.41 # There were 0 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 1 successful branch saturations after the branch. % 0.19/0.41 # There were 1 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 0 free duplicated saturations. % 0.19/0.41 # There were 1 total successful branch saturations. % 0.19/0.41 # There were 0 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 1 successful branch saturations after the branch. % 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # Begin clausification derivation % 0.19/0.41 % 0.19/0.41 # End clausification derivation % 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.41 cnf(i_0_37, plain, (eq3(btrue,bfalse)=bfalse)). % 0.19/0.41 cnf(i_0_36, plain, (eq3(bfalse,btrue)=bfalse)). % 0.19/0.41 cnf(i_0_34, plain, (impl(bfalse,X1)=btrue)). % 0.19/0.41 cnf(i_0_43, plain, (eq3(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_27, plain, (leqNat(z,X1)=btrue)). % 0.19/0.41 cnf(i_0_33, plain, (impl(btrue,X1)=X1)). % 0.19/0.41 cnf(i_0_41, plain, (eq(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_42, plain, (eq2(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_30, plain, (merge(nil,X1)=X1)). % 0.19/0.41 cnf(i_0_39, plain, (eq2(z,s(X1))=bfalse)). % 0.19/0.41 cnf(i_0_28, plain, (leqNat(s(X1),z)=bfalse)). % 0.19/0.41 cnf(i_0_40, plain, (eq2(s(X1),z)=bfalse)). % 0.19/0.41 cnf(i_0_46, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.19/0.41 cnf(i_0_47, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.19/0.41 cnf(i_0_29, plain, (leqNat(s(X1),s(X2))=leqNat(X1,X2))). % 0.19/0.41 cnf(i_0_38, plain, (eq2(s(X1),s(X2))=eq2(X1,X2))). % 0.19/0.41 cnf(i_0_31, plain, (merge(cons(X1,X2),nil)=cons(X1,X2))). % 0.19/0.41 cnf(i_0_25, plain, (aux(X1,X2,X3,X4,btrue)=cons(X1,merge(X2,cons(X3,X4))))). % 0.19/0.41 cnf(i_0_26, plain, (aux(X1,X2,X3,X4,bfalse)=cons(X3,merge(cons(X1,X2),X4)))). % 0.19/0.41 cnf(i_0_32, plain, (aux(X1,X2,X3,X4,leqNat(X1,X3))=merge(cons(X1,X2),cons(X3,X4)))). % 0.19/0.41 cnf(i_0_35, plain, (impl(eq(merge(X1,X2),merge(X2,X1)),impl(eq(merge(X1,X3),merge(X3,X1)),eq(merge(X2,X3),merge(X3,X2))))=prop_merge_comm(X1,X2,X3))). % 0.19/0.41 cnf(i_0_48, negated_conjecture, (eq3(prop_merge_comm(X1,X2,X3),bfalse)!=btrue)). % 0.19/0.41 cnf(i_0_44, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.19/0.41 cnf(i_0_45, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.19/0.41 cnf(i_0_54, plain, (X5=X5)). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 6 steps % 0.19/0.41 cnf(i_0_37, plain, (eq3(btrue,bfalse)=bfalse), inference(start_rule)). % 0.19/0.41 cnf(i_0_68, plain, (eq3(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_67])). % 0.19/0.41 cnf(i_0_137, plain, (eq3(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_37])). % 0.19/0.41 cnf(i_0_136, plain, (eq2(eq3(btrue,bfalse),eq3(btrue,bfalse))=eq2(bfalse,bfalse)), inference(extension_rule, [i_0_57])). % 0.19/0.41 cnf(i_0_149, plain, (eq2(bfalse,bfalse)!=impl(btrue,eq2(bfalse,bfalse))), inference(closure_rule, [i_0_33])). % 0.19/0.41 cnf(i_0_147, plain, (eq2(eq3(btrue,bfalse),eq3(btrue,bfalse))=impl(btrue,eq2(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_147, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # Begin clausification derivation % 0.19/0.41 % 0.19/0.41 # End clausification derivation % 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.41 cnf(i_0_37, plain, (eq3(btrue,bfalse)=bfalse)). % 0.19/0.41 cnf(i_0_36, plain, (eq3(bfalse,btrue)=bfalse)). % 0.19/0.41 cnf(i_0_34, plain, (impl(bfalse,X1)=btrue)). % 0.19/0.41 cnf(i_0_43, plain, (eq3(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_27, plain, (leqNat(z,X1)=btrue)). % 0.19/0.41 cnf(i_0_33, plain, (impl(btrue,X1)=X1)). % 0.19/0.41 cnf(i_0_41, plain, (eq(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_42, plain, (eq2(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_30, plain, (merge(nil,X1)=X1)). % 0.19/0.41 cnf(i_0_39, plain, (eq2(z,s(X1))=bfalse)). % 0.19/0.41 cnf(i_0_28, plain, (leqNat(s(X1),z)=bfalse)). % 0.19/0.41 cnf(i_0_40, plain, (eq2(s(X1),z)=bfalse)). % 0.19/0.41 cnf(i_0_46, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.19/0.41 cnf(i_0_47, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.19/0.41 cnf(i_0_29, plain, (leqNat(s(X1),s(X2))=leqNat(X1,X2))). % 0.19/0.41 cnf(i_0_38, plain, (eq2(s(X1),s(X2))=eq2(X1,X2))). % 0.19/0.41 cnf(i_0_31, plain, (merge(cons(X1,X2),nil)=cons(X1,X2))). % 0.19/0.41 cnf(i_0_25, plain, (aux(X1,X2,X3,X4,btrue)=cons(X1,merge(X2,cons(X3,X4))))). % 0.19/0.41 cnf(i_0_26, plain, (aux(X1,X2,X3,X4,bfalse)=cons(X3,merge(cons(X1,X2),X4)))). % 0.19/0.41 cnf(i_0_32, plain, (aux(X1,X2,X3,X4,leqNat(X1,X3))=merge(cons(X1,X2),cons(X3,X4)))). % 0.19/0.41 cnf(i_0_35, plain, (impl(eq(merge(X1,X2),merge(X2,X1)),impl(eq(merge(X1,X3),merge(X3,X1)),eq(merge(X2,X3),merge(X3,X2))))=prop_merge_comm(X1,X2,X3))). % 0.19/0.41 cnf(i_0_48, negated_conjecture, (eq3(prop_merge_comm(X1,X2,X3),bfalse)!=btrue)). % 0.19/0.41 cnf(i_0_44, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.19/0.41 cnf(i_0_45, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.19/0.41 cnf(i_0_54, plain, (X5=X5)). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 6 steps % 0.19/0.41 cnf(i_0_37, plain, (eq3(btrue,bfalse)=bfalse), inference(start_rule)). % 0.19/0.41 cnf(i_0_68, plain, (eq3(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_66])). % 0.19/0.41 cnf(i_0_134, plain, (eq3(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_37])). % 0.19/0.41 cnf(i_0_133, plain, (eq3(eq3(btrue,bfalse),eq3(btrue,bfalse))=eq3(bfalse,bfalse)), inference(extension_rule, [i_0_57])). % 0.19/0.41 cnf(i_0_149, plain, (eq3(bfalse,bfalse)!=btrue), inference(closure_rule, [i_0_43])). % 0.19/0.41 cnf(i_0_147, plain, (eq3(eq3(btrue,bfalse),eq3(btrue,bfalse))=btrue), inference(etableau_closure_rule, [i_0_147, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # There were 1 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 0 free duplicated saturations. % 0.19/0.41 # There were 1 total successful branch saturations. % 0.19/0.41 # There were 0 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 1 successful branch saturations after the branch. % 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # Begin clausification derivation % 0.19/0.41 % 0.19/0.41 # End clausification derivation % 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.41 cnf(i_0_37, plain, (eq3(btrue,bfalse)=bfalse)). % 0.19/0.41 cnf(i_0_36, plain, (eq3(bfalse,btrue)=bfalse)). % 0.19/0.41 cnf(i_0_34, plain, (impl(bfalse,X1)=btrue)). % 0.19/0.41 cnf(i_0_43, plain, (eq3(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_27, plain, (leqNat(z,X1)=btrue)). % 0.19/0.41 cnf(i_0_33, plain, (impl(btrue,X1)=X1)). % 0.19/0.41 cnf(i_0_41, plain, (eq(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_42, plain, (eq2(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_30, plain, (merge(nil,X1)=X1)). % 0.19/0.41 cnf(i_0_39, plain, (eq2(z,s(X1))=bfalse)). % 0.19/0.41 cnf(i_0_28, plain, (leqNat(s(X1),z)=bfalse)). % 0.19/0.41 cnf(i_0_40, plain, (eq2(s(X1),z)=bfalse)). % 0.19/0.41 cnf(i_0_46, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.19/0.41 cnf(i_0_47, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.19/0.41 cnf(i_0_29, plain, (leqNat(s(X1),s(X2))=leqNat(X1,X2))). % 0.19/0.41 cnf(i_0_38, plain, (eq2(s(X1),s(X2))=eq2(X1,X2))). % 0.19/0.41 cnf(i_0_31, plain, (merge(cons(X1,X2),nil)=cons(X1,X2))). % 0.19/0.41 cnf(i_0_25, plain, (aux(X1,X2,X3,X4,btrue)=cons(X1,merge(X2,cons(X3,X4))))). % 0.19/0.41 cnf(i_0_26, plain, (aux(X1,X2,X3,X4,bfalse)=cons(X3,merge(cons(X1,X2),X4)))). % 0.19/0.41 cnf(i_0_32, plain, (aux(X1,X2,X3,X4,leqNat(X1,X3))=merge(cons(X1,X2),cons(X3,X4)))). % 0.19/0.41 cnf(i_0_35, plain, (impl(eq(merge(X1,X2),merge(X2,X1)),impl(eq(merge(X1,X3),merge(X3,X1)),eq(merge(X2,X3),merge(X3,X2))))=prop_merge_comm(X1,X2,X3))). % 0.19/0.41 cnf(i_0_48, negated_conjecture, (eq3(prop_merge_comm(X1,X2,X3),bfalse)!=btrue)). % 0.19/0.41 cnf(i_0_44, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.19/0.41 cnf(i_0_45, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.19/0.41 cnf(i_0_54, plain, (X5=X5)). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 6 steps % 0.19/0.41 cnf(i_0_37, plain, (eq3(btrue,bfalse)=bfalse), inference(start_rule)). % 0.19/0.41 cnf(i_0_68, plain, (eq3(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_67])). % 0.19/0.41 cnf(i_0_138, plain, (eq3(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_37])). % 0.19/0.41 cnf(i_0_136, plain, (eq2(eq3(btrue,bfalse),eq3(btrue,bfalse))=eq2(bfalse,bfalse)), inference(extension_rule, [i_0_57])). % 0.19/0.41 cnf(i_0_149, plain, (eq2(bfalse,bfalse)!=impl(btrue,eq2(bfalse,bfalse))), inference(closure_rule, [i_0_33])). % 0.19/0.41 cnf(i_0_147, plain, (eq2(eq3(btrue,bfalse),eq3(btrue,bfalse))=impl(btrue,eq2(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_147, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # There were 1 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 0 free duplicated saturations. % 0.19/0.41 # There were 1 total successful branch saturations. % 0.19/0.41 # There were 0 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 1 successful branch saturations after the branch. % 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.41 # Begin clausification derivation % 0.19/0.41 % 0.19/0.41 # End clausification derivation % 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.41 cnf(i_0_37, plain, (eq3(btrue,bfalse)=bfalse)). % 0.19/0.41 cnf(i_0_36, plain, (eq3(bfalse,btrue)=bfalse)). % 0.19/0.41 cnf(i_0_34, plain, (impl(bfalse,X1)=btrue)). % 0.19/0.41 cnf(i_0_43, plain, (eq3(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_27, plain, (leqNat(z,X1)=btrue)). % 0.19/0.41 cnf(i_0_33, plain, (impl(btrue,X1)=X1)). % 0.19/0.41 cnf(i_0_41, plain, (eq(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_42, plain, (eq2(X1,X1)=btrue)). % 0.19/0.41 cnf(i_0_30, plain, (merge(nil,X1)=X1)). % 0.19/0.41 cnf(i_0_39, plain, (eq2(z,s(X1))=bfalse)). % 0.19/0.41 cnf(i_0_28, plain, (leqNat(s(X1),z)=bfalse)). % 0.19/0.41 cnf(i_0_40, plain, (eq2(s(X1),z)=bfalse)). % 0.19/0.41 cnf(i_0_46, plain, (eq(nil,cons(X1,X2))=bfalse)). % 0.19/0.41 cnf(i_0_47, plain, (eq(cons(X1,X2),nil)=bfalse)). % 0.19/0.41 cnf(i_0_29, plain, (leqNat(s(X1),s(X2))=leqNat(X1,X2))). % 0.19/0.41 cnf(i_0_38, plain, (eq2(s(X1),s(X2))=eq2(X1,X2))). % 0.19/0.41 cnf(i_0_31, plain, (merge(cons(X1,X2),nil)=cons(X1,X2))). % 0.19/0.41 cnf(i_0_25, plain, (aux(X1,X2,X3,X4,btrue)=cons(X1,merge(X2,cons(X3,X4))))). % 0.19/0.41 cnf(i_0_26, plain, (aux(X1,X2,X3,X4,bfalse)=cons(X3,merge(cons(X1,X2),X4)))). % 0.19/0.41 cnf(i_0_32, plain, (aux(X1,X2,X3,X4,leqNat(X1,X3))=merge(cons(X1,X2),cons(X3,X4)))). % 0.19/0.41 cnf(i_0_35, plain, (impl(eq(merge(X1,X2),merge(X2,X1)),impl(eq(merge(X1,X3),merge(X3,X1)),eq(merge(X2,X3),merge(X3,X2))))=prop_merge_comm(X1,X2,X3))). % 0.19/0.41 cnf(i_0_48, negated_conjecture, (eq3(prop_merge_comm(X1,X2,X3),bfalse)!=btrue)). % 0.19/0.41 cnf(i_0_44, plain, (eq(cons(X1,X2),cons(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.19/0.41 cnf(i_0_45, plain, (eq(cons(X1,X2),cons(X3,X4))=eq(X2,X4)|eq2(X1,X3)!=btrue)). % 0.19/0.41 cnf(i_0_54, plain, (X5=X5)). % 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.41 # Begin printing tableau % 0.19/0.41 # Found 6 steps % 0.19/0.41 cnf(i_0_37, plain, (eq3(btrue,bfalse)=bfalse), inference(start_rule)). % 0.19/0.41 cnf(i_0_68, plain, (eq3(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_65])). % 0.19/0.41 cnf(i_0_131, plain, (eq3(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_37])). % 0.19/0.41 cnf(i_0_130, plain, (eq(eq3(btrue,bfalse),eq3(btrue,bfalse))=eq(bfalse,bfalse)), inference(extension_rule, [i_0_57])). % 0.19/0.41 cnf(i_0_149, plain, (eq(bfalse,bfalse)!=impl(btrue,eq(bfalse,bfalse))), inference(closure_rule, [i_0_33])). % 0.19/0.41 cnf(i_0_147, plain, (eq(eq3(btrue,bfalse),eq3(btrue,bfalse))=impl(btrue,eq(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_147, ...])). % 0.19/0.41 # End printing tableau % 0.19/0.41 # SZS output end % 0.19/0.41 # Branches closed with saturation will be marked with an "s" % 0.19/0.41 # There were 1 total branch saturation attempts. % 0.19/0.41 # There were 0 of these attempts blocked. % 0.19/0.41 # There were 0 deferred branch saturation attempts. % 0.19/0.41 # There were 0 free duplicated saturations. % 0.19/0.41 # There were 1 total successful branch saturations. % 0.19/0.41 # There were 0 successful branch saturations in interreduction. % 0.19/0.41 # There were 0 successful branch saturations on the branch. % 0.19/0.41 # There were 1 successful branch saturations after the branch. % 0.19/0.41 # Child (26439) has found a proof. % 0.19/0.41 % 0.19/0.41 # Proof search is over... % 0.19/0.41 # Freeing feature tree %------------------------------------------------------------------------------