YES

TRS:

  from(X) -> cons(X,n__from(n__s(X)))
  2ndspos(0(),Z) -> rnil()
  2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z)))
  2ndsneg(0(),Z) -> rnil()
  2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z)))
  pi(X) -> 2ndspos(X,from(0()))
  plus(0(),Y) -> Y
  plus(s(X),Y) -> s(plus(X,Y))
  times(0(),Y) -> 0()
  times(s(X),Y) -> plus(Y,times(X,Y))
  square(X) -> times(X,X)
  from(X) -> n__from(X)
  s(X) -> n__s(X)
  cons(X1,X2) -> n__cons(X1,X2)
  activate(n__from(X)) -> from(activate(X))
  activate(n__s(X)) -> s(activate(X))
  activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
  activate(X) -> X

max/plus interpretations on N:

  from_A(x1) = max{4, -2}
  from#_A(x1) = max{4, 6}
  cons_A(x1,x2) = max{3, -1, 4}
  cons#_A(x1,x2) = max{1, 3, -1}
  n__from_A(x1) = max{1, 3}
  n__from#_A(x1) = max{3, 3}
  n__s_A(x1) = max{0, -2 + x1}
  n__s#_A(x1) = max{3, 3}
  2ndspos_A(x1,x2) = max{7, 4 + x1, 3}
  2ndspos#_A(x1,x2) = max{10, 14, 9}
  0_A = 16
  0#_A = 14
  rnil_A = 15
  rnil#_A = 13
  s_A(x1) = max{0, -2 + x1}
  s#_A(x1) = max{3, 1}
  n__cons_A(x1,x2) = max{4, 1, 3}
  n__cons#_A(x1,x2) = max{2, 0, 0}
  rcons_A(x1,x2) = max{5, 1 + x1, -7 + x2}
  rcons#_A(x1,x2) = max{14, 14, 8}
  posrecip_A(x1) = max{4, 1}
  posrecip#_A(x1) = max{8, 8}
  activate_A(x1) = max{0, 1 + x1}
  activate#_A(x1) = max{11, 7}
  2ndsneg_A(x1,x2) = max{14, -1 + x1, -4}
  2ndsneg#_A(x1,x2) = max{12, 9, 14}
  negrecip_A(x1) = max{1, -1}
  negrecip#_A(x1) = max{8, 4}
  pi_A(x1) = max{2, 7 + x1}
  pi#_A(x1) = max{5, 15}
  plus_A(x1,x2) = max{3, 3, x2}
  plus#_A(x1,x2) = max{2, 1, 3 + x2}
  times_A(x1,x2) = max{16, 0, 0}
  times#_A(x1,x2) = max{0, 20, 20}
  square_A(x1) = max{16, -1}
  square#_A(x1) = max{21, 21 + x1}

precedence:

  square > times > pi = plus > 2ndspos = 0 = s = 2ndsneg > rnil = rcons = activate > n__from > from > cons = n__s > n__cons > posrecip = negrecip