YES

TRS:

  from(X) -> cons(X,n__from(n__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)
  s(X) -> n__s(X)
  zWquot(X1,X2) -> n__zWquot(X1,X2)
  activate(n__from(X)) -> from(activate(X))
  activate(n__s(X)) -> s(activate(X))
  activate(n__zWquot(X1,X2)) -> zWquot(activate(X1),activate(X2))
  activate(X) -> X

max/plus interpretations on N:

  from_A(x1) = max{8, x1}
  from#_A(x1) = max{13, 5 + x1}
  cons_A(x1,x2) = max{6, -18 + x1, x2}
  cons#_A(x1,x2) = max{12, 12, 12}
  n__from_A(x1) = max{2, x1}
  n__from#_A(x1) = max{0, 13}
  n__s_A(x1) = max{7, x1}
  n__s#_A(x1) = max{4, 2}
  sel_A(x1,x2) = max{26, 0, 18 + x2}
  sel#_A(x1,x2) = max{20, -7, 12 + x2}
  0_A = 3
  0#_A = 4
  s_A(x1) = max{8, x1}
  s#_A(x1) = max{10, 3}
  activate_A(x1) = max{8, x1}
  activate#_A(x1) = max{1, 11 + x1}
  minus_A(x1,x2) = max{3, -5 + x1, -8}
  minus#_A(x1,x2) = max{3, 3, 3}
  quot_A(x1,x2) = max{1, 7 + x1, 2}
  quot#_A(x1,x2) = max{9, 4 + x1, 8}
  zWquot_A(x1,x2) = max{53, 37 + x1, 45 + x2}
  zWquot#_A(x1,x2) = max{45, 47 + x1, 31 + x2}
  nil_A = 54
  nil#_A = 84
  n__zWquot_A(x1,x2) = max{53, 37 + x1, 45 + x2}
  n__zWquot#_A(x1,x2) = max{30, 38 + x1, 12}

precedence:

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