MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          f(0()) -> s(0())
          f(s(x)) -> minus(s(x),g(f(x)))
          g(0()) -> 0()
          g(s(x)) -> minus(s(x),f(g(x)))
          minus(x,0()) -> x
          minus(s(x),s(y)) -> minus(x,y)
      - Signature:
          {f/1,g/1,minus/2} / {0/0,s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {f,g,minus} and constructors {0,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