Problem:
 f(g(X),Y) -> f(X,n__f(g(X),activate(Y)))
 f(X1,X2) -> n__f(X1,X2)
 activate(n__f(X1,X2)) -> f(X1,X2)
 activate(X) -> X

Proof:
 Unfolding Processor:
  loop length: 3
  terms:
   activate(n__f(g(g(X)),x53))
   f(g(g(X)),x53)
   f(g(X),n__f(g(g(X)),activate(x53)))
  context: f(X,n__f(g(X),[]))
  substitution:
   X -> X
   x53 -> activate(x53)
  Qed