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