YES

TRS:

  terms(N) -> cons(recip(sqr(N)),n__terms(s(N)))
  sqr(0()) -> 0()
  sqr(s(X)) -> s(add(sqr(X),dbl(X)))
  dbl(0()) -> 0()
  dbl(s(X)) -> s(s(dbl(X)))
  add(0(),X) -> X
  add(s(X),Y) -> s(add(X,Y))
  first(0(),X) -> nil()
  first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
  half(0()) -> 0()
  half(s(0())) -> 0()
  half(s(s(X))) -> s(half(X))
  half(dbl(X)) -> X
  terms(X) -> n__terms(X)
  first(X1,X2) -> n__first(X1,X2)
  activate(n__terms(X)) -> terms(X)
  activate(n__first(X1,X2)) -> first(X1,X2)
  activate(X) -> X

max/plus interpretations on N:

  terms_A(x1) = max{7, 14 + x1}
  terms#_A(x1) = max{7, 14 + x1}
  cons_A(x1,x2) = max{14, x1, x2}
  cons#_A(x1,x2) = max{14, x1, x2}
  recip_A(x1) = max{14, 1 + x1}
  recip#_A(x1) = max{14, 1 + x1}
  sqr_A(x1) = max{13, 3 + x1}
  sqr#_A(x1) = max{13, 3 + x1}
  n__terms_A(x1) = max{14, 6 + x1}
  n__terms#_A(x1) = max{14, 6 + x1}
  s_A(x1) = max{8, x1}
  s#_A(x1) = max{8, x1}
  0_A = 1
  0#_A = 1
  add_A(x1,x2) = max{13, x1, 1 + x2}
  add#_A(x1,x2) = max{13, x1, 1 + x2}
  dbl_A(x1) = max{12, 1 + x1}
  dbl#_A(x1) = max{12, 1 + x1}
  first_A(x1,x2) = max{24, 33 + x1, 26 + x2}
  first#_A(x1,x2) = max{24, 33 + x1, 26 + x2}
  nil_A = 0
  nil#_A = 0
  n__first_A(x1,x2) = max{13, 23 + x1, 16 + x2}
  n__first#_A(x1,x2) = max{13, 23 + x1, 16 + x2}
  activate_A(x1) = max{25, 10 + x1}
  activate#_A(x1) = max{25, 10 + x1}
  half_A(x1) = max{8, x1}
  half#_A(x1) = max{8, x1}

precedence:

  activate > terms = 0 > recip = sqr = n__terms = nil > add = dbl = first > cons = s = n__first > half