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