Runti Compl Inner Rewri 22807 pair #381904401

details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	295.402229071 seconds
cpu usage	1176.44171463
max memory	3.915071488E9

stage attributes

key	value
output-size	1850
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:
            f(true(),x,y,z) -> f(gt(x,plus(y,z)),x,y,s(z))
            f(true(),x,y,z) -> f(gt(x,plus(y,z)),x,s(y),z)
            gt(0(),v) -> false()
            gt(s(u),0()) -> true()
            gt(s(u),s(v)) -> gt(u,v)
            plus(n,0()) -> n
            plus(n,s(m)) -> s(plus(n,m))
        - Signature:
            {f/4,gt/2,plus/2} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,gt,plus} 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,z) -> f(gt(x,plus(y,z)),x,y,s(z))
            f(true(),x,y,z) -> f(gt(x,plus(y,z)),x,s(y),z)
            gt(0(),v) -> false()
            gt(s(u),0()) -> true()
            gt(s(u),s(v)) -> gt(u,v)
            plus(n,0()) -> n
            plus(n,s(m)) -> s(plus(n,m))
        - Signature:
            {f/4,gt/2,plus/2} / {0/0,false/0,s/1,true/0}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {f,gt,plus} 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 Inner Rewri 22807