WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            implies(x,or(y,z)) -> or(y,implies(x,z))
            implies(not(x),y) -> or(x,y)
            implies(not(x),or(y,z)) -> implies(y,or(x,z))
        - Signature:
            {implies/2} / {not/1,or/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {implies} and constructors {not,or}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          implies :: ["A"(15) x "A"(15)] -(9)-> "A"(1)
          not :: ["A"(15)] -(15)-> "A"(15)
          or :: ["A"(15) x "A"(15)] -(15)-> "A"(15)
          or :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "not_A" :: ["A"(1)] -(1)-> "A"(1)
          "or_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))