YES

TRS:

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

max/plus interpretations on N:

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

precedence:

  cons > activate > zeros = tail > 0 = n__zeros