/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /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:
            f(x) -> g(x)
            f(a()) -> f(b())
            g(b()) -> g(a())
        - Signature:
            {f/1,g/1} / {a/0,b/0}
        - Obligation:
             derivational complexity wrt. signature {a,b,f,g}
    + 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) = [0]         
            p(b) = [9]         
            p(f) = [1] x1 + [0]
            p(g) = [1] x1 + [0]
          
          Following rules are strictly oriented:
          g(b()) = [9]   
                 > [0]   
                 = g(a())
          
          
          Following rules are (at-least) weakly oriented:
            f(x) =  [1] x + [0]
                 >= [1] x + [0]
                 =  g(x)       
          
          f(a()) =  [0]        
                 >= [9]        
                 =  f(b())     
          
        Further, it can be verified that all rules not oriented are covered by the weightgap condition.
* Step 2: NaturalMI.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(x) -> g(x)
            f(a()) -> f(b())
        - Weak TRS:
            g(b()) -> g(a())
        - Signature:
            {f/1,g/1} / {a/0,b/0}
        - Obligation:
             derivational complexity wrt. signature {a,b,f,g}
    + 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) = [2]         
          p(b) = [2]         
          p(f) = [1] x1 + [2]
          p(g) = [1] x1 + [1]
        
        Following rules are strictly oriented:
        f(x) = [1] x + [2]
             > [1] x + [1]
             = g(x)       
        
        
        Following rules are (at-least) weakly oriented:
        f(a()) =  [4]   
               >= [4]   
               =  f(b())
        
        g(b()) =  [3]   
               >= [3]   
               =  g(a())
        
* Step 3: NaturalMI.  WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            f(a()) -> f(b())
        - Weak TRS:
            f(x) -> g(x)
            g(b()) -> g(a())
        - Signature:
            {f/1,g/1} / {a/0,b/0}
        - Obligation:
             derivational complexity wrt. signature {a,b,f,g}
    + Applied Processor:
        NaturalMI {miDimension = 2, miDegree = 1, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Just any strict-rules}
    + Details:
        We apply a matrix interpretation of kind triangular matrix interpretation (containing no more than 1 non-zero interpretation-entries in the diagonal of the component-wise maxima):
        
        Following symbols are considered usable:
          all
        TcT has computed the following interpretation:
          p(a) = [5]            
                 [9]            
          p(b) = [6]            
                 [7]            
          p(f) = [1 1] x1 + [15]
                 [0 0]      [6] 
          p(g) = [1 0] x1 + [5] 
                 [0 0]      [6] 
        
        Following rules are strictly oriented:
        f(a()) = [29]  
                 [6]   
               > [28]  
                 [6]   
               = f(b())
        
        
        Following rules are (at-least) weakly oriented:
          f(x) =  [1 1] x + [15]
                  [0 0]     [6] 
               >= [1 0] x + [5] 
                  [0 0]     [6] 
               =  g(x)          
        
        g(b()) =  [11]          
                  [6]           
               >= [10]          
                  [6]           
               =  g(a())        
        
* Step 4: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            f(x) -> g(x)
            f(a()) -> f(b())
            g(b()) -> g(a())
        - Signature:
            {f/1,g/1} / {a/0,b/0}
        - Obligation:
             derivational complexity wrt. signature {a,b,f,g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))