Runti Compl Inner Rewri 22807 pair #381904617

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	266.847800016 seconds
cpu usage	879.107986863
max memory	2.060279808E9

stage attributes

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

output

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


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


WORST_CASE(Omega(n^1),?)
* Step 1: Sum WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            cond1(true(),x,y) -> cond2(gr(x,y),x,y)
            cond2(false(),x,y) -> cond1(neq(x,0()),p(x),y)
            cond2(true(),x,y) -> cond1(neq(x,0()),y,y)
            gr(0(),x) -> false()
            gr(s(x),0()) -> true()
            gr(s(x),s(y)) -> gr(x,y)
            neq(0(),0()) -> false()
            neq(0(),s(x)) -> true()
            neq(s(x),0()) -> true()
            neq(s(x),s(y)) -> neq(x,y)
            p(0()) -> 0()
            p(s(x)) -> x
        - Signature:
            {cond1/3,cond2/3,gr/2,neq/2,p/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {cond1,cond2,gr,neq,p} 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:
            cond1(true(),x,y) -> cond2(gr(x,y),x,y)
            cond2(false(),x,y) -> cond1(neq(x,0()),p(x),y)
            cond2(true(),x,y) -> cond1(neq(x,0()),y,y)
            gr(0(),x) -> false()
            gr(s(x),0()) -> true()
            gr(s(x),s(y)) -> gr(x,y)
            neq(0(),0()) -> false()
            neq(0(),s(x)) -> true()
            neq(s(x),0()) -> true()
            neq(s(x),s(y)) -> neq(x,y)
            p(0()) -> 0()
            p(s(x)) -> x
        - Signature:
            {cond1/3,cond2/3,gr/2,neq/2,p/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {cond1,cond2,gr,neq,p} and constructors {0,false,s,true}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          gr(x,y){x -> s(x),y -> s(y)} =
            gr(s(x),s(y)) ->^+ gr(x,y)
              = C[gr(x,y) = gr(x,y){}]

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 Inner Rewri 22807