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