/export/starexec/sandbox2/solver/bin/starexec_run_tct_dci /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:
            +(x,+(y,z)) -> +(+(x,y),z)
            +(*(x,y),+(x,z)) -> *(x,+(y,z))
            +(*(x,y),+(*(x,z),u)) -> +(*(x,+(y,z)),u)
        - Signature:
            {+/2} / {*/2}
        - Obligation:
            innermost derivational complexity wrt. signature {*,+}
    + 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(*) = [1] x1 + [1] x2 + [2]
          p(+) = [1] x1 + [1] x2 + [0]
        
        Following rules are strictly oriented:
        +(*(x,y),+(*(x,z),u)) = [1] u + [2] x + [1] y + [1] z + [4]
                              > [1] u + [1] x + [1] y + [1] z + [2]
                              = +(*(x,+(y,z)),u)                   
        
        
        Following rules are (at-least) weakly oriented:
             +(x,+(y,z)) =  [1] x + [1] y + [1] z + [0]
                         >= [1] x + [1] y + [1] z + [0]
                         =  +(+(x,y),z)                
        
        +(*(x,y),+(x,z)) =  [2] x + [1] y + [1] z + [2]
                         >= [1] x + [1] y + [1] z + [2]
                         =  *(x,+(y,z))                
        
* Step 2: NaturalMI.  WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            +(x,+(y,z)) -> +(+(x,y),z)
            +(*(x,y),+(x,z)) -> *(x,+(y,z))
        - Weak TRS:
            +(*(x,y),+(*(x,z),u)) -> +(*(x,+(y,z)),u)
        - Signature:
            {+/2} / {*/2}
        - Obligation:
            innermost derivational complexity wrt. signature {*,+}
    + 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(*) = [1] x1 + [1] x2 + [0]
          p(+) = [1] x1 + [1] x2 + [8]
        
        Following rules are strictly oriented:
        +(*(x,y),+(x,z)) = [2] x + [1] y + [1] z + [16]
                         > [1] x + [1] y + [1] z + [8] 
                         = *(x,+(y,z))                 
        
        
        Following rules are (at-least) weakly oriented:
                  +(x,+(y,z)) =  [1] x + [1] y + [1] z + [16]        
                              >= [1] x + [1] y + [1] z + [16]        
                              =  +(+(x,y),z)                         
        
        +(*(x,y),+(*(x,z),u)) =  [1] u + [2] x + [1] y + [1] z + [16]
                              >= [1] u + [1] x + [1] y + [1] z + [16]
                              =  +(*(x,+(y,z)),u)                    
        
* Step 3: NaturalMI.  WORST_CASE(?,O(n^2))
    + Considered Problem:
        - Strict TRS:
            +(x,+(y,z)) -> +(+(x,y),z)
        - Weak TRS:
            +(*(x,y),+(x,z)) -> *(x,+(y,z))
            +(*(x,y),+(*(x,z),u)) -> +(*(x,+(y,z)),u)
        - Signature:
            {+/2} / {*/2}
        - Obligation:
            innermost derivational complexity wrt. signature {*,+}
    + 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(*) = [1 1] x1 + [1 1] x2 + [0]
                 [0 0]      [0 1]      [1]
          p(+) = [1 0] x1 + [1 2] x2 + [0]
                 [0 1]      [0 1]      [5]
        
        Following rules are strictly oriented:
        +(x,+(y,z)) = [1 0] x + [1 2] y + [1 4] z + [10]
                      [0 1]     [0 1]     [0 1]     [10]
                    > [1 0] x + [1 2] y + [1 2] z + [0] 
                      [0 1]     [0 1]     [0 1]     [10]
                    = +(+(x,y),z)                       
        
        
        Following rules are (at-least) weakly oriented:
             +(*(x,y),+(x,z)) =  [2 3] x + [1 1] y + [1 4] z + [10]          
                                 [0 1]     [0 1]     [0 1]     [11]          
                              >= [1 1] x + [1 1] y + [1 3] z + [5]           
                                 [0 0]     [0 1]     [0 1]     [6]           
                              =  *(x,+(y,z))                                 
        
        +(*(x,y),+(*(x,z),u)) =  [1 4] u + [2 2] x + [1 1] y + [1 3] z + [12]
                                 [0 1]     [0 0]     [0 1]     [0 1]     [12]
                              >= [1 2] u + [1 1] x + [1 1] y + [1 3] z + [5] 
                                 [0 1]     [0 0]     [0 1]     [0 1]     [11]
                              =  +(*(x,+(y,z)),u)                            
        
* Step 4: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            +(x,+(y,z)) -> +(+(x,y),z)
            +(*(x,y),+(x,z)) -> *(x,+(y,z))
            +(*(x,y),+(*(x,z),u)) -> +(*(x,+(y,z)),u)
        - Signature:
            {+/2} / {*/2}
        - Obligation:
            innermost derivational complexity wrt. signature {*,+}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^2))