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