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