/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?,O(n^2))
* Step 1: NaturalMI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            b(r(x)) -> r(b(x))
            b(w(x)) -> w(b(x))
            w(r(x)) -> r(w(x))
        - Signature:
            {b/1,w/1} / {r/1}
        - Obligation:
             derivational complexity wrt. signature {b,r,w}
    + Applied Processor:
        NaturalMI {miDimension = 2, miDegree = 2, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just any strict-rules}
    + Details:
        We apply a matrix interpretation of kind triangular matrix interpretation:
        
        Following symbols are considered usable:
          all
        TcT has computed the following interpretation:
          p(b) = [1 0] x1 + [68]
                 [0 1]      [0] 
          p(r) = [1 0] x1 + [0] 
                 [0 1]      [1] 
          p(w) = [1 2] x1 + [4] 
                 [0 1]      [0] 
        
        Following rules are strictly oriented:
        w(r(x)) = [1 2] x + [6]
                  [0 1]     [1]
                > [1 2] x + [4]
                  [0 1]     [1]
                = r(w(x))      
        
        
        Following rules are (at-least) weakly oriented:
        b(r(x)) =  [1 0] x + [68]
                   [0 1]     [1] 
                >= [1 0] x + [68]
                   [0 1]     [1] 
                =  r(b(x))       
        
        b(w(x)) =  [1 2] x + [72]
                   [0 1]     [0] 
                >= [1 2] x + [72]
                   [0 1]     [0] 
                =  w(b(x))       
        
* Step 2: NaturalMI WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            b(r(x)) -> r(b(x))
            b(w(x)) -> w(b(x))
        - Weak TRS:
            w(r(x)) -> r(w(x))
        - Signature:
            {b/1,w/1} / {r/1}
        - Obligation:
             derivational complexity wrt. signature {b,r,w}
    + Applied Processor:
        NaturalMI {miDimension = 2, miDegree = 2, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just any strict-rules}
    + Details:
        We apply a matrix interpretation of kind triangular matrix interpretation:
        
        Following symbols are considered usable:
          all
        TcT has computed the following interpretation:
          p(b) = [1 48] x1 + [7]  
                 [0  1]      [1]  
          p(r) = [1 0] x1 + [164] 
                 [0 1]      [2]   
          p(w) = [1 40] x1 + [140]
                 [0  1]      [8]  
        
        Following rules are strictly oriented:
        b(r(x)) = [1 48] x + [267]
                  [0  1]     [3]  
                > [1 48] x + [171]
                  [0  1]     [3]  
                = r(b(x))         
        
        b(w(x)) = [1 88] x + [531]
                  [0  1]     [9]  
                > [1 88] x + [187]
                  [0  1]     [9]  
                = w(b(x))         
        
        
        Following rules are (at-least) weakly oriented:
        w(r(x)) =  [1 40] x + [384]
                   [0  1]     [10] 
                >= [1 40] x + [304]
                   [0  1]     [10] 
                =  r(w(x))         
        
* Step 3: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            b(r(x)) -> r(b(x))
            b(w(x)) -> w(b(x))
            w(r(x)) -> r(w(x))
        - Signature:
            {b/1,w/1} / {r/1}
        - Obligation:
             derivational complexity wrt. signature {b,r,w}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^2))