YES
Input TRS:
      1: fst(0(),Z) -> nil()
      2: fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z)))
      3: from(X) -> cons(X,n__from(n__s(X)))
      4: add(0(),X) -> X
      5: add(s(X),Y) -> s(n__add(activate(X),Y))
      6: len(nil()) -> 0()
      7: len(cons(X,Z)) -> s(n__len(activate(Z)))
      8: fst(X1,X2) -> n__fst(X1,X2)
      9: from(X) -> n__from(X)
      10: s(X) -> n__s(X)
      11: add(X1,X2) -> n__add(X1,X2)
      12: len(X) -> n__len(X)
      13: activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2))
      14: activate(n__from(X)) -> from(activate(X))
      15: activate(n__s(X)) -> s(X)
      16: activate(n__add(X1,X2)) -> add(activate(X1),activate(X2))
      17: activate(n__len(X)) -> len(activate(X))
      18: activate(X) -> X
Number of strict rules: 18
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #fst(s(X),cons(Y,Z)) -> #activate(X)
     #2: #fst(s(X),cons(Y,Z)) -> #activate(Z)
     #3: #activate(n__fst(X1,X2)) -> #fst(activate(X1),activate(X2))
     #4: #activate(n__fst(X1,X2)) -> #activate(X1)
     #5: #activate(n__fst(X1,X2)) -> #activate(X2)
     #6: #activate(n__from(X)) -> #from(activate(X))
     #7: #activate(n__from(X)) -> #activate(X)
     #8: #len(cons(X,Z)) -> #s(n__len(activate(Z)))
     #9: #len(cons(X,Z)) -> #activate(Z)
     #10: #add(s(X),Y) -> #s(n__add(activate(X),Y))
     #11: #add(s(X),Y) -> #activate(X)
     #12: #activate(n__len(X)) -> #len(activate(X))
     #13: #activate(n__len(X)) -> #activate(X)
     #14: #activate(n__add(X1,X2)) -> #add(activate(X1),activate(X2))
     #15: #activate(n__add(X1,X2)) -> #activate(X1)
     #16: #activate(n__add(X1,X2)) -> #activate(X2)
     #17: #activate(n__s(X)) -> #s(X)
Number of SCCs: 1, DPs: 13
  SCC { #1..5 #7 #9 #11..16 }
POLO(Sum)... succeeded.
      #len	w: x1 + 1
      s 	w: x1
      activate	w: x1
      n__from	w: x1 + 32279
      fst	w: x1 + x2 + 2242
      #activate	w: x1
      n__add	w: x1 + x2 + 2448
      #fst	w: x1 + x2 + 1
      n__s	w: x1
      0 	w: 9726
      from	w: x1 + 32279
      #s 	w: 0
      nil	w: 591
      n__len	w: x1 + 28883
      n__fst	w: x1 + x2 + 2242
      #from	w: 0
      cons	w: x2
      #add	w: x1 + 1
      add	w: x1 + x2 + 2448
      len	w: x1 + 28883
    USABLE RULES: { 1..18 }
    Removed DPs: #1..5 #7 #9 #11..16
Number of SCCs: 0, DPs: 0