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

WORST_CASE(?,O(1))