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