MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__f(X1,X2)) -> f(X1,X2)
          f(X1,X2) -> n__f(X1,X2)
          f(g(X),Y) -> f(X,n__f(g(X),activate(Y)))
      - Signature:
          {activate/1,f/2} / {g/1,n__f/2}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {activate,f} and constructors {g,n__f}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE