YES
Input TRS:
      1: from(X) -> cons(X,n__from(s(X)))
      2: after(0(),XS) -> XS
      3: after(s(N),cons(X,XS)) -> after(N,activate(XS))
      4: from(X) -> n__from(X)
      5: activate(n__from(X)) -> from(X)
      6: activate(X) -> X
Number of strict rules: 6
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #activate(n__from(X)) -> #from(X)
     #2: #after(s(N),cons(X,XS)) -> #after(N,activate(XS))
     #3: #after(s(N),cons(X,XS)) -> #activate(XS)
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      activate	w: 1
      n__from	w: x1 + 3
      #activate	w: 0
      after	w: 0
      0 	w: 0
      from	w: x1 + 2
      #after	w: x1
      #from	w: 0
      cons	w: x1 + 3
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 0, DPs: 0