MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          activate(X) -> X
          activate(n__f(X)) -> f(activate(X))
          activate(n__g(X)) -> g(activate(X))
          f(X) -> cons(X,n__f(n__g(X)))
          f(X) -> n__f(X)
          g(X) -> n__g(X)
          g(0()) -> s(0())
          g(s(X)) -> s(s(g(X)))
          sel(0(),cons(X,Y)) -> X
          sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
      - Signature:
          {activate/1,f/1,g/1,sel/2} / {0/0,cons/2,n__f/1,n__g/1,s/1}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {activate,f,g,sel} and constructors {0,cons,n__f,n__g,s}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
  + Details:
      The input can not be schown compatible.
MAYBE