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