/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

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)),x59))
   f(g(g(X)),x59)
   f(g(X),n__f(g(g(X)),activate(x59)))
  context: f(X,n__f(g(X),[]))
  substitution:
   X -> X
   x59 -> activate(x59)
  Qed