YES

TRS:

  zeros() -> cons(0(),n__zeros())
  tail(cons(X,XS)) -> activate(XS)
  zeros() -> n__zeros()
  activate(n__zeros()) -> zeros()
  activate(X) -> X

linear polynomial interpretations on N:

  zeros_A = 1
  zeros#_A = 1
  cons_A(x1,x2) = x1 + x2
  cons#_A(x1,x2) = x1 + x2
  0_A = 0
  0#_A = 0
  n__zeros_A = 0
  n__zeros#_A = 0
  tail_A(x1) = x1 + 3
  tail#_A(x1) = x1 + 3
  activate_A(x1) = x1 + 2
  activate#_A(x1) = x1 + 2

precedence:

  n__zeros > zeros > cons = 0 = tail > activate