Runti Compl Full Rewri 10127 pair #381902350

details

property	value
status	complete
benchmark	ExIntrod_GM04_GM.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	Transformed_CSR_04

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	15.2391960621 seconds
cpu usage	45.338988327
max memory	2.12762624E8

stage attributes

key	value
output-size	3222
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:
            a__adx(X) -> adx(X)
            a__adx(cons(X,Y)) -> a__incr(cons(X,adx(Y)))
            a__hd(X) -> hd(X)
            a__hd(cons(X,Y)) -> mark(X)
            a__incr(X) -> incr(X)
            a__incr(cons(X,Y)) -> cons(s(X),incr(Y))
            a__nats() -> a__adx(a__zeros())
            a__nats() -> nats()
            a__tl(X) -> tl(X)
            a__tl(cons(X,Y)) -> mark(Y)
            a__zeros() -> cons(0(),zeros())
            a__zeros() -> zeros()
            mark(0()) -> 0()
            mark(adx(X)) -> a__adx(mark(X))
            mark(cons(X1,X2)) -> cons(X1,X2)
            mark(hd(X)) -> a__hd(mark(X))
            mark(incr(X)) -> a__incr(mark(X))
            mark(nats()) -> a__nats()
            mark(s(X)) -> s(X)
            mark(tl(X)) -> a__tl(mark(X))
            mark(zeros()) -> a__zeros()
        - Signature:
            {a__adx/1,a__hd/1,a__incr/1,a__nats/0,a__tl/1,a__zeros/0,mark/1} / {0/0,adx/1,cons/2,hd/1,incr/1,nats/0,s/1
            ,tl/1,zeros/0}
        - Obligation:
             runtime complexity wrt. defined symbols {a__adx,a__hd,a__incr,a__nats,a__tl,a__zeros
            ,mark} and constructors {0,adx,cons,hd,incr,nats,s,tl,zeros}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            a__adx(X) -> adx(X)
            a__adx(cons(X,Y)) -> a__incr(cons(X,adx(Y)))
            a__hd(X) -> hd(X)
            a__hd(cons(X,Y)) -> mark(X)
            a__incr(X) -> incr(X)
            a__incr(cons(X,Y)) -> cons(s(X),incr(Y))
            a__nats() -> a__adx(a__zeros())
            a__nats() -> nats()
            a__tl(X) -> tl(X)
            a__tl(cons(X,Y)) -> mark(Y)
            a__zeros() -> cons(0(),zeros())
            a__zeros() -> zeros()
            mark(0()) -> 0()
            mark(adx(X)) -> a__adx(mark(X))
            mark(cons(X1,X2)) -> cons(X1,X2)
            mark(hd(X)) -> a__hd(mark(X))
            mark(incr(X)) -> a__incr(mark(X))
            mark(nats()) -> a__nats()
            mark(s(X)) -> s(X)
            mark(tl(X)) -> a__tl(mark(X))
            mark(zeros()) -> a__zeros()
        - Signature:
            {a__adx/1,a__hd/1,a__incr/1,a__nats/0,a__tl/1,a__zeros/0,mark/1} / {0/0,adx/1,cons/2,hd/1,incr/1,nats/0,s/1
            ,tl/1,zeros/0}
        - Obligation:
             runtime complexity wrt. defined symbols {a__adx,a__hd,a__incr,a__nats,a__tl,a__zeros
            ,mark} and constructors {0,adx,cons,hd,incr,nats,s,tl,zeros}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          mark(x){x -> adx(x)} =
            mark(adx(x)) ->^+ a__adx(mark(x))
              = C[mark(x) = mark(x){}]

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