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