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