WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            deleteMin#1(E()) -> ErrorHeap()
            deleteMin#1(T(E(),x6,x8)) -> x8
            deleteMin#1(T(T(E(),x24,x28),x12,x16)) -> T(x28,x12,x16)
            deleteMin#1(T(T(T(x32,x36,x40),x24,x28),x12,x16)) -> T(deleteMin#1(T(x32,x36,x40)),x24,T(x28,x12,x16))
            main(x0) -> deleteMin#1(x0)
        - Signature:
            {deleteMin#1/1,main/1} / {E/0,ErrorHeap/0,T/3}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {deleteMin#1,main} and constructors {E,ErrorHeap,T}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          E :: [] -(0)-> "A"(2)
          ErrorHeap :: [] -(0)-> "A"(14)
          T :: ["A"(2) x "A"(2) x "A"(2)] -(2)-> "A"(2)
          T :: ["A"(1) x "A"(1) x "A"(1)] -(1)-> "A"(1)
          T :: ["A"(0) x "A"(0) x "A"(0)] -(0)-> "A"(0)
          deleteMin#1 :: ["A"(2)] -(10)-> "A"(0)
          main :: ["A"(14)] -(12)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "E_A" :: [] -(0)-> "A"(1)
          "ErrorHeap_A" :: [] -(0)-> "A"(1)
          "T_A" :: ["A"(1) x "A"(1) x "A"(1)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))