WORST_CASE(?,O(n^2))
* Step 1: Ara WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            a__f(X) -> f(X)
            a__f(0()) -> cons(0(),f(s(0())))
            a__f(s(0())) -> a__f(a__p(s(0())))
            a__p(X) -> p(X)
            a__p(s(0())) -> 0()
            mark(0()) -> 0()
            mark(cons(X1,X2)) -> cons(mark(X1),X2)
            mark(f(X)) -> a__f(mark(X))
            mark(p(X)) -> a__p(mark(X))
            mark(s(X)) -> s(mark(X))
        - Signature:
            {a__f/1,a__p/1,mark/1} / {0/0,cons/2,f/1,p/1,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a__f,a__p,mark} and constructors {0,cons,f,p,s}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = Z3}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> A(6, 0)
          0 :: [] -(0)-> A(0, 0)
          0 :: [] -(0)-> A(9, 9)
          0 :: [] -(0)-> A(7, 13)
          0 :: [] -(0)-> A(7, 15)
          0 :: [] -(0)-> A(15, 7)
          0 :: [] -(0)-> A(13, 7)
          a__f :: [A(6, 0)] -(2)-> A(6, 0)
          a__p :: [A(0, 0)] -(1)-> A(8, 0)
          cons :: [A(9, 9) x A(9, 9)] -(9)-> A(9, 9)
          cons :: [A(0, 0) x A(0, 0)] -(0)-> A(14, 0)
          cons :: [A(0, 0) x A(0, 0)] -(0)-> A(6, 0)
          f :: [A(9, 9)] -(9)-> A(9, 9)
          f :: [A(0, 0)] -(0)-> A(14, 0)
          f :: [A(0, 0)] -(0)-> A(0, 0)
          mark :: [A(9, 9)] -(5)-> A(6, 0)
          p :: [A(9, 9)] -(9)-> A(9, 9)
          p :: [A(0, 0)] -(0)-> A(8, 0)
          s :: [A(0, 0)] -(6)-> A(6, 0)
          s :: [A(0, 0)] -(0)-> A(0, 0)
          s :: [A(9, 9)] -(9)-> A(9, 9)
          s :: [A(1, 1)] -(1)-> A(1, 1)
        
        
        Cost-free Signatures used:
        --------------------------
          0 :: [] -(0)-> A_cf(1, 0)
          0 :: [] -(0)-> A_cf(0, 0)
          0 :: [] -(0)-> A_cf(3, 11)
          0 :: [] -(0)-> A_cf(6, 3)
          0 :: [] -(0)-> A_cf(4, 11)
          a__f :: [A_cf(1, 0)] -(0)-> A_cf(0, 0)
          a__f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          a__p :: [A_cf(0, 0)] -(0)-> A_cf(4, 0)
          a__p :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          cons :: [A_cf(0, 0) x A_cf(0, 0)] -(0)-> A_cf(0, 0)
          f :: [A_cf(0, 0)] -(0)-> A_cf(8, 0)
          f :: [A_cf(0, 0)] -(0)-> A_cf(14, 0)
          f :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          mark :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          p :: [A_cf(0, 0)] -(0)-> A_cf(4, 0)
          p :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
          s :: [A_cf(0, 0)] -(1)-> A_cf(1, 0)
          s :: [A_cf(0, 0)] -(0)-> A_cf(0, 0)
        
        
        Base Constructor Signatures used:
        ---------------------------------
          0_A :: [] -(0)-> A(1, 0)
          0_A :: [] -(0)-> A(0, 1)
          cons_A :: [A(0, 0) x A(0, 0)] -(0)-> A(1, 0)
          cons_A :: [A(1, 1) x A(1, 1)] -(1)-> A(0, 1)
          f_A :: [A(0, 0)] -(0)-> A(1, 0)
          f_A :: [A(1, 1)] -(1)-> A(0, 1)
          p_A :: [A(0, 0)] -(0)-> A(1, 0)
          p_A :: [A(1, 1)] -(1)-> 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:
        a__f(X) -> f(X)
        a__f(0()) -> cons(0(),f(s(0())))
        a__f(s(0())) -> a__f(a__p(s(0())))
        a__p(X) -> p(X)
        a__p(s(0())) -> 0()
        mark(0()) -> 0()
        mark(cons(X1,X2)) -> cons(mark(X1),X2)
        mark(f(X)) -> a__f(mark(X))
        mark(p(X)) -> a__p(mark(X))
        mark(s(X)) -> s(mark(X))
    - Signature:
        {a__f/1,a__p/1,mark/1} / {0/0,cons/2,f/1,p/1,s/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {a__f,a__p,mark} and constructors {0,cons,f,p,s}
Following problems could not be solved:
  - Strict TRS:
      a__f(X) -> f(X)
      a__f(0()) -> cons(0(),f(s(0())))
      a__f(s(0())) -> a__f(a__p(s(0())))
      a__p(X) -> p(X)
      a__p(s(0())) -> 0()
      mark(0()) -> 0()
      mark(cons(X1,X2)) -> cons(mark(X1),X2)
      mark(f(X)) -> a__f(mark(X))
      mark(p(X)) -> a__p(mark(X))
      mark(s(X)) -> s(mark(X))
  - Signature:
      {a__f/1,a__p/1,mark/1} / {0/0,cons/2,f/1,p/1,s/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {a__f,a__p,mark} and constructors {0,cons,f,p,s}
WORST_CASE(?,O(n^2))