Input TRS: 1: f(0) -> cons(0,n__f(n__s(n__0))) 2: f(s(0)) -> f(p(s(0))) 3: p(s(0)) -> 0 4: f(X) -> n__f(X) 5: s(X) -> n__s(X) 6: 0 -> n__0 7: activate(n__f(X)) -> f(activate(X)) 8: activate(n__s(X)) -> s(activate(X)) 9: activate(n__0) -> 0 10: activate(X) -> X Dependency Pairs: #1: #f(0) -> #0 #2: #f(s(0)) -> #f(p(s(0))) #3: #f(s(0)) -> #p(s(0)) #4: #f(s(0)) -> #s(0) #5: #f(s(0)) -> #0 #6: #p(s(0)) -> #0 #7: #activate(n__f(X)) -> #f(activate(X)) #8: #activate(n__f(X)) -> #activate(X) #9: #activate(n__s(X)) -> #s(activate(X)) #10: #activate(n__s(X)) -> #activate(X) #11: #activate(n__0) -> #0 Number of SCCs: 2 SCC { #2 } QKBOPS(sum)... removes: #2 I(n__f) = 1 \pi(n__f) = [] I(n__0) = 1 I(p) = 3 \pi(p) = [] I(0) = 2 I(n__s) = 2 \pi(n__s) = [] I(s) = 2 + x1 \pi(s) = [1] I(#activate) = x1 \pi(#activate) = 1 I(#f) = x1 \pi(#f) = 1 PREC: n__s = s > 0 > p > n__f = n__0 USABLE RULES: { 6 3 } Number of SCCs: 1 SCC { #8 #10 } QKBOPS(sum)... removes: #8 #10 I(n__f) = 1 + x1 \pi(n__f) = [] I(n__s) = x1 \pi(n__s) = [1] I(#activate) = x1 \pi(#activate) = [1] PREC: n__s = #activate > n__f USABLE RULES: { } Number of SCCs: 0