Runti Compl Full Rewri 10127 pair #381902773

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.117596149 seconds
cpu usage	367.559399399
max memory	4.937080832E9

stage attributes

key	value
output-size	2126
starexec-result	WORST_CASE(Omega(n^1),?)

output

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


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


WORST_CASE(Omega(n^1),?)
* Step 1: Sum WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            id_inc(x) -> x
            id_inc(x) -> s(x)
            if(false(),x,y) -> y
            if(true(),x,y) -> rand(p(x),id_inc(y))
            nonZero(0()) -> false()
            nonZero(s(x)) -> true()
            p(0()) -> 0()
            p(s(x)) -> x
            rand(x,y) -> if(nonZero(x),x,y)
            random(x) -> rand(x,0())
        - Signature:
            {id_inc/1,if/3,nonZero/1,p/1,rand/2,random/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
             runtime complexity wrt. defined symbols {id_inc,if,nonZero,p,rand,random} and constructors {0,false,s,true}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            id_inc(x) -> x
            id_inc(x) -> s(x)
            if(false(),x,y) -> y
            if(true(),x,y) -> rand(p(x),id_inc(y))
            nonZero(0()) -> false()
            nonZero(s(x)) -> true()
            p(0()) -> 0()
            p(s(x)) -> x
            rand(x,y) -> if(nonZero(x),x,y)
            random(x) -> rand(x,0())
        - Signature:
            {id_inc/1,if/3,nonZero/1,p/1,rand/2,random/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
             runtime complexity wrt. defined symbols {id_inc,if,nonZero,p,rand,random} and constructors {0,false,s,true}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          if(true(),s(x),x_15){x -> s(x)} =
            if(true(),s(s(x)),x_15) ->^+ if(true(),s(x),id_inc(x_15))
              = C[if(true(),s(x),id_inc(x_15)) = if(true(),s(x),x_15){x_15 -> id_inc(x_15)}]

WORST_CASE(Omega(n^1),?)

popout

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

job log

popout

actions all output return to Runti Compl Full Rewri 10127