Runti Compl Full Rewri 10127 pair #381902885

details

property	value
status	timeout (wallclock)
benchmark	list-sum-prod-bin.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	CiME_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.297473907 seconds
cpu usage	920.4551823
max memory	1.6240775168E10

stage attributes

unavailable

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