/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:
            b() -> f(a(),a())
            f(a(),a()) -> g(d())
            g(a()) -> g(b())
        - Signature:
            {b/0,f/2,g/1} / {a/0,d/0}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b,d,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) = [15]                 
            p(b) = [0]                  
            p(d) = [0]                  
            p(f) = [1] x1 + [1] x2 + [1]
            p(g) = [1] x1 + [0]         
          
          Following rules are strictly oriented:
          f(a(),a()) = [31]  
                     > [0]   
                     = g(d())
          
              g(a()) = [15]  
                     > [0]   
                     = g(b())
          
          
          Following rules are (at-least) weakly oriented:
          b() =  [0]       
              >= [31]      
              =  f(a(),a())
          
        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:
            b() -> f(a(),a())
        - Weak TRS:
            f(a(),a()) -> g(d())
            g(a()) -> g(b())
        - Signature:
            {b/0,f/2,g/1} / {a/0,d/0}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b,d,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) = [3]                      
                 [8]                      
          p(b) = [10]                     
                 [1]                      
          p(d) = [3]                      
                 [4]                      
          p(f) = [1 0] x1 + [1 0] x2 + [1]
                 [0 0]      [0 0]      [1]
          p(g) = [1 1] x1 + [0]           
                 [0 0]      [1]           
        
        Following rules are strictly oriented:
        b() = [10]      
              [1]       
            > [7]       
              [1]       
            = f(a(),a())
        
        
        Following rules are (at-least) weakly oriented:
        f(a(),a()) =  [7]   
                      [1]   
                   >= [7]   
                      [1]   
                   =  g(d())
        
            g(a()) =  [11]  
                      [1]   
                   >= [11]  
                      [1]   
                   =  g(b())
        
* Step 3: EmptyProcessor.  WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            b() -> f(a(),a())
            f(a(),a()) -> g(d())
            g(a()) -> g(b())
        - Signature:
            {b/0,f/2,g/1} / {a/0,d/0}
        - Obligation:
            innermost derivational complexity wrt. signature {a,b,d,f,g}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))