WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            2nd(cons(X,XS)) -> head(activate(XS))
            activate(X) -> X
            activate(n__from(X)) -> from(X)
            activate(n__take(X1,X2)) -> take(X1,X2)
            from(X) -> cons(X,n__from(s(X)))
            from(X) -> n__from(X)
            head(cons(X,XS)) -> X
            sel(0(),cons(X,XS)) -> X
            sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
            take(X1,X2) -> n__take(X1,X2)
            take(0(),XS) -> nil()
            take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS)))
        - Signature:
            {2nd/1,activate/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,n__from/1,n__take/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {2nd,activate,from,head,sel,take} and constructors {0,cons
            ,n__from,n__take,nil,s}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> A(15)
          0 :: [] -(0)-> A(2)
          2nd :: [A(9)] -(13)-> A(0)
          activate :: [A(2)] -(12)-> A(2)
          cons :: [A(0) x A(9)] -(9)-> A(9)
          cons :: [A(0) x A(1)] -(1)-> A(1)
          cons :: [A(0) x A(2)] -(2)-> A(2)
          from :: [A(0)] -(11)-> A(2)
          head :: [A(1)] -(1)-> A(0)
          n__from :: [A(0)] -(0)-> A(2)
          n__from :: [A(0)] -(0)-> A(8)
          n__from :: [A(0)] -(0)-> A(14)
          n__take :: [A(2) x A(2)] -(0)-> A(2)
          nil :: [] -(0)-> A(4)
          s :: [A(15)] -(15)-> A(15)
          s :: [A(2)] -(2)-> A(2)
          s :: [A(0)] -(0)-> A(0)
          sel :: [A(15) x A(2)] -(15)-> A(0)
          take :: [A(2) x A(2)] -(11)-> A(2)
        
        
        Cost-free Signatures used:
        --------------------------
          0 :: [] -(0)-> A_cf(0)
          activate :: [A_cf(0)] -(0)-> A_cf(0)
          cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          from :: [A_cf(0)] -(0)-> A_cf(0)
          n__from :: [A_cf(0)] -(0)-> A_cf(0)
          n__take :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          nil :: [] -(0)-> A_cf(0)
          s :: [A_cf(0)] -(0)-> A_cf(0)
          sel :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          take :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          0_A :: [] -(0)-> A(1)
          cons_A :: [A(0) x A(1)] -(1)-> A(1)
          n__from_A :: [A(0)] -(0)-> A(1)
          n__take_A :: [A(0) x A(0)] -(0)-> A(1)
          nil_A :: [] -(0)-> A(1)
          s_A :: [A(1)] -(1)-> A(1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        2nd(cons(X,XS)) -> head(activate(XS))
        activate(X) -> X
        activate(n__from(X)) -> from(X)
        activate(n__take(X1,X2)) -> take(X1,X2)
        from(X) -> cons(X,n__from(s(X)))
        from(X) -> n__from(X)
        head(cons(X,XS)) -> X
        sel(0(),cons(X,XS)) -> X
        sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
        take(X1,X2) -> n__take(X1,X2)
        take(0(),XS) -> nil()
        take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS)))
    - Signature:
        {2nd/1,activate/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,n__from/1,n__take/2,nil/0,s/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {2nd,activate,from,head,sel,take} and constructors {0,cons
        ,n__from,n__take,nil,s}
Following problems could not be solved:
  - Strict TRS:
      2nd(cons(X,XS)) -> head(activate(XS))
      activate(X) -> X
      activate(n__from(X)) -> from(X)
      activate(n__take(X1,X2)) -> take(X1,X2)
      from(X) -> cons(X,n__from(s(X)))
      from(X) -> n__from(X)
      head(cons(X,XS)) -> X
      sel(0(),cons(X,XS)) -> X
      sel(s(N),cons(X,XS)) -> sel(N,activate(XS))
      take(X1,X2) -> n__take(X1,X2)
      take(0(),XS) -> nil()
      take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS)))
  - Signature:
      {2nd/1,activate/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,n__from/1,n__take/2,nil/0,s/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {2nd,activate,from,head,sel,take} and constructors {0,cons
      ,n__from,n__take,nil,s}
WORST_CASE(?,O(n^1))