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