YES
Input TRS:
      1: first(0(),X) -> nil()
      2: first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
      3: from(X) -> cons(X,n__from(n__s(X)))
      4: first(X1,X2) -> n__first(X1,X2)
      5: from(X) -> n__from(X)
      6: s(X) -> n__s(X)
      7: activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
      8: activate(n__from(X)) -> from(activate(X))
      9: activate(n__s(X)) -> s(activate(X))
      10: activate(X) -> X
Number of strict rules: 10
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #first(s(X),cons(Y,Z)) -> #activate(Z)
     #2: #activate(n__s(X)) -> #s(activate(X))
     #3: #activate(n__s(X)) -> #activate(X)
     #4: #activate(n__first(X1,X2)) -> #first(activate(X1),activate(X2))
     #5: #activate(n__first(X1,X2)) -> #activate(X1)
     #6: #activate(n__first(X1,X2)) -> #activate(X2)
     #7: #activate(n__from(X)) -> #from(activate(X))
     #8: #activate(n__from(X)) -> #activate(X)
Number of SCCs: 1, DPs: 6
  SCC { #1 #3..6 #8 }
POLO(Sum)... succeeded.
      s 	w: x1
      n__first	w: x1 + x2 + 30614
      activate	w: x1
      n__from	w: x1 + 10451
      #activate	w: x1
      n__s	w: x1
      0 	w: 40651
      from	w: x1 + 10451
      #s 	w: 0
      #first	w: x2 + 1
      nil	w: 0
      first	w: x1 + x2 + 30614
      #from	w: 0
      cons	w: x2
    USABLE RULES: { 1..10 }
    Removed DPs: #1 #4..6 #8
Number of SCCs: 1, DPs: 1
  SCC { #3 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      n__first	w: x1 + x2 + 1
      activate	w: x1
      n__from	w: 10451
      #activate	w: x1
      n__s	w: x1 + 1
      0 	w: 40651
      from	w: 10451
      #s 	w: 0
      #first	w: x2 + 1
      nil	w: 0
      first	w: x1 + x2 + 1
      #from	w: 0
      cons	w: 0
    USABLE RULES: { 1..10 }
    Removed DPs: #3
Number of SCCs: 0, DPs: 0