MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          active(cons(X1,X2)) -> cons(active(X1),X2)
          active(head(X)) -> head(active(X))
          active(head(cons(X,XS))) -> mark(X)
          active(incr(X)) -> incr(active(X))
          active(incr(cons(X,XS))) -> mark(cons(s(X),incr(XS)))
          active(nats()) -> mark(cons(0(),incr(nats())))
          active(odds()) -> mark(incr(pairs()))
          active(pairs()) -> mark(cons(0(),incr(odds())))
          active(s(X)) -> s(active(X))
          active(tail(X)) -> tail(active(X))
          active(tail(cons(X,XS))) -> mark(XS)
          cons(mark(X1),X2) -> mark(cons(X1,X2))
          cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
          head(mark(X)) -> mark(head(X))
          head(ok(X)) -> ok(head(X))
          incr(mark(X)) -> mark(incr(X))
          incr(ok(X)) -> ok(incr(X))
          proper(0()) -> ok(0())
          proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
          proper(head(X)) -> head(proper(X))
          proper(incr(X)) -> incr(proper(X))
          proper(nats()) -> ok(nats())
          proper(odds()) -> ok(odds())
          proper(pairs()) -> ok(pairs())
          proper(s(X)) -> s(proper(X))
          proper(tail(X)) -> tail(proper(X))
          s(mark(X)) -> mark(s(X))
          s(ok(X)) -> ok(s(X))
          tail(mark(X)) -> mark(tail(X))
          tail(ok(X)) -> ok(tail(X))
          top(mark(X)) -> top(proper(X))
          top(ok(X)) -> top(active(X))
      - Signature:
          {active/1,cons/2,head/1,incr/1,proper/1,s/1,tail/1,top/1} / {0/0,mark/1,nats/0,odds/0,ok/1,pairs/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {active,cons,head,incr,proper,s,tail
          ,top} and constructors {0,mark,nats,odds,ok,pairs}
  + Applied Processor:
      MI {miKind = Automaton Nothing, miDimension = 3, miUArgs = NoUArgs, miURules = NoURules, miSelector = Nothing}
  + Details:
      Incompatible
MAYBE