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