WORST_CASE(?,O(1))
* Step 1: Ara WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            =(x,y) -> xor(x,xor(y,true()))
            implies(x,y) -> xor(and(x,y),xor(x,true()))
            not(x) -> xor(x,true())
            or(x,y) -> xor(and(x,y),xor(x,y))
        - Signature:
            {=/2,implies/2,not/1,or/2} / {and/2,true/0,xor/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {=,implies,not,or} and constructors {and,true,xor}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          = :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
          and :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          implies :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
          not :: ["A"(0)] -(1)-> "A"(0)
          or :: ["A"(0) x "A"(0)] -(1)-> "A"(0)
          true :: [] -(0)-> "A"(0)
          xor :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "and_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          "true_A" :: [] -(0)-> "A"(0)
          "xor_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
        

WORST_CASE(?,O(1))