Deriv Compl Full Rewri 33144 pair #381922460

details

property	value
status	complete
benchmark	jw47.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n048.star.cs.uiowa.edu
space	Zantema_05

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	61.4980978966 seconds
cpu usage	131.498264567
max memory	1.20496128E8

stage attributes

key	value
output-size	1952
starexec-result	WORST_CASE(?,O(n^2))

output

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

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Deriv Compl Full Rewri 33144