Deriv Compl Full Rewri 33144 pair #381922803

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	30.0606968403 seconds
cpu usage	80.227254226
max memory	6.73017856E8

stage attributes

key	value
output-size	2076
starexec-result	WORST_CASE(?,O(n^1))

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^1))
* Step 1: NaturalMI WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            a(a(x1)) -> b(b(b(x1)))
            b(b(x1)) -> c(c(c(x1)))
            c(c(c(c(x1)))) -> a(b(x1))
        - Signature:
            {a/1,b/1,c/1} / {}
        - Obligation:
             derivational complexity wrt. signature {a,b,c}
    + 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(a) = [1] x1 + [38]
          p(b) = [1] x1 + [25]
          p(c) = [1] x1 + [16]
        
        Following rules are strictly oriented:
              a(a(x1)) = [1] x1 + [76]
                       > [1] x1 + [75]
                       = b(b(b(x1)))  
        
              b(b(x1)) = [1] x1 + [50]
                       > [1] x1 + [48]
                       = c(c(c(x1)))  
        
        c(c(c(c(x1)))) = [1] x1 + [64]
                       > [1] x1 + [63]
                       = a(b(x1))     
        
        
        Following rules are (at-least) weakly oriented:
        
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            a(a(x1)) -> b(b(b(x1)))
            b(b(x1)) -> c(c(c(x1)))
            c(c(c(c(x1)))) -> a(b(x1))
        - Signature:
            {a/1,b/1,c/1} / {}
        - Obligation:
             derivational complexity wrt. signature {a,b,c}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))

popout

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

job log

popout

actions all output return to Deriv Compl Full Rewri 33144