Input TRS: 1: f(X,n__g(X),Y) -> f(activate(Y),activate(Y),activate(Y)) 2: g(b) -> c 3: b -> c 4: g(X) -> n__g(X) 5: activate(n__g(X)) -> g(activate(X)) 6: activate(X) -> X Dependency Pairs: #1: #f(X,n__g(X),Y) -> #f(activate(Y),activate(Y),activate(Y)) #2: #f(X,n__g(X),Y) -> #activate(Y) #3: #f(X,n__g(X),Y) -> #activate(Y) #4: #f(X,n__g(X),Y) -> #activate(Y) #5: #activate(n__g(X)) -> #g(activate(X)) #6: #activate(n__g(X)) -> #activate(X) Number of SCCs: 2 SCC { #6 } QKBOPS(sum)... removes: #6 I(n__g) = 1 + x1 \pi(n__g) = [] I(#activate) = x1 \pi(#activate) = [] PREC: n__g = #activate USABLE RULES: { } Number of SCCs: 1 SCC { #1 } QKBOPS(sum)... failed.