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

WORST_CASE(?,O(n^1))