YES

TRS:

  f(X) -> cons(X,n__f(n__g(X)))
  g(0()) -> s(0())
  g(s(X)) -> s(s(g(X)))
  sel(0(),cons(X,Y)) -> X
  sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
  f(X) -> n__f(X)
  g(X) -> n__g(X)
  activate(n__f(X)) -> f(activate(X))
  activate(n__g(X)) -> g(activate(X))
  activate(X) -> X

max/plus interpretations on N:

  f_A(x1) = max{8, 5 + x1}
  f#_A(x1) = max{8, 5 + x1}
  cons_A(x1,x2) = max{8, 4 + x1, x2}
  cons#_A(x1,x2) = max{8, 4 + x1, x2}
  n__f_A(x1) = max{8, 5 + x1}
  n__f#_A(x1) = max{8, 5 + x1}
  n__g_A(x1) = max{2, x1}
  n__g#_A(x1) = max{2, x1}
  g_A(x1) = max{3, x1}
  g#_A(x1) = max{3, x1}
  0_A = 2
  0#_A = 2
  s_A(x1) = max{1, x1}
  s#_A(x1) = max{1, x1}
  sel_A(x1,x2) = max{4, 4 + x1, 4 + x2}
  sel#_A(x1,x2) = max{4, 4 + x1, 4 + x2}
  activate_A(x1) = max{3, x1}
  activate#_A(x1) = max{3, x1}

precedence:

  sel > 0 = activate > f = g > cons = n__f = n__g = s