Input TRS: 1: double(0) -> 0 2: double(s(x)) -> s(s(double(x))) 3: del(x,nil) -> nil 4: del(x,cons(y,xs)) -> if(eq(x,y),x,y,xs) 5: if(true,x,y,xs) -> xs 6: if(false,x,y,xs) -> cons(y,del(x,xs)) 7: eq(0,0) -> true 8: eq(0,s(y)) -> false 9: eq(s(x),0) -> false 10: eq(s(x),s(y)) -> eq(x,y) 11: first(nil) -> 0 12: first(cons(x,xs)) -> x 13: doublelist(nil) -> nil 14: doublelist(cons(x,xs)) -> cons(double(x),doublelist(del(first(cons(x,xs)),cons(x,xs)))) Dependency Pairs: #1: #double(s(x)) -> #double(x) #2: #del(x,cons(y,xs)) -> #if(eq(x,y),x,y,xs) #3: #del(x,cons(y,xs)) -> #eq(x,y) #4: #if(false,x,y,xs) -> #del(x,xs) #5: #eq(s(x),s(y)) -> #eq(x,y) #6: #doublelist(cons(x,xs)) -> #double(x) #7: #doublelist(cons(x,xs)) -> #doublelist(del(first(cons(x,xs)),cons(x,xs))) #8: #doublelist(cons(x,xs)) -> #del(first(cons(x,xs)),cons(x,xs)) #9: #doublelist(cons(x,xs)) -> #first(cons(x,xs)) Number of SCCs: 4 SCC { #1 } QKBOPS(sum)... removes: #1 I(s) = 1 + x1 \pi(s) = [] I(#double) = x1 \pi(#double) = [] PREC: s = #double USABLE RULES: { } Number of SCCs: 3 SCC { #5 } QKBOPS(sum)... removes: #5 I(#eq) = x1 + x2 \pi(#eq) = [] I(s) = 1 + x1 \pi(s) = [1] PREC: #eq > s USABLE RULES: { } Number of SCCs: 2 SCC { #7 } QKBOPS(sum)... failed.