YES
Input TRS:
      1: a__from(X) -> cons(mark(X),from(s(X)))
      2: a__head(cons(X,XS)) -> mark(X)
      3: a__2nd(cons(X,XS)) -> a__head(mark(XS))
      4: a__take(0(),XS) -> nil()
      5: a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS))
      6: a__sel(0(),cons(X,XS)) -> mark(X)
      7: a__sel(s(N),cons(X,XS)) -> a__sel(mark(N),mark(XS))
      8: mark(from(X)) -> a__from(mark(X))
      9: mark(head(X)) -> a__head(mark(X))
      10: mark(2nd(X)) -> a__2nd(mark(X))
      11: mark(take(X1,X2)) -> a__take(mark(X1),mark(X2))
      12: mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2))
      13: mark(cons(X1,X2)) -> cons(mark(X1),X2)
      14: mark(s(X)) -> s(mark(X))
      15: mark(0()) -> 0()
      16: mark(nil()) -> nil()
      17: a__from(X) -> from(X)
      18: a__head(X) -> head(X)
      19: a__2nd(X) -> 2nd(X)
      20: a__take(X1,X2) -> take(X1,X2)
      21: a__sel(X1,X2) -> sel(X1,X2)
Number of strict rules: 21
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #a__head(cons(X,XS)) -> #mark(X)
     #2: #a__sel(0(),cons(X,XS)) -> #mark(X)
     #3: #mark(cons(X1,X2)) -> #mark(X1)
     #4: #mark(head(X)) -> #a__head(mark(X))
     #5: #mark(head(X)) -> #mark(X)
     #6: #mark(take(X1,X2)) -> #a__take(mark(X1),mark(X2))
     #7: #mark(take(X1,X2)) -> #mark(X1)
     #8: #mark(take(X1,X2)) -> #mark(X2)
     #9: #mark(sel(X1,X2)) -> #a__sel(mark(X1),mark(X2))
     #10: #mark(sel(X1,X2)) -> #mark(X1)
     #11: #mark(sel(X1,X2)) -> #mark(X2)
     #12: #mark(s(X)) -> #mark(X)
     #13: #a__sel(s(N),cons(X,XS)) -> #a__sel(mark(N),mark(XS))
     #14: #a__sel(s(N),cons(X,XS)) -> #mark(N)
     #15: #a__sel(s(N),cons(X,XS)) -> #mark(XS)
     #16: #mark(2nd(X)) -> #a__2nd(mark(X))
     #17: #mark(2nd(X)) -> #mark(X)
     #18: #a__take(s(N),cons(X,XS)) -> #mark(X)
     #19: #a__2nd(cons(X,XS)) -> #a__head(mark(XS))
     #20: #a__2nd(cons(X,XS)) -> #mark(XS)
     #21: #a__from(X) -> #mark(X)
     #22: #mark(from(X)) -> #a__from(mark(X))
     #23: #mark(from(X)) -> #mark(X)
Number of SCCs: 1, DPs: 23
  SCC { #1..23 }
POLO(Sum)... POLO(max)... succeeded.
      s 	w: x1
      #a__head	w: x1 + 47562
      #a__from	w: x1 + 47563
      a__from	w: x1 + 35658
      take	w: max(x1 + 26287, x2 + 26287)
      2nd	w: x1 + 2999
      a__2nd	w: x1 + 2999
      #a__take	w: max(x2 + 47563)
      #a__2nd	w: x1 + 47563
      #mark	w: x1 + 47562
      0 	w: 1
      from	w: x1 + 35658
      sel	w: max(x1 + 20977, x2)
      nil	w: 26288
      #a__sel	w: max(x1 + 68539, x2 + 47562)
      mark	w: x1
      a__sel	w: max(x1 + 20977, x2)
      head	w: x1 + 1098
      cons	w: max(x1 + 20978, x2)
      a__take	w: max(x1 + 26287, x2 + 26287)
      a__head	w: x1 + 1098
    USABLE RULES: { 1..21 }
    Removed DPs: #1..8 #10 #14 #16..23
Number of SCCs: 1, DPs: 5
  SCC { #9 #11..13 #15 }
POLO(Sum)... POLO(max)... succeeded.
      s 	w: x1
      #a__head	w: x1 + 47562
      #a__from	w: x1 + 47563
      a__from	w: x1 + 38104
      take	w: max(x1 + 1, x2 + 1)
      2nd	w: x1 + 42594
      a__2nd	w: x1 + 42594
      #a__take	w: max(x2 + 47563)
      #a__2nd	w: x1 + 47563
      #mark	w: x1 + 841
      0 	w: 1
      from	w: x1 + 38104
      sel	w: max(x1 + 2, x2 + 1)
      nil	w: 2
      #a__sel	w: max(x2 + 842)
      mark	w: x1
      a__sel	w: max(x1 + 2, x2 + 1)
      head	w: x1 + 32869
      cons	w: max(x1 + 1, x2)
      a__take	w: max(x1 + 1, x2 + 1)
      a__head	w: x1 + 32869
    USABLE RULES: { 1..21 }
    Removed DPs: #11 #15
Number of SCCs: 2, DPs: 2
  SCC { #12 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      #a__head	w: 0
      #a__from	w: 0
      a__from	w: x1 + 1
      take	w: 2
      2nd	w: x1 + 31603
      a__2nd	w: 31602
      #a__take	w: 0
      #a__2nd	w: 0
      #mark	w: x1
      0 	w: 31602
      from	w: 2
      sel	w: 2
      nil	w: 31604
      #a__sel	w: 0
      mark	w: 31601
      a__sel	w: x2 + 1
      head	w: 3
      cons	w: x1 + 31598
      a__take	w: x1 + 1
      a__head	w: x1 + 2
    USABLE RULES: { }
    Removed DPs: #12
Number of SCCs: 1, DPs: 1
  SCC { #13 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded.
      s 	w: max(x1 + 2, 0)
      #a__head	w: max(x1 - 1, 0)
      #a__from	w: max(x1 - 1, 0)
      a__from	w: max(x1 - 3, 0)
      take	w: max(x1 + x2 - 2, 0)
      2nd	w: max(x1 + 286, 0)
      a__2nd	w: max(x1 + 286, 0)
      #a__take	w: 0
      #a__2nd	w: max(x1 - 1, 0)
      #mark	w: 0
      0 	w: 1145
      from	w: max(x1 - 3, 0)
      sel	w: max(x1 + x2 + 1, 0)
      nil	w: 1143
      #a__sel	w: max(x1 - 1, 0)
      mark	w: max(x1, 0)
      a__sel	w: max(x1 + x2 + 1, 0)
      head	w: max(x1 + 284, 0)
      cons	w: max(x1 - 3, x2 - 2, 0)
      a__take	w: max(x1 + x2 - 2, 0)
      a__head	w: max(x1 + 284, 0)
    USABLE RULES: { 1..21 }
    Removed DPs: #13
Number of SCCs: 0, DPs: 0