Input TRS: 1: first(0,X) -> nil 2: first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) 3: from(X) -> cons(X,n__from(n__s(X))) 4: first(X1,X2) -> n__first(X1,X2) 5: from(X) -> n__from(X) 6: s(X) -> n__s(X) 7: activate(n__first(X1,X2)) -> first(activate(X1),activate(X2)) 8: activate(n__from(X)) -> from(activate(X)) 9: activate(n__s(X)) -> s(activate(X)) 10: activate(X) -> X Dependency Pairs: #1: #first(s(X),cons(Y,Z)) -> #activate(Z) #2: #activate(n__first(X1,X2)) -> #first(activate(X1),activate(X2)) #3: #activate(n__first(X1,X2)) -> #activate(X1) #4: #activate(n__first(X1,X2)) -> #activate(X2) #5: #activate(n__from(X)) -> #from(activate(X)) #6: #activate(n__from(X)) -> #activate(X) #7: #activate(n__s(X)) -> #s(activate(X)) #8: #activate(n__s(X)) -> #activate(X) Number of SCCs: 1 SCC { #1 #2 #3 #4 #6 #8 } QKBOPS(sum)... removes: #1 #2 #3 #4 #6 I(cons) = x2 \pi(cons) = [] I(n__first) = 1 + x1 + x2 \pi(n__first) = [] I(first) = 1 + x1 + x2 \pi(first) = [] I(from) = 1 + x1 \pi(from) = [] I(0) = 2 I(#first) = 1 + x2 \pi(#first) = [] I(n__s) = x1 \pi(n__s) = 1 I(s) = x1 \pi(s) = 1 I(nil) = 2 I(activate) = x1 \pi(activate) = [1] I(n__from) = 1 + x1 \pi(n__from) = [] I(#activate) = x1 \pi(#activate) = [] PREC: activate > cons = n__first = first = from = 0 = #first = nil = #activate > n__from USABLE RULES: { 10..1 } Number of SCCs: 1 SCC { #8 } QKBOPS(sum)... removes: #8 I(n__s) = 1 + x1 \pi(n__s) = [1] I(#activate) = x1 \pi(#activate) = [] PREC: n__s = #activate USABLE RULES: { } Number of SCCs: 0