Runti Compl Inner Rewri 22807 pair #381904392

details

property	value
status	complete
benchmark	list-sum-prod.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n026.star.cs.uiowa.edu
space	CiME_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	294.239958048 seconds
cpu usage	1161.29931083
max memory	3.19578112E9

stage attributes

key	value
output-size	1977
starexec-result	WORST_CASE(Omega(n^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(Omega(n^1),?)
* Step 1: Sum WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            *(x,0()) -> 0()
            *(0(),x) -> 0()
            *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
            +(x,0()) -> x
            +(0(),x) -> x
            +(s(x),s(y)) -> s(s(+(x,y)))
            prod(cons(x,l)) -> *(x,prod(l))
            prod(nil()) -> s(0())
            sum(cons(x,l)) -> +(x,sum(l))
            sum(nil()) -> 0()
        - Signature:
            {*/2,+/2,prod/1,sum/1} / {0/0,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {*,+,prod,sum} and constructors {0,cons,nil,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            *(x,0()) -> 0()
            *(0(),x) -> 0()
            *(s(x),s(y)) -> s(+(*(x,y),+(x,y)))
            +(x,0()) -> x
            +(0(),x) -> x
            +(s(x),s(y)) -> s(s(+(x,y)))
            prod(cons(x,l)) -> *(x,prod(l))
            prod(nil()) -> s(0())
            sum(cons(x,l)) -> +(x,sum(l))
            sum(nil()) -> 0()
        - Signature:
            {*/2,+/2,prod/1,sum/1} / {0/0,cons/2,nil/0,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {*,+,prod,sum} and constructors {0,cons,nil,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          *(x,y){x -> s(x),y -> s(y)} =
            *(s(x),s(y)) ->^+ s(+(*(x,y),+(x,y)))
              = C[*(x,y) = *(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