Runti Compl Full Rewri 10127 pair #381902347

details

property	value
status	complete
benchmark	cade09.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	GTSSK07

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.112030983 seconds
cpu usage	610.195110514
max memory	2.2630363136E10

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /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:
            f(true(),x,y) -> f(gt(x,y),x,round(s(y)))
            gt(0(),v) -> false()
            gt(s(u),0()) -> true()
            gt(s(u),s(v)) -> gt(u,v)
            round(0()) -> 0()
            round(s(0())) -> s(s(0()))
            round(s(s(x))) -> s(s(round(x)))
        - Signature:
            {f/3,gt/2,round/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
             runtime complexity wrt. defined symbols {f,gt,round} 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:
            f(true(),x,y) -> f(gt(x,y),x,round(s(y)))
            gt(0(),v) -> false()
            gt(s(u),0()) -> true()
            gt(s(u),s(v)) -> gt(u,v)
            round(0()) -> 0()
            round(s(0())) -> s(s(0()))
            round(s(s(x))) -> s(s(round(x)))
        - Signature:
            {f/3,gt/2,round/1} / {0/0,false/0,s/1,true/0}
        - Obligation:
             runtime complexity wrt. defined symbols {f,gt,round} and constructors {0,false,s,true}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          gt(x,y){x -> s(x),y -> s(y)} =
            gt(s(x),s(y)) ->^+ gt(x,y)
              = C[gt(x,y) = gt(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 Full Rewri 10127