Runti Compl Inner Rewri 22807 pair #381904864

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	0.243756055832 seconds
cpu usage	0.903835985
max memory	2.4293376E7

stage attributes

key	value
output-size	2393
starexec-result	WORST_CASE(?,O(1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?,O(1))
* Step 1: Sum WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            and(not(not(x)),y,not(z)) -> and(y,band(x,z),x)
        - Signature:
            {and/3} / {band/2,not/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {and} and constructors {band,not}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: NaturalMI WORST_CASE(?,O(1))
    + Considered Problem:
        - Strict TRS:
            and(not(not(x)),y,not(z)) -> and(y,band(x,z),x)
        - Signature:
            {and/3} / {band/2,not/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {and} and constructors {band,not}
    + Applied Processor:
        NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules}
    + Details:
        We apply a matrix interpretation of kind constructor based matrix interpretation:
        The following argument positions are considered usable:
          none
        
        Following symbols are considered usable:
          {and}
        TcT has computed the following interpretation:
           p(and) = [1] x1 + [1] x2 + [0]
          p(band) = [0]                  
           p(not) = [3]                  
        
        Following rules are strictly oriented:
        and(not(not(x)),y,not(z)) = [1] y + [3]       
                                  > [1] y + [0]       
                                  = and(y,band(x,z),x)
        
        
        Following rules are (at-least) weakly oriented:
        
* Step 3: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            and(not(not(x)),y,not(z)) -> and(y,band(x,z),x)
        - Signature:
            {and/3} / {band/2,not/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {and} and constructors {band,not}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(1))

popout

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

job log

popout

actions all output return to Runti Compl Inner Rewri 22807