MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          bitIter(x,y) -> if(zero(x),x,inc(y))
          bits(x) -> bitIter(x,0())
          half(0()) -> 0()
          half(s(0())) -> 0()
          half(s(s(x))) -> s(half(x))
          if(false(),x,y) -> bitIter(half(x),y)
          if(true(),x,y) -> p(y)
          inc(0()) -> 0()
          inc(s(x)) -> s(inc(x))
          p(0()) -> 0()
          p(s(x)) -> x
          zero(0()) -> true()
          zero(s(x)) -> false()
      - Signature:
          {bitIter/2,bits/1,half/1,if/3,inc/1,p/1,zero/1} / {0/0,false/0,s/1,true/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {bitIter,bits,half,if,inc,p,zero} and constructors {0
          ,false,s,true}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE