NO
Input TRS:
      1: dbl(0()) -> 0()
      2: dbl(s(X)) -> s(s(dbl(X)))
      3: dbls(nil()) -> nil()
      4: dbls(cons(X,Y)) -> cons(dbl(X),dbls(Y))
      5: sel(0(),cons(X,Y)) -> X
      6: sel(s(X),cons(Y,Z)) -> sel(X,Z)
      7: indx(nil(),X) -> nil()
      8: indx(cons(X,Y),Z) -> cons(sel(X,Z),indx(Y,Z))
      9: from(X) -> cons(X,from(s(X)))
Number of strict rules: 9
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #dbl(s(X)) -> #dbl(X)
     #2: #sel(s(X),cons(Y,Z)) -> #sel(X,Z)
     #3: #from(X) -> #from(s(X))
     #4: #indx(cons(X,Y),Z) -> #sel(X,Z)
     #5: #indx(cons(X,Y),Z) -> #indx(Y,Z)
     #6: #dbls(cons(X,Y)) -> #dbl(X)
     #7: #dbls(cons(X,Y)) -> #dbls(Y)
Number of SCCs: 5, DPs: 5
  SCC { #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #from(X)	-#3->
  #from(s(X))	--->*
  #from(s(X))
  Looping with: [ X := s(X); ]