MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__first(X1,X2)) -> first(activate(X1),activate(X2))
          activate(n__from(X)) -> from(activate(X))
          activate(n__s(X)) -> s(activate(X))
          first(X1,X2) -> n__first(X1,X2)
          first(0(),X) -> nil()
          first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z)))
          from(X) -> cons(X,n__from(n__s(X)))
          from(X) -> n__from(X)
          s(X) -> n__s(X)
      - Signature:
          {activate/1,first/2,from/1,s/1} / {0/0,cons/2,n__first/2,n__from/1,n__s/1,nil/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {activate,first,from,s} and constructors {0,cons,n__first
          ,n__from,n__s,nil}
  + Applied Processor:
      NaturalPI {shape = Mixed 3, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
  + Details:
      Incompatible
MAYBE