WORST_CASE(?,O(n^2))
* Step 1: Ara WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            activate(X) -> X
            activate(n__f(X)) -> f(X)
            f(X) -> n__f(X)
            f(0()) -> cons(0(),n__f(s(0())))
            f(s(0())) -> f(p(s(0())))
            p(s(X)) -> X
        - Signature:
            {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {activate,f,p} and constructors {0,cons,n__f,s}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> A(13, 13)
          0 :: [] -(0)-> A(7, 15)
          0 :: [] -(0)-> A(7, 13)
          0 :: [] -(0)-> A(15, 15)
          activate :: [A(14, 13)] -(14)-> A(0, 0)
          cons :: [A(0, 1) x A(3, 0)] -(0)-> A(2, 1)
          f :: [A(13, 13)] -(13)-> A(0, 0)
          n__f :: [A(13, 13)] -(0)-> A(14, 13)
          n__f :: [A(10, 10)] -(0)-> A(0, 10)
          n__f :: [A(2, 2)] -(0)-> A(3, 2)
          p :: [A(3, 14)] -(0)-> A(13, 14)
          s :: [A(13, 13)] -(13)-> A(13, 13)
          s :: [A(14, 14)] -(3)-> A(3, 14)
          s :: [A(3, 3)] -(3)-> A(3, 3)
          s :: [A(14, 14)] -(4)-> A(4, 14)
        
        
        Cost-free Signatures used:
        --------------------------
          0 :: [] -(0)-> A_cf(0, 1)
          0 :: [] -(0)-> A_cf(1, 1)
          0 :: [] -(0)-> A_cf(11, 11)
          0 :: [] -(0)-> A_cf(15, 15)
          cons :: [A_cf(0, 0) x A_cf(1, 0)] -(0)-> A_cf(1, 0)
          f :: [A_cf(0, 1)] -(0)-> A_cf(0, 0)
          n__f :: [A_cf(0, 0)] -(0)-> A_cf(1, 0)
          p :: [A_cf(0, 5)] -(0)-> A_cf(4, 5)
          s :: [A_cf(1, 1)] -(0)-> A_cf(0, 1)
          s :: [A_cf(5, 5)] -(0)-> A_cf(0, 5)
          s :: [A_cf(15, 15)] -(0)-> A_cf(0, 15)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          0_A :: [] -(0)-> A(1, 0)
          0_A :: [] -(0)-> A(0, 1)
          cons_A :: [A(0, 0) x A(1, 0)] -(0)-> A(1, 0)
          cons_A :: [A(0, 1) x A(1, 0)] -(0)-> A(0, 1)
          n__f_A :: [A(0)] -(0)-> A(1, 0)
          n__f_A :: [A(0)] -(0)-> A(0, 1)
          s_A :: [A(0, 0)] -(1)-> A(1, 0)
          s_A :: [A(1, 1)] -(0)-> A(0, 1)
        
* Step 2: Open MAYBE
    - Strict TRS:
        activate(X) -> X
        activate(n__f(X)) -> f(X)
        f(X) -> n__f(X)
        f(0()) -> cons(0(),n__f(s(0())))
        f(s(0())) -> f(p(s(0())))
        p(s(X)) -> X
    - Signature:
        {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {activate,f,p} and constructors {0,cons,n__f,s}
Following problems could not be solved:
  - Strict TRS:
      activate(X) -> X
      activate(n__f(X)) -> f(X)
      f(X) -> n__f(X)
      f(0()) -> cons(0(),n__f(s(0())))
      f(s(0())) -> f(p(s(0())))
      p(s(X)) -> X
  - Signature:
      {activate/1,f/1,p/1} / {0/0,cons/2,n__f/1,s/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {activate,f,p} and constructors {0,cons,n__f,s}
WORST_CASE(?,O(n^2))