WORST_CASE(?,O(n^2))
* Step 1: NaturalMI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            if_mod(false(),s(x),s(y)) -> s(x)
            if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y))
            le(0(),y) -> true()
            le(s(x),0()) -> false()
            le(s(x),s(y)) -> le(x,y)
            minus(x,0()) -> x
            minus(s(x),s(y)) -> minus(x,y)
            mod(0(),y) -> 0()
            mod(s(x),0()) -> 0()
            mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y))
        - Signature:
            {if_mod/3,le/2,minus/2,mod/2} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {if_mod,le,minus,mod} and constructors {0,false,s,true}
    + Applied Processor:
        NaturalMI {miDimension = 2, miDegree = 2, 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:
          uargs(if_mod) = {1},
          uargs(mod) = {1}
        
        Following symbols are considered usable:
          {if_mod,le,minus,mod}
        TcT has computed the following interpretation:
               p(0) = [0]                      
                      [1]                      
           p(false) = [1]                      
                      [0]                      
          p(if_mod) = [1 1] x1 + [1 0] x2 + [3]
                      [0 0]      [0 1]      [0]
              p(le) = [0 1] x2 + [1]           
                      [0 3]      [0]           
           p(minus) = [1 0] x1 + [2]           
                      [0 1]      [0]           
             p(mod) = [1 4] x1 + [0]           
                      [0 1]      [2]           
               p(s) = [1 4] x1 + [2]           
                      [0 1]      [2]           
            p(true) = [0]                      
                      [0]                      
        
        Following rules are strictly oriented:
        if_mod(false(),s(x),s(y)) = [1 4] x + [6]            
                                    [0 1]     [2]            
                                  > [1 4] x + [2]            
                                    [0 1]     [2]            
                                  = s(x)                     
        
         if_mod(true(),s(x),s(y)) = [1 4] x + [5]            
                                    [0 1]     [2]            
                                  > [1 4] x + [2]            
                                    [0 1]     [2]            
                                  = mod(minus(x,y),s(y))     
        
                        le(0(),y) = [0 1] y + [1]            
                                    [0 3]     [0]            
                                  > [0]                      
                                    [0]                      
                                  = true()                   
        
                     le(s(x),0()) = [2]                      
                                    [3]                      
                                  > [1]                      
                                    [0]                      
                                  = false()                  
        
                    le(s(x),s(y)) = [0 1] y + [3]            
                                    [0 3]     [6]            
                                  > [0 1] y + [1]            
                                    [0 3]     [0]            
                                  = le(x,y)                  
        
                     minus(x,0()) = [1 0] x + [2]            
                                    [0 1]     [0]            
                                  > [1 0] x + [0]            
                                    [0 1]     [0]            
                                  = x                        
        
                 minus(s(x),s(y)) = [1 4] x + [4]            
                                    [0 1]     [2]            
                                  > [1 0] x + [2]            
                                    [0 1]     [0]            
                                  = minus(x,y)               
        
                       mod(0(),y) = [4]                      
                                    [3]                      
                                  > [0]                      
                                    [1]                      
                                  = 0()                      
        
                    mod(s(x),0()) = [1 8] x + [10]           
                                    [0 1]     [4]            
                                  > [0]                      
                                    [1]                      
                                  = 0()                      
        
                   mod(s(x),s(y)) = [1 8] x + [10]           
                                    [0 1]     [4]            
                                  > [1 8] x + [6]            
                                    [0 1]     [2]            
                                  = if_mod(le(y,x),s(x),s(y))
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^2))