WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            anchored(Cons(x,xs),y) -> anchored(xs,Cons(Cons(Nil(),Nil()),y))
            anchored(Nil(),y) -> y
            goal(x,y) -> anchored(x,y)
        - Signature:
            {anchored/2,goal/2} / {Cons/2,Nil/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {anchored,goal} and constructors {Cons,Nil}
    + Applied Processor:
        Ara {minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          F (TrsFun "Cons") :: ["A"(0) x "A"(2)] -(2)-> "A"(2)
          F (TrsFun "Cons") :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
          F (TrsFun "Nil") :: [] -(0)-> "A"(2)
          F (TrsFun "Nil") :: [] -(0)-> "A"(14)
          F (TrsFun "Nil") :: [] -(0)-> "A"(10)
          F (TrsFun "anchored") :: ["A"(2) x "A"(0)] -(14)-> "A"(0)
          F (TrsFun "goal") :: ["A"(6) x "A"(8)] -(15)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "F (TrsFun \"Cons\")_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1)
          "F (TrsFun \"Nil\")_A" :: [] -(0)-> "A"(1)
        

WORST_CASE(?,O(n^1))