WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(0(),y) -> 0()
            f(s(x),y) -> f(f(x,y),y)
        - Signature:
            {f/2} / {0/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f} and constructors {0,s}
    + Applied Processor:
        Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> A(9)
          f :: [A(9) x A(0)] -(1)-> A(9)
          s :: [A(9)] -(9)-> A(9)
        
        
        Cost-free Signatures used:
        --------------------------
          0 :: [] -(0)-> A_cf(0)
          f :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
          s :: [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:
        f(0(),y) -> 0()
        f(s(x),y) -> f(f(x,y),y)
    - Signature:
        {f/2} / {0/0,s/1}
    - Obligation:
        innermost runtime complexity wrt. defined symbols {f} and constructors {0,s}
Following problems could not be solved:
  - Strict TRS:
      f(0(),y) -> 0()
      f(s(x),y) -> f(f(x,y),y)
  - Signature:
      {f/2} / {0/0,s/1}
  - Obligation:
      innermost runtime complexity wrt. defined symbols {f} and constructors {0,s}
WORST_CASE(?,O(n^1))