/export/starexec/sandbox/solver/bin/starexec_run_tct_dci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


WORST_CASE(?,O(n^1))
* Step 1: WeightGap.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a(c(c(c(x1)))) -> d(d(x1))
            b(d(x1)) -> c(c(x1))
            c(x1) -> a(a(a(a(x1))))
            c(c(c(a(x1)))) -> d(d(x1))
            d(x1) -> b(b(b(b(x1))))
            d(b(x1)) -> c(c(x1))
        - Signature:
            {a/1,b/1,c/1,d/1} / {}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b,c,d}
    + Applied Processor:
        WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = NoUArgs, wgOn = WgOnAny}
    + Details:
        The weightgap principle applies using the following nonconstant growth matrix-interpretation:
          We apply a matrix interpretation of kind triangular matrix interpretation:
          
          Following symbols are considered usable:
            all
          TcT has computed the following interpretation:
            p(a) = [1] x1 + [0]
            p(b) = [1] x1 + [1]
            p(c) = [1] x1 + [0]
            p(d) = [1] x1 + [8]
          
          Following rules are strictly oriented:
          b(d(x1)) = [1] x1 + [9]  
                   > [1] x1 + [0]  
                   = c(c(x1))      
          
             d(x1) = [1] x1 + [8]  
                   > [1] x1 + [4]  
                   = b(b(b(b(x1))))
          
          d(b(x1)) = [1] x1 + [9]  
                   > [1] x1 + [0]  
                   = c(c(x1))      
          
          
          Following rules are (at-least) weakly oriented:
          a(c(c(c(x1)))) =  [1] x1 + [0]  
                         >= [1] x1 + [16] 
                         =  d(d(x1))      
          
                   c(x1) =  [1] x1 + [0]  
                         >= [1] x1 + [0]  
                         =  a(a(a(a(x1))))
          
          c(c(c(a(x1)))) =  [1] x1 + [0]  
                         >= [1] x1 + [16] 
                         =  d(d(x1))      
          
        Further, it can be verified that all rules not oriented are covered by the weightgap condition.
* Step 2: WeightGap.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a(c(c(c(x1)))) -> d(d(x1))
            c(x1) -> a(a(a(a(x1))))
            c(c(c(a(x1)))) -> d(d(x1))
        - Weak TRS:
            b(d(x1)) -> c(c(x1))
            d(x1) -> b(b(b(b(x1))))
            d(b(x1)) -> c(c(x1))
        - Signature:
            {a/1,b/1,c/1,d/1} / {}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b,c,d}
    + Applied Processor:
        WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = NoUArgs, wgOn = WgOnAny}
    + Details:
        The weightgap principle applies using the following nonconstant growth matrix-interpretation:
          We apply a matrix interpretation of kind triangular matrix interpretation:
          
          Following symbols are considered usable:
            all
          TcT has computed the following interpretation:
            p(a) = [1] x1 + [3]
            p(b) = [1] x1 + [0]
            p(c) = [1] x1 + [0]
            p(d) = [1] x1 + [0]
          
          Following rules are strictly oriented:
          a(c(c(c(x1)))) = [1] x1 + [3]
                         > [1] x1 + [0]
                         = d(d(x1))    
          
          c(c(c(a(x1)))) = [1] x1 + [3]
                         > [1] x1 + [0]
                         = d(d(x1))    
          
          
          Following rules are (at-least) weakly oriented:
          b(d(x1)) =  [1] x1 + [0]  
                   >= [1] x1 + [0]  
                   =  c(c(x1))      
          
             c(x1) =  [1] x1 + [0]  
                   >= [1] x1 + [12] 
                   =  a(a(a(a(x1))))
          
             d(x1) =  [1] x1 + [0]  
                   >= [1] x1 + [0]  
                   =  b(b(b(b(x1))))
          
          d(b(x1)) =  [1] x1 + [0]  
                   >= [1] x1 + [0]  
                   =  c(c(x1))      
          
        Further, it can be verified that all rules not oriented are covered by the weightgap condition.
* Step 3: NaturalMI.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            c(x1) -> a(a(a(a(x1))))
        - Weak TRS:
            a(c(c(c(x1)))) -> d(d(x1))
            b(d(x1)) -> c(c(x1))
            c(c(c(a(x1)))) -> d(d(x1))
            d(x1) -> b(b(b(b(x1))))
            d(b(x1)) -> c(c(x1))
        - Signature:
            {a/1,b/1,c/1,d/1} / {}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b,c,d}
    + 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(a) = [1] x1 + [1]
          p(b) = [1] x1 + [2]
          p(c) = [1] x1 + [5]
          p(d) = [1] x1 + [8]
        
        Following rules are strictly oriented:
        c(x1) = [1] x1 + [5]  
              > [1] x1 + [4]  
              = a(a(a(a(x1))))
        
        
        Following rules are (at-least) weakly oriented:
        a(c(c(c(x1)))) =  [1] x1 + [16] 
                       >= [1] x1 + [16] 
                       =  d(d(x1))      
        
              b(d(x1)) =  [1] x1 + [10] 
                       >= [1] x1 + [10] 
                       =  c(c(x1))      
        
        c(c(c(a(x1)))) =  [1] x1 + [16] 
                       >= [1] x1 + [16] 
                       =  d(d(x1))      
        
                 d(x1) =  [1] x1 + [8]  
                       >= [1] x1 + [8]  
                       =  b(b(b(b(x1))))
        
              d(b(x1)) =  [1] x1 + [10] 
                       >= [1] x1 + [10] 
                       =  c(c(x1))      
        
* Step 4: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a(c(c(c(x1)))) -> d(d(x1))
            b(d(x1)) -> c(c(x1))
            c(x1) -> a(a(a(a(x1))))
            c(c(c(a(x1)))) -> d(d(x1))
            d(x1) -> b(b(b(b(x1))))
            d(b(x1)) -> c(c(x1))
        - Signature:
            {a/1,b/1,c/1,d/1} / {}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b,c,d}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))