WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            @(Cons(x,xs),ys) -> Cons(x,@(xs,ys))
            @(Nil(),ys) -> ys
            equal(Capture(),Capture()) -> True()
            equal(Capture(),Swap()) -> False()
            equal(Swap(),Capture()) -> False()
            equal(Swap(),Swap()) -> True()
            game(p1,p2,Cons(Swap(),xs)) -> game(p2,p1,xs)
            game(p1,p2,Nil()) -> @(p1,p2)
            game(p1,Cons(x',xs'),Cons(Capture(),xs)) -> game(Cons(x',p1),xs',xs)
            goal(p1,p2,moves) -> game(p1,p2,moves)
        - Signature:
            {@/2,equal/2,game/3,goal/3} / {Capture/0,Cons/2,False/0,Nil/0,Swap/0,True/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {@,equal,game,goal} and constructors {Capture,Cons,False
            ,Nil,Swap,True}
    + Applied Processor:
        Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          @ :: ["A"(14) x "A"(8)] -(4)-> "A"(2)
          Capture :: [] -(0)-> "A"(0)
          Capture :: [] -(0)-> "A"(11)
          Cons :: ["A"(14) x "A"(14)] -(14)-> "A"(14)
          Cons :: ["A"(11) x "A"(11)] -(11)-> "A"(11)
          Cons :: ["A"(2) x "A"(2)] -(2)-> "A"(2)
          False :: [] -(0)-> "A"(0)
          Nil :: [] -(0)-> "A"(14)
          Nil :: [] -(0)-> "A"(11)
          Swap :: [] -(0)-> "A"(0)
          Swap :: [] -(0)-> "A"(11)
          True :: [] -(0)-> "A"(0)
          equal :: ["A"(0) x "A"(0)] -(8)-> "A"(0)
          game :: ["A"(14) x "A"(14) x "A"(11)] -(12)-> "A"(0)
          goal :: ["A"(14) x "A"(14) x "A"(12)] -(16)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "Capture_A" :: [] -(0)-> "A"(1)
          "Cons_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
          "False_A" :: [] -(0)-> "A"(1)
          "Nil_A" :: [] -(0)-> "A"(1)
          "Swap_A" :: [] -(0)-> "A"(1)
          "True_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))