Input TRS: 1: f(f(X)) -> c(n__f(n__g(n__f(X)))) 2: c(X) -> d(activate(X)) 3: h(X) -> c(n__d(X)) 4: f(X) -> n__f(X) 5: g(X) -> n__g(X) 6: d(X) -> n__d(X) 7: activate(n__f(X)) -> f(activate(X)) 8: activate(n__g(X)) -> g(X) 9: activate(n__d(X)) -> d(X) 10: activate(X) -> X Dependency Pairs: #1: #f(f(X)) -> #c(n__f(n__g(n__f(X)))) #2: #c(X) -> #d(activate(X)) #3: #c(X) -> #activate(X) #4: #h(X) -> #c(n__d(X)) #5: #activate(n__f(X)) -> #f(activate(X)) #6: #activate(n__f(X)) -> #activate(X) #7: #activate(n__g(X)) -> #g(X) #8: #activate(n__d(X)) -> #d(X) Number of SCCs: 1 SCC { #1 #3 #5 #6 } QKBOPS(sum)... removes: #1 #3 #5 #6 I(n__d) = 1 + x1 \pi(n__d) = [] I(c) = 2 + x1 \pi(c) = [] I(n__f) = 4 + x1 \pi(n__f) = [] I(d) = 1 + x1 \pi(d) = [] I(n__g) = 2 \pi(n__g) = [] I(f) = 4 + x1 \pi(f) = [] I(g) = 2 \pi(g) = [] I(activate) = x1 \pi(activate) = 1 I(#activate) = x1 \pi(#activate) = 1 I(#c) = 1 + x1 \pi(#c) = [] I(#f) = 3 + x1 \pi(#f) = [] PREC: n__d = c = d = n__g = g > n__f = f = #f > #c USABLE RULES: { 10..4 2 1 } Number of SCCs: 0