YES

TRS:

  from(X) -> cons(X,n__from(s(X)))
  sel(0(),cons(X,XS)) -> X
  sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
  minus(X,0()) -> 0()
  minus(s(X),s(Y)) -> minus(X,Y)
  quot(0(),s(Y)) -> 0()
  quot(s(X),s(Y)) -> s(quot(minus(X,Y),s(Y)))
  zWquot(XS,nil()) -> nil()
  zWquot(nil(),XS) -> nil()
  zWquot(cons(X,XS),cons(Y,YS)) -> cons(quot(X,Y),n__zWquot(activate(XS),activate(YS)))
  from(X) -> n__from(X)
  zWquot(X1,X2) -> n__zWquot(X1,X2)
  activate(n__from(X)) -> from(X)
  activate(n__zWquot(X1,X2)) -> zWquot(X1,X2)
  activate(X) -> X

max/plus interpretations on N:

  from_A(x1) = max{37, 1 + x1}
  from#_A(x1) = max{44, 30 + x1}
  cons_A(x1,x2) = max{8, -1 + x1, 23 + x2}
  cons#_A(x1,x2) = max{43, 30 + x1, 29}
  n__from_A(x1) = max{14, 1 + x1}
  n__from#_A(x1) = max{44, 17 + x1}
  s_A(x1) = max{12, 11}
  s#_A(x1) = max{0, 1}
  sel_A(x1,x2) = max{0, 0, 1 + x2}
  sel#_A(x1,x2) = max{6, 5, 8 + x2}
  0_A = 0
  0#_A = 7
  activate_A(x1) = max{7, 23 + x1}
  activate#_A(x1) = max{18, 31 + x1}
  minus_A(x1,x2) = max{4, -1, -1}
  minus#_A(x1,x2) = max{5, 6, 4}
  quot_A(x1,x2) = max{12, -14, 11}
  quot#_A(x1,x2) = max{7, -3 + x1, -9 + x2}
  zWquot_A(x1,x2) = max{20, 19 + x1, 17 + x2}
  zWquot#_A(x1,x2) = max{28, 9 + x1, 20 + x2}
  nil_A = 21
  nil#_A = 8
  n__zWquot_A(x1,x2) = max{19, -4 + x1, -6 + x2}
  n__zWquot#_A(x1,x2) = max{7, 17, 7}

precedence:

  from = zWquot > cons = n__from = sel = quot = nil = n__zWquot > s = activate = minus > 0