WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a(b(x)) -> b(a(x))
            a(c(x)) -> x
        - Signature:
            {a/1} / {b/1,c/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {a} and constructors {b,c}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          a :: ["A"(1)] -(0)-> "A"(0)
          b :: ["A"(1)] -(1)-> "A"(1)
          b :: ["A"(0)] -(0)-> "A"(0)
          c :: ["A"(1)] -(1)-> "A"(1)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "b_A" :: ["A"(0)] -(0)-> "A"(0)
          "c_A" :: ["A"(0)] -(0)-> "A"(0)
        

WORST_CASE(?,O(n^1))