WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            flip#1(E()) -> E()
            flip#1(O(x4)) -> Z(flip#1(x4))
            flip#1(Z(x4)) -> O(flip#1(x4))
            main(x0) -> flip#1(x0)
        - Signature:
            {flip#1/1,main/1} / {E/0,O/1,Z/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {flip#1,main} and constructors {E,O,Z}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "E") :: [] -(0)-> "A"(1)
          F (TrsFun "E") :: [] -(0)-> "A"(0)
          F (TrsFun "O") :: ["A"(1)] -(1)-> "A"(1)
          F (TrsFun "O") :: ["A"(0)] -(0)-> "A"(0)
          F (TrsFun "Z") :: ["A"(1)] -(1)-> "A"(1)
          F (TrsFun "Z") :: ["A"(0)] -(0)-> "A"(0)
          F (TrsFun "flip#1") :: ["A"(1)] -(1)-> "A"(0)
          F (TrsFun "main") :: ["A"(1)] -(2)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
        
        

WORST_CASE(?,O(n^1))