WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
            2nd(cons1(X,cons(Y,Z))) -> Y
            activate(X) -> X
            activate(n__from(X)) -> from(activate(X))
            activate(n__s(X)) -> s(activate(X))
            from(X) -> cons(X,n__from(n__s(X)))
            from(X) -> n__from(X)
            s(X) -> n__s(X)
        - Signature:
            {2nd/1,activate/1,from/1,s/1} / {cons/2,cons1/2,n__from/1,n__s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {2nd,activate,from,s} and constructors {cons,cons1,n__from
            ,n__s}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + Details:
        Signatures used:
        ----------------
          2nd :: [A(15)] -(13)-> A(0)
          activate :: [A(9)] -(8)-> A(0)
          cons :: [A(0) x A(15)] -(15)-> A(15)
          cons :: [A(0) x A(0)] -(0)-> A(0)
          cons1 :: [A(0) x A(0)] -(0)-> A(15)
          from :: [A(0)] -(4)-> A(0)
          n__from :: [A(9)] -(9)-> A(9)
          n__from :: [A(0)] -(0)-> A(0)
          n__s :: [A(9)] -(9)-> A(9)
          n__s :: [A(0)] -(0)-> A(0)
          s :: [A(0)] -(4)-> A(0)
        
        
        Cost-free Signatures used:
        --------------------------
          2nd :: [A_cf(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)
          cons1 :: [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__s :: [A_cf(0)] -(0)-> A_cf(0)
          s :: [A_cf(0)] -(0)-> A_cf(0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          cons1_A :: [A(0) x A(0)] -(0)-> A(1)
          cons_A :: [A(0) x A(1)] -(1)-> A(1)
          n__from_A :: [A(0)] -(1)-> A(1)
          n__s_A :: [A(0)] -(1)-> A(1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
        2nd(cons1(X,cons(Y,Z))) -> Y
        activate(X) -> X
        activate(n__from(X)) -> from(activate(X))
        activate(n__s(X)) -> s(activate(X))
        from(X) -> cons(X,n__from(n__s(X)))
        from(X) -> n__from(X)
        s(X) -> n__s(X)
    - Signature:
        {2nd/1,activate/1,from/1,s/1} / {cons/2,cons1/2,n__from/1,n__s/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {2nd,activate,from,s} and constructors {cons,cons1,n__from
        ,n__s}
Following problems could not be solved:
  - Strict TRS:
      2nd(cons(X,X1)) -> 2nd(cons1(X,activate(X1)))
      2nd(cons1(X,cons(Y,Z))) -> Y
      activate(X) -> X
      activate(n__from(X)) -> from(activate(X))
      activate(n__s(X)) -> s(activate(X))
      from(X) -> cons(X,n__from(n__s(X)))
      from(X) -> n__from(X)
      s(X) -> n__s(X)
  - Signature:
      {2nd/1,activate/1,from/1,s/1} / {cons/2,cons1/2,n__from/1,n__s/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {2nd,activate,from,s} and constructors {cons,cons1,n__from
      ,n__s}
WORST_CASE(?,O(n^1))