NO
Input TRS:
      1: zeros() -> cons(0(),n__zeros())
      2: and(tt(),X) -> activate(X)
      3: length(nil()) -> 0()
      4: length(cons(N,L)) -> s(length(activate(L)))
      5: take(0(),IL) -> nil()
      6: take(s(M),cons(N,IL)) -> cons(N,n__take(M,activate(IL)))
      7: zeros() -> n__zeros()
      8: take(X1,X2) -> n__take(X1,X2)
      9: activate(n__zeros()) -> zeros()
      10: activate(n__take(X1,X2)) -> take(X1,X2)
      11: activate(X) -> X
Number of strict rules: 11
Direct POLO(bPol) ... removes: 8 3 5 7 11 2
      s 	w: x1
      activate	w: x1 + 1
      take	w: x1 + 2 * x2 + 21654
      and	w: 2 * x1 + 2 * x2
      n__zeros	w: 8405
      zeros	w: 8406
      0 	w: 0
      n__take	w: x1 + 2 * x2 + 21653
      nil	w: 1
      cons	w: x1 + x2 + 1
      tt	w: 1
      length	w: x1 + 1102
Number of strict rules: 5
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #take(s(M),cons(N,IL)) -> #activate(IL)
     #2: #activate(n__zeros()) -> #zeros()
     #3: #activate(n__take(X1,X2)) -> #take(X1,X2)
     #4: #length(cons(N,L)) -> #length(activate(L))
     #5: #length(cons(N,L)) -> #activate(L)
Number of SCCs: 2, DPs: 3
  SCC { #4 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #length(cons(N,n__zeros()))	-#4->
  #length(activate(n__zeros()))	--->*
  #length(cons(0(),n__zeros()))
  Looping with: [ N := 0(); ]