MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          double(0()) -> 0()
          double(s(x)) -> s(s(double(x)))
          if(false(),x,y,z) -> loop(x,double(y),s(z))
          if(true(),x,y,z) -> z
          le(0(),y) -> true()
          le(s(x),0()) -> false()
          le(s(x),s(y)) -> le(x,y)
          log(0()) -> logError()
          log(s(x)) -> loop(s(x),s(0()),0())
          loop(x,s(y),z) -> if(le(x,s(y)),x,s(y),z)
      - Signature:
          {double/1,if/4,le/2,log/1,loop/3} / {0/0,false/0,logError/0,s/1,true/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {double,if,le,log,loop} and constructors {0,false,logError
          ,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