MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          and(x,false()) -> false()
          and(x,true()) -> x
          double(0()) -> 0()
          double(s(x)) -> s(s(double(x)))
          f(true(),x,y) -> f(and(gt(x,y),gt(y,s(s(0())))),plus(s(0()),x),double(y))
          gt(0(),v) -> false()
          gt(s(u),0()) -> true()
          gt(s(u),s(v)) -> gt(u,v)
          plus(n,0()) -> n
          plus(n,s(m)) -> s(plus(n,m))
      - Signature:
          {and/2,double/1,f/3,gt/2,plus/2} / {0/0,false/0,s/1,true/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {and,double,f,gt,plus} and constructors {0,false,s,true}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
  + Details:
      The input can not be schown compatible.
MAYBE