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