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 {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          E :: [] -(0)-> "A"(8)
          E :: [] -(0)-> "A"(14)
          O :: ["A"(8)] -(8)-> "A"(8)
          O :: ["A"(4)] -(4)-> "A"(4)
          Z :: ["A"(8)] -(8)-> "A"(8)
          Z :: ["A"(4)] -(4)-> "A"(4)
          flip#1 :: ["A"(8)] -(8)-> "A"(4)
          main :: ["A"(14)] -(16)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "E_A" :: [] -(0)-> "A"(1)
          "O_A" :: ["A"(1)] -(1)-> "A"(1)
          "Z_A" :: ["A"(1)] -(1)-> "A"(1)
        

WORST_CASE(?,O(n^1))