WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            U11(tt(),M,N) -> U12(tt(),activate(M),activate(N))
            U12(tt(),M,N) -> s(plus(activate(N),activate(M)))
            activate(X) -> X
            plus(N,0()) -> N
            plus(N,s(M)) -> U11(tt(),M,N)
        - Signature:
            {U11/3,U12/3,activate/1,plus/2} / {0/0,s/1,tt/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {U11,U12,activate,plus} and constructors {0,s,tt}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(7)
          U11 :: ["A"(0) x "A"(7) x "A"(7)] -(7)-> "A"(0)
          U12 :: ["A"(0) x "A"(7) x "A"(7)] -(4)-> "A"(0)
          activate :: ["A"(7)] -(1)-> "A"(7)
          plus :: ["A"(7) x "A"(7)] -(1)-> "A"(0)
          s :: ["A"(7)] -(7)-> "A"(7)
          s :: ["A"(0)] -(0)-> "A"(0)
          tt :: [] -(0)-> "A"(0)
        
        
        Cost-free Signatures used:
        --------------------------
        
        
        
        Base Constructor Signatures used:
        ---------------------------------
          "0_A" :: [] -(0)-> "A"(0)
          "s_A" :: ["A"(0)] -(0)-> "A"(0)
          "tt_A" :: [] -(0)-> "A"(0)
        

WORST_CASE(?,O(n^1))