WORST_CASE(?,O(n^1))
* Step 1: NaturalMI 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:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation:
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {gcd}
        TcT has computed the following interpretation:
            p(-) = [1] x2 + [2]          
            p(0) = [1]                   
            p(<) = [2]                   
          p(gcd) = [10] x1 + [1] x2 + [1]
           p(if) = [0]                   
            p(s) = [1] x1 + [0]          
        
        Following rules are strictly oriented:
            gcd(x,0()) = [10] x + [2]                                
                       > [1] x + [0]                                 
                       = x                                           
        
            gcd(0(),y) = [1] y + [11]                                
                       > [1] y + [0]                                 
                       = y                                           
        
        gcd(s(x),s(y)) = [10] x + [1] y + [1]                        
                       > [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))