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