YES

TRS:

  f(X) -> if(X,c(),n__f(true()))
  if(true(),X,Y) -> X
  if(false(),X,Y) -> activate(Y)
  f(X) -> n__f(X)
  activate(n__f(X)) -> f(X)
  activate(X) -> X

max/plus interpretations on N:

  f_A(x1) = max{5, 1 + x1}
  f#_A(x1) = max{5, 1 + x1}
  if_A(x1,x2,x3) = max{5, x1, 1 + x2, 3 + x3}
  if#_A(x1,x2,x3) = max{5, x1, 1 + x2, 3 + x3}
  c_A = 4
  c#_A = 4
  n__f_A(x1) = max{2, x1}
  n__f#_A(x1) = max{2, x1}
  true_A = 2
  true#_A = 2
  false_A = 6
  false#_A = 6
  activate_A(x1) = max{6, 2 + x1}
  activate#_A(x1) = max{6, 2 + x1}

precedence:

  n__f = true > f > if = c = false > activate