Runti Compl Inner Rewri 22807 pair #381904848

details

property	value
status	timeout (cpu)
benchmark	Ex9_BLR02.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
space	Strategy_removed_CSR_05

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	294.316971064 seconds
cpu usage	1268.91542583
max memory	6.38578688E9

stage attributes

unavailable

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:
            filter(cons(X,Y),0(),M) -> cons(0(),filter(Y,M,M))
            filter(cons(X,Y),s(N),M) -> cons(X,filter(Y,N,M))
            nats(N) -> cons(N,nats(s(N)))
            sieve(cons(0(),Y)) -> cons(0(),sieve(Y))
            sieve(cons(s(N),Y)) -> cons(s(N),sieve(filter(Y,N,N)))
            zprimes() -> sieve(nats(s(s(0()))))
        - Signature:
            {filter/3,nats/1,sieve/1,zprimes/0} / {0/0,cons/2,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {filter,nats,sieve,zprimes} and constructors {0,cons,s}
    + Applied Processor:
        Sum {left = someStrategy, right = someStrategy}
    + Details:
        ()
* Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?)
    + Considered Problem:
        - Strict TRS:
            filter(cons(X,Y),0(),M) -> cons(0(),filter(Y,M,M))
            filter(cons(X,Y),s(N),M) -> cons(X,filter(Y,N,M))
            nats(N) -> cons(N,nats(s(N)))
            sieve(cons(0(),Y)) -> cons(0(),sieve(Y))
            sieve(cons(s(N),Y)) -> cons(s(N),sieve(filter(Y,N,N)))
            zprimes() -> sieve(nats(s(s(0()))))
        - Signature:
            {filter/3,nats/1,sieve/1,zprimes/0} / {0/0,cons/2,s/1}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {filter,nats,sieve,zprimes} and constructors {0,cons,s}
    + Applied Processor:
        DecreasingLoops {bound = AnyLoop, narrow = 10}
    + Details:
        The system has following decreasing Loops:
          filter(y,z,u){y -> cons(x,y),z -> s(z)} =
            filter(cons(x,y),s(z),u) ->^+ cons(x,filter(y,z,u))
              = C[filter(y,z,u) = filter(y,z,u){}]

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