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

WORST_CASE(?,O(n^1))