Input TRS: 1: s(a) -> a 2: s(s(x)) -> x 3: s(f(x,y)) -> f(s(y),s(x)) 4: s(g(x,y)) -> g(s(x),s(y)) 5: f(x,a) -> x 6: f(a,y) -> y 7: f(g(x,y),g(u,v)) -> g(f(x,u),f(y,v)) 8: g(a,a) -> a Dependency Pairs: #1: #s(f(x,y)) -> #f(s(y),s(x)) #2: #s(f(x,y)) -> #s(y) #3: #s(f(x,y)) -> #s(x) #4: #s(g(x,y)) -> #g(s(x),s(y)) #5: #s(g(x,y)) -> #s(x) #6: #s(g(x,y)) -> #s(y) #7: #f(g(x,y),g(u,v)) -> #g(f(x,u),f(y,v)) #8: #f(g(x,y),g(u,v)) -> #f(x,u) #9: #f(g(x,y),g(u,v)) -> #f(y,v) Number of SCCs: 2 SCC { #8 #9 } QKBOPS(sum)... removes: #8 #9 I(g) = 1 + x1 + x2 \pi(g) = [1] I(#f) = 3 + x1 + x2 \pi(#f) = [1,2] PREC: #f > g USABLE RULES: { } Number of SCCs: 1 SCC { #2 #3 #5 #6 } QKBOPS(sum)... removes: #2 #3 #5 #6 I(f) = x1 + x2 \pi(f) = [] I(g) = x1 + x2 \pi(g) = [] I(#s) = x1 \pi(#s) = [] PREC: f = g = #s USABLE RULES: { } Number of SCCs: 0