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