MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          a__and(X1,X2) -> and(X1,X2)
          a__and(tt(),X) -> mark(X)
          a__length(X) -> length(X)
          a__length(cons(N,L)) -> s(a__length(mark(L)))
          a__length(nil()) -> 0()
          a__zeros() -> cons(0(),zeros())
          a__zeros() -> zeros()
          mark(0()) -> 0()
          mark(and(X1,X2)) -> a__and(mark(X1),X2)
          mark(cons(X1,X2)) -> cons(mark(X1),X2)
          mark(length(X)) -> a__length(mark(X))
          mark(nil()) -> nil()
          mark(s(X)) -> s(mark(X))
          mark(tt()) -> tt()
          mark(zeros()) -> a__zeros()
      - Signature:
          {a__and/2,a__length/1,a__zeros/0,mark/1} / {0/0,and/2,cons/2,length/1,nil/0,s/1,tt/0,zeros/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {a__and,a__length,a__zeros,mark} and constructors {0,and
          ,cons,length,nil,s,tt,zeros}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE