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

WORST_CASE(?,O(n^1))