details

property	value
status	timeout (cpu)
benchmark	ExIntrod_GM04.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.350605965 seconds
cpu usage	1225.60032989
max memory	3.480870912E9

stage attributes

unavailable

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: adx(cons(X,Y)) -> incr(cons(X,adx(Y))) hd(cons(X,Y)) -> X incr(cons(X,Y)) -> cons(s(X),incr(Y)) nats() -> adx(zeros()) tl(cons(X,Y)) -> Y zeros() -> cons(0(),zeros()) - Signature: {adx/1,hd/1,incr/1,nats/0,tl/1,zeros/0} / {0/0,cons/2,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {adx,hd,incr,nats,tl,zeros} 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: adx(cons(X,Y)) -> incr(cons(X,adx(Y))) hd(cons(X,Y)) -> X incr(cons(X,Y)) -> cons(s(X),incr(Y)) nats() -> adx(zeros()) tl(cons(X,Y)) -> Y zeros() -> cons(0(),zeros()) - Signature: {adx/1,hd/1,incr/1,nats/0,tl/1,zeros/0} / {0/0,cons/2,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {adx,hd,incr,nats,tl,zeros} and constructors {0,cons,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: adx(y){y -> cons(x,y)} = adx(cons(x,y)) ->^+ incr(cons(x,adx(y))) = C[adx(y) = adx(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