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
            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,game/3,goal/3} / {Capture/0,Cons/2,Nil/0,Swap/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {@,game,goal} and constructors {Capture,Cons,Nil,Swap}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "@") :: ["A"(13) x "A"(14)] -(1)-> "A"(0)
          F (TrsFun "Capture") :: [] -(0)-> "A"(0)
          F (TrsFun "Cons") :: ["A"(0) x "A"(13)] -(13)-> "A"(13)
          F (TrsFun "Cons") :: ["A"(0) x "A"(15)] -(15)-> "A"(15)
          F (TrsFun "Cons") :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          F (TrsFun "Nil") :: [] -(0)-> "A"(13)
          F (TrsFun "Nil") :: [] -(0)-> "A"(15)
          F (TrsFun "Swap") :: [] -(0)-> "A"(0)
          F (TrsFun "game") :: ["A"(15) x "A"(15) x "A"(15)] -(4)-> "A"(0)
          F (TrsFun "goal") :: ["A"(15) x "A"(15) x "A"(15)] -(9)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "F (TrsFun \"Capture\")_A" :: [] -(0)-> "A"(1)
          "F (TrsFun \"Cons\")_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "F (TrsFun \"Nil\")_A" :: [] -(0)-> "A"(1)
          "F (TrsFun \"Swap\")_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))