YES

TRS:

  from(X) -> cons(X,n__from(n__s(X)))
  after(0(),XS) -> XS
  after(s(N),cons(X,XS)) -> after(N,activate(XS))
  from(X) -> n__from(X)
  s(X) -> n__s(X)
  activate(n__from(X)) -> from(activate(X))
  activate(n__s(X)) -> s(activate(X))
  activate(X) -> X

max/plus interpretations on N:

  from_A(x1) = max{0, x1}
  from#_A(x1) = max{0, x1}
  cons_A(x1,x2) = max{0, x1, x2}
  cons#_A(x1,x2) = max{0, x1, x2}
  n__from_A(x1) = max{0, x1}
  n__from#_A(x1) = max{0, x1}
  n__s_A(x1) = max{0, x1}
  n__s#_A(x1) = max{0, x1}
  after_A(x1,x2) = max{0, x1, x2}
  after#_A(x1,x2) = max{0, x1, x2}
  0_A = 0
  0#_A = 0
  s_A(x1) = max{0, x1}
  s#_A(x1) = max{0, x1}
  activate_A(x1) = max{0, x1}
  activate#_A(x1) = max{0, x1}

precedence:

  after > activate > from = 0 = s > cons = n__from = n__s