WORST_CASE(?,O(n^1))
* Step 1: NaturalPI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            gcd(x,0()) -> x
            gcd(0(),y) -> y
            gcd(s(x),s(y)) -> if(<(x,y),gcd(s(x),-(y,x)),gcd(-(x,y),s(y)))
        - Signature:
            {gcd/2} / {-/2,0/0,</2,if/3,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {gcd} and constructors {-,0,<,if,s}
    + Applied Processor:
        NaturalPI {shape = StronglyLinear, restrict = NoRestrict, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a polynomial interpretation of kind constructor-based(stronglyLinear):
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {gcd}
        TcT has computed the following interpretation:
            p(-) = 7          
            p(0) = 4          
            p(<) = 1          
          p(gcd) = 5 + x1 + x2
           p(if) = 0          
            p(s) = 1 + x1     
        
        Following rules are strictly oriented:
            gcd(x,0()) = 9 + x                                       
                       > x                                           
                       = x                                           
        
            gcd(0(),y) = 9 + y                                       
                       > y                                           
                       = y                                           
        
        gcd(s(x),s(y)) = 7 + x + y                                   
                       > 0                                           
                       = if(<(x,y),gcd(s(x),-(y,x)),gcd(-(x,y),s(y)))
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))