YES
Input TRS:
      1: from(X) -> cons(X,n__from(s(X)))
      2: head(cons(X,XS)) -> X
      3: 2nd(cons(X,XS)) -> head(activate(XS))
      4: take(0(),XS) -> nil()
      5: take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS)))
      6: sel(0(),cons(X,XS)) -> X
      7: sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
      8: from(X) -> n__from(X)
      9: take(X1,X2) -> n__take(X1,X2)
      10: activate(n__from(X)) -> from(X)
      11: activate(n__take(X1,X2)) -> take(X1,X2)
      12: activate(X) -> X
Number of strict rules: 12
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #activate(n__take(X1,X2)) -> #take(X1,X2)
     #2: #sel(s(N),cons(X,XS)) -> #sel(N,activate(XS))
     #3: #sel(s(N),cons(X,XS)) -> #activate(XS)
     #4: #activate(n__from(X)) -> #from(X)
     #5: #take(s(N),cons(X,XS)) -> #activate(XS)
     #6: #2nd(cons(X,XS)) -> #head(activate(XS))
     #7: #2nd(cons(X,XS)) -> #activate(XS)
Number of SCCs: 2, DPs: 3
  SCC { #2 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #take	w: 0
      activate	w: x1 + 1
      take	w: x1 + x2 + 38978
      n__from	w: 19306
      #activate	w: 0
      2nd	w: 0
      #head	w: 0
      0 	w: 44083
      n__take	w: x1 + x2 + 38978
      #sel	w: x1 + x2
      from	w: 19307
      sel	w: 0
      nil	w: 0
      #2nd	w: 0
      #from	w: 0
      head	w: 0
      cons	w: x2 + 1
    USABLE RULES: { 1 4 5 8..12 }
    Removed DPs: #2
Number of SCCs: 1, DPs: 2
  SCC { #1 #5 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #take	w: x1 + x2
      activate	w: x1 + 18919
      take	w: x1 + x2 + 18919
      n__from	w: 35231
      #activate	w: x1
      2nd	w: 0
      #head	w: 0
      0 	w: 44083
      n__take	w: x1 + x2 + 1
      #sel	w: x2
      from	w: 54150
      sel	w: 0
      nil	w: 0
      #2nd	w: 0
      #from	w: 0
      head	w: 0
      cons	w: x2 + 18919
    USABLE RULES: { 1 4 5 8..12 }
    Removed DPs: #1 #5
Number of SCCs: 0, DPs: 0