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