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

WORST_CASE(?,O(n^1))