WORST_CASE(?,O(n^1))
* Step 1: Ara WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(x1,0()) -> g(x1,0())
            f(y,S(x)) -> f(S(y),x)
            g(0(),x2) -> x2
            g(S(x),y) -> g(x,S(y))
        - Signature:
            {f/2,g/2} / {0/0,S/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,S}
    + Applied Processor:
        Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing}
    + Details:
        Signatures used:
        ----------------
          0 :: [] -(0)-> "A"(2)
          0 :: [] -(0)-> "A"(1)
          0 :: [] -(0)-> "A"(0)
          S :: ["A"(2)] -(2)-> "A"(2)
          S :: ["A"(1)] -(1)-> "A"(1)
          S :: ["A"(0)] -(0)-> "A"(0)
          f :: ["A"(1) x "A"(2)] -(2)-> "A"(0)
          g :: ["A"(1) x "A"(0)] -(1)-> "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))