YES

TRS:

  2nd(cons1(X,cons(Y,Z))) -> Y
  2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
  from(X) -> cons(X,n__from(s(X)))
  from(X) -> n__from(X)
  activate(n__from(X)) -> from(X)
  activate(X) -> X

max/plus interpretations on N:

  2nd_A(x1) = max{17, 16 + x1}
  2nd#_A(x1) = max{1, 3 + x1}
  cons1_A(x1,x2) = max{1, -7 + x1, -12 + x2}
  cons1#_A(x1,x2) = max{3, -4, -11 + x2}
  cons_A(x1,x2) = max{4, -4 + x1, -1 + x2}
  cons#_A(x1,x2) = max{0, 0, -3 + x2}
  activate_A(x1) = max{9, 5 + x1}
  activate#_A(x1) = max{7, 2 + x1}
  from_A(x1) = max{4, 3 + x1}
  from#_A(x1) = max{7, 1 + x1}
  n__from_A(x1) = max{1, -1 + x1}
  n__from#_A(x1) = max{2, 1 + x1}
  s_A(x1) = max{6, x1}
  s#_A(x1) = max{0, 0}

precedence:

  cons > 2nd > cons1 = activate > from > n__from = s