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

WORST_CASE(?,O(n^1))