MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          eq() -> eq()
          eq() -> false()
          eq() -> true()
          inf(X) -> cons()
          length(cons()) -> s()
          length(nil()) -> 0()
          take(0(),X) -> nil()
          take(s(),cons()) -> cons()
      - Signature:
          {eq/0,inf/1,length/1,take/2} / {0/0,cons/0,false/0,nil/0,s/0,true/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {eq,inf,length,take} and constructors {0,cons,false,nil,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