WORST_CASE(?,O(n^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            b(x,b(z,y)) -> f(b(f(f(z)),c(x,z,y)))
            b(y,z) -> z
            f(c(a(),z,x)) -> b(a(),z)
        - Signature:
            {b/2,f/1} / {a/0,c/3}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {b,f} and constructors {a,c}
    + Applied Processor:
        NaturalMI {miDimension = 2, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation (containing no more than 1 non-zero interpretation-entries in the diagonal of the component-wise maxima):
        The following argument positions are considered usable:
          uargs(b) = {1},
          uargs(f) = {1}
        
        Following symbols are considered usable:
          {b,f}
        TcT has computed the following interpretation:
          p(a) = [0]                      
                 [0]                      
          p(b) = [4 1] x1 + [1 1] x2 + [2]
                 [3 0]      [2 2]      [3]
          p(c) = [1 1] x2 + [1 1] x3 + [3]
                 [0 0]      [0 0]      [1]
          p(f) = [1 0] x1 + [0]           
                 [2 0]      [0]           
        
        Following rules are strictly oriented:
          b(x,b(z,y)) = [4 1] x + [3 3] y + [ 7 1] z + [7] 
                        [3 0]     [6 6]     [14 2]     [13]
                      > [1 1] y + [ 7 1] z + [6]           
                        [2 2]     [14 2]     [12]          
                      = f(b(f(f(z)),c(x,z,y)))             
        
               b(y,z) = [4 1] y + [1 1] z + [2]            
                        [3 0]     [2 2]     [3]            
                      > [1 0] z + [0]                      
                        [0 1]     [0]                      
                      = z                                  
        
        f(c(a(),z,x)) = [1 1] x + [1 1] z + [3]            
                        [2 2]     [2 2]     [6]            
                      > [1 1] z + [2]                      
                        [2 2]     [3]                      
                      = b(a(),z)                           
        
        
        Following rules are (at-least) weakly oriented:
        

WORST_CASE(?,O(n^1))