YES

TRS:

  2nd(cons1(X,cons(Y,Z))) -> Y
  2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
  from(X) -> cons(X,n__from(n__s(X)))
  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:

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

precedence:

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