/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:
            g(x,h(y,z)) -> h(g(x,y),z)
            g(f(x,y),z) -> f(x,g(y,z))
            g(h(x,y),z) -> g(x,f(y,z))
        - Signature:
            {g/2} / {f/2,h/2}
        - Obligation:
             derivational complexity wrt. signature {f,g,h}
    + Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 1, 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(f) = [1] x1 + [1] x2 + [0]
          p(g) = [1] x1 + [1] x2 + [0]
          p(h) = [1] x1 + [1] x2 + [2]
        
        Following rules are strictly oriented:
        g(h(x,y),z) = [1] x + [1] y + [1] z + [2]
                    > [1] x + [1] y + [1] z + [0]
                    = g(x,f(y,z))                
        
        
        Following rules are (at-least) weakly oriented:
        g(x,h(y,z)) =  [1] x + [1] y + [1] z + [2]
                    >= [1] x + [1] y + [1] z + [2]
                    =  h(g(x,y),z)                
        
        g(f(x,y),z) =  [1] x + [1] y + [1] z + [0]
                    >= [1] x + [1] y + [1] z + [0]
                    =  f(x,g(y,z))                
        
* Step 2: NaturalMI.  WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            g(x,h(y,z)) -> h(g(x,y),z)
            g(f(x,y),z) -> f(x,g(y,z))
        - Weak TRS:
            g(h(x,y),z) -> g(x,f(y,z))
        - Signature:
            {g/2} / {f/2,h/2}
        - Obligation:
             derivational complexity wrt. signature {f,g,h}
    + 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(f) = [1 4] x1 + [1 0] x2 + [1]
                 [0 0]      [0 1]      [2]
          p(g) = [1 4] x1 + [1 0] x2 + [0]
                 [0 1]      [0 0]      [0]
          p(h) = [1 0] x1 + [1 4] x2 + [1]
                 [0 1]      [0 0]      [0]
        
        Following rules are strictly oriented:
        g(f(x,y),z) = [1 4] x + [1 4] y + [1 0] z + [9]
                      [0 0]     [0 1]     [0 0]     [2]
                    > [1 4] x + [1 4] y + [1 0] z + [1]
                      [0 0]     [0 1]     [0 0]     [2]
                    = f(x,g(y,z))                      
        
        
        Following rules are (at-least) weakly oriented:
        g(x,h(y,z)) =  [1 4] x + [1 0] y + [1 4] z + [1]
                       [0 1]     [0 0]     [0 0]     [0]
                    >= [1 4] x + [1 0] y + [1 4] z + [1]
                       [0 1]     [0 0]     [0 0]     [0]
                    =  h(g(x,y),z)                      
        
        g(h(x,y),z) =  [1 4] x + [1 4] y + [1 0] z + [1]
                       [0 1]     [0 0]     [0 0]     [0]
                    >= [1 4] x + [1 4] y + [1 0] z + [1]
                       [0 1]     [0 0]     [0 0]     [0]
                    =  g(x,f(y,z))                      
        
* Step 3: NaturalMI.  WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            g(x,h(y,z)) -> h(g(x,y),z)
        - Weak TRS:
            g(f(x,y),z) -> f(x,g(y,z))
            g(h(x,y),z) -> g(x,f(y,z))
        - Signature:
            {g/2} / {f/2,h/2}
        - Obligation:
             derivational complexity wrt. signature {f,g,h}
    + 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(f) = [1 0] x1 + [1 0] x2 + [2]
                 [0 0]      [0 1]      [0]
          p(g) = [1 1] x1 + [1 3] x2 + [4]
                 [0 0]      [0 1]      [2]
          p(h) = [1 4] x1 + [1 1] x2 + [0]
                 [0 1]      [0 0]      [3]
        
        Following rules are strictly oriented:
        g(x,h(y,z)) = [1 1] x + [1 7] y + [1 1] z + [13]
                      [0 0]     [0 1]     [0 0]     [5] 
                    > [1 1] x + [1 7] y + [1 1] z + [12]
                      [0 0]     [0 1]     [0 0]     [5] 
                    = h(g(x,y),z)                       
        
        
        Following rules are (at-least) weakly oriented:
        g(f(x,y),z) =  [1 0] x + [1 1] y + [1 3] z + [6]
                       [0 0]     [0 0]     [0 1]     [2]
                    >= [1 0] x + [1 1] y + [1 3] z + [6]
                       [0 0]     [0 0]     [0 1]     [2]
                    =  f(x,g(y,z))                      
        
        g(h(x,y),z) =  [1 5] x + [1 1] y + [1 3] z + [7]
                       [0 0]     [0 0]     [0 1]     [2]
                    >= [1 1] x + [1 0] y + [1 3] z + [6]
                       [0 0]     [0 0]     [0 1]     [2]
                    =  g(x,f(y,z))                      
        
* Step 4: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            g(x,h(y,z)) -> h(g(x,y),z)
            g(f(x,y),z) -> f(x,g(y,z))
            g(h(x,y),z) -> g(x,f(y,z))
        - Signature:
            {g/2} / {f/2,h/2}
        - Obligation:
             derivational complexity wrt. signature {f,g,h}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^2))