MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__take(X1,X2)) -> take(X1,X2)
          activate(n__zeros()) -> zeros()
          and(tt(),X) -> activate(X)
          length(cons(N,L)) -> s(length(activate(L)))
          length(nil()) -> 0()
          take(X1,X2) -> n__take(X1,X2)
          take(0(),IL) -> nil()
          take(s(M),cons(N,IL)) -> cons(N,n__take(M,activate(IL)))
          zeros() -> cons(0(),n__zeros())
          zeros() -> n__zeros()
      - Signature:
          {activate/1,and/2,length/1,take/2,zeros/0} / {0/0,cons/2,n__take/2,n__zeros/0,nil/0,s/1,tt/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {activate,and,length,take,zeros} and constructors {0,cons
          ,n__take,n__zeros,nil,s,tt}
  + Applied Processor:
      NaturalPI {shape = Mixed 3, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
  + Details:
      Incompatible
MAYBE