Input TRS: 1: primes -> sieve(from(s(s(0)))) 2: from(X) -> cons(X,n__from(s(X))) 3: head(cons(X,Y)) -> X 4: tail(cons(X,Y)) -> activate(Y) 5: if(true,X,Y) -> activate(X) 6: if(false,X,Y) -> activate(Y) 7: filter(s(s(X)),cons(Y,Z)) -> if(divides(s(s(X)),Y),n__filter(s(s(X)),activate(Z)),n__cons(Y,n__filter(X,sieve(Y)))) 8: sieve(cons(X,Y)) -> cons(X,n__filter(X,sieve(activate(Y)))) 9: from(X) -> n__from(X) 10: filter(X1,X2) -> n__filter(X1,X2) 11: cons(X1,X2) -> n__cons(X1,X2) 12: activate(n__from(X)) -> from(X) 13: activate(n__filter(X1,X2)) -> filter(X1,X2) 14: activate(n__cons(X1,X2)) -> cons(X1,X2) 15: activate(X) -> X Dependency Pairs: #1: #primes -> #sieve(from(s(s(0)))) #2: #primes -> #from(s(s(0))) #3: #from(X) -> #cons(X,n__from(s(X))) #4: #tail(cons(X,Y)) -> #activate(Y) #5: #if(true,X,Y) -> #activate(X) #6: #if(false,X,Y) -> #activate(Y) #7: #filter(s(s(X)),cons(Y,Z)) -> #if(divides(s(s(X)),Y),n__filter(s(s(X)),activate(Z)),n__cons(Y,n__filter(X,sieve(Y)))) #8: #filter(s(s(X)),cons(Y,Z)) -> #activate(Z) #9: #filter(s(s(X)),cons(Y,Z)) -> #sieve(Y) #10: #sieve(cons(X,Y)) -> #cons(X,n__filter(X,sieve(activate(Y)))) #11: #sieve(cons(X,Y)) -> #sieve(activate(Y)) #12: #sieve(cons(X,Y)) -> #activate(Y) #13: #activate(n__from(X)) -> #from(X) #14: #activate(n__filter(X1,X2)) -> #filter(X1,X2) #15: #activate(n__cons(X1,X2)) -> #cons(X1,X2) Number of SCCs: 1 SCC { #8 #9 #11 #12 #14 } QKBOS(sum)... failed.