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