Input TRS: 1: div(x,y) -> div2(x,y,0) 2: div2(x,y,i) -> if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) 3: if1(true,b,x,y,i,j) -> divZeroError 4: if1(false,b,x,y,i,j) -> if2(b,x,y,i,j) 5: if2(true,x,y,i,j) -> div2(minus(x,y),y,j) 6: if2(false,x,y,i,j) -> i 7: inc(0) -> 0 8: inc(s(i)) -> s(inc(i)) 9: le(s(x),0) -> false 10: le(0,y) -> true 11: le(s(x),s(y)) -> le(x,y) 12: minus(x,0) -> x 13: minus(0,y) -> 0 14: minus(s(x),s(y)) -> minus(x,y) 15: plus(x,y) -> plusIter(x,y,0) 16: plusIter(x,y,z) -> ifPlus(le(x,z),x,y,z) 17: ifPlus(true,x,y,z) -> y 18: ifPlus(false,x,y,z) -> plusIter(x,s(y),s(z)) 19: a -> c 20: a -> d Dependency Pairs: #1: #div(x,y) -> #div2(x,y,0) #2: #div2(x,y,i) -> #if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) #3: #div2(x,y,i) -> #le(y,0) #4: #div2(x,y,i) -> #le(y,x) #5: #div2(x,y,i) -> #plus(i,0) #6: #div2(x,y,i) -> #inc(i) #7: #if1(false,b,x,y,i,j) -> #if2(b,x,y,i,j) #8: #if2(true,x,y,i,j) -> #div2(minus(x,y),y,j) #9: #if2(true,x,y,i,j) -> #minus(x,y) #10: #inc(s(i)) -> #inc(i) #11: #le(s(x),s(y)) -> #le(x,y) #12: #minus(s(x),s(y)) -> #minus(x,y) #13: #plus(x,y) -> #plusIter(x,y,0) #14: #plusIter(x,y,z) -> #ifPlus(le(x,z),x,y,z) #15: #plusIter(x,y,z) -> #le(x,z) #16: #ifPlus(false,x,y,z) -> #plusIter(x,s(y),s(z)) Number of SCCs: 5 SCC { #11 } QKBOPS(sum)... removes: #11 I(#le) = 1 + x1 + x2 \pi(#le) = [] I(s) = 2 + x1 \pi(s) = [] PREC: #le > s USABLE RULES: { } Number of SCCs: 4 SCC { #10 } QKBOPS(sum)... removes: #10 I(s) = 1 + x1 \pi(s) = [1] I(#inc) = x1 \pi(#inc) = [] PREC: s = #inc USABLE RULES: { } Number of SCCs: 3 SCC { #12 } QKBOPS(sum)... removes: #12 I(#minus) = 1 + x1 + x2 \pi(#minus) = [] I(s) = 2 + x1 \pi(s) = [] PREC: #minus > s USABLE RULES: { } Number of SCCs: 2 SCC { #14 #16 } QKBOPS(sum)... failed.