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