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

WORST_CASE(?,O(n^1))