Input TRS: 1: 0(#) -> # 2: +(x,#) -> x 3: +(#,x) -> x 4: +(0(x),0(y)) -> 0(+(x,y)) 5: +(0(x),1(y)) -> 1(+(x,y)) 6: +(1(x),0(y)) -> 1(+(x,y)) 7: +(1(x),1(y)) -> 0(+(+(x,y),1(#))) 8: *(#,x) -> # 9: *(0(x),y) -> 0(*(x,y)) 10: *(1(x),y) -> +(0(*(x,y)),y) 11: sum(nil) -> 0(#) 12: sum(cons(x,l)) -> +(x,sum(l)) 13: prod(nil) -> 1(#) 14: prod(cons(x,l)) -> *(x,prod(l)) Dependency Pairs: #1: #+(0(x),0(y)) -> #0(+(x,y)) #2: #+(0(x),0(y)) -> #+(x,y) #3: #+(0(x),1(y)) -> #+(x,y) #4: #+(1(x),0(y)) -> #+(x,y) #5: #+(1(x),1(y)) -> #0(+(+(x,y),1(#))) #6: #+(1(x),1(y)) -> #+(+(x,y),1(#)) #7: #+(1(x),1(y)) -> #+(x,y) #8: #*(0(x),y) -> #0(*(x,y)) #9: #*(0(x),y) -> #*(x,y) #10: #*(1(x),y) -> #+(0(*(x,y)),y) #11: #*(1(x),y) -> #0(*(x,y)) #12: #*(1(x),y) -> #*(x,y) #13: #sum(nil) -> #0(#) #14: #sum(cons(x,l)) -> #+(x,sum(l)) #15: #sum(cons(x,l)) -> #sum(l) #16: #prod(cons(x,l)) -> #*(x,prod(l)) #17: #prod(cons(x,l)) -> #prod(l) Number of SCCs: 4 SCC { #15 } QKBOS(sum)... removes: #15 I(cons) = x2 \pi(cons) = [2] I(#sum) = x1 \pi(#sum) = 1 PREC: cons USABLE RULES: { } Number of SCCs: 3 SCC { #17 } QKBOS(sum)... removes: #17 I(cons) = x2 \pi(cons) = [2] I(#prod) = x1 \pi(#prod) = 1 PREC: cons USABLE RULES: { } Number of SCCs: 2 SCC { #9 #12 } QKBOS(sum)... removes: #9 I(#*) = 1 + x1 + x2 \pi(#*) = [2,1] I(0) = x1 \pi(0) = [1] I(1) = x1 \pi(1) = 1 PREC: #* = 0 USABLE RULES: { } Number of SCCs: 2 SCC { #12 } QKBOS(sum)... removes: #12 I(#*) = x1 + x2 \pi(#*) = [2,1] I(1) = 1 + x1 \pi(1) = [1] PREC: #* = 1 USABLE RULES: { } Number of SCCs: 1 SCC { #2 #3 #4 #6 #7 } QKBOS(sum)... removes: #3 #4 #6 #7 I(#) = 2 I(#+) = 3 + x1 + x2 \pi(#+) = [1,2] I(+) = x1 + x2 \pi(+) = [2,1] I(0) = x1 \pi(0) = 1 I(1) = 3 + x1 \pi(1) = [1] PREC: + > # = #+ = 1 USABLE RULES: { 7..1 } Number of SCCs: 1 SCC { #2 } QKBOS(sum)... removes: #2 I(#+) = 1 + x1 + x2 \pi(#+) = [2,1] I(0) = x1 \pi(0) = [1] PREC: #+ = 0 USABLE RULES: { } Number of SCCs: 0