/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /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:
            -(-(neg(x),neg(x)),-(neg(y),neg(y))) -> -(-(x,y),-(x,y))
        - Signature:
            {-/2} / {neg/1}
        - Obligation:
             derivational complexity wrt. signature {-,neg}
    + 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(-) = [1] x1 + [1] x2 + [0]
          p(neg) = [1] x1 + [3]         
        
        Following rules are strictly oriented:
        -(-(neg(x),neg(x)),-(neg(y),neg(y))) = [2] x + [2] y + [12]
                                             > [2] x + [2] y + [0] 
                                             = -(-(x,y),-(x,y))    
        
        
        Following rules are (at-least) weakly oriented:
        
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            -(-(neg(x),neg(x)),-(neg(y),neg(y))) -> -(-(x,y),-(x,y))
        - Signature:
            {-/2} / {neg/1}
        - Obligation:
             derivational complexity wrt. signature {-,neg}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))