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