MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          +(x,0()) -> x
          +(x,s(y)) -> s(+(x,y))
          f(0()) -> 0()
          f(s(0())) -> s(0())
          f(s(s(x))) -> +(p(g(x)),q(g(x)))
          f(s(s(x))) -> p(h(g(x)))
          g(0()) -> pair(s(0()),s(0()))
          g(s(x)) -> h(g(x))
          g(s(x)) -> pair(+(p(g(x)),q(g(x))),p(g(x)))
          h(x) -> pair(+(p(x),q(x)),p(x))
          p(pair(x,y)) -> x
          q(pair(x,y)) -> y
      - Signature:
          {+/2,f/1,g/1,h/1,p/1,q/1} / {0/0,pair/2,s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {+,f,g,h,p,q} and constructors {0,pair,s}
  + Applied Processor:
      MI {miKind = Automaton Nothing, miDimension = 3, miUArgs = NoUArgs, miURules = NoURules, miSelector = Nothing}
  + Details:
      Incompatible
MAYBE