details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	295.600695133 seconds
cpu usage	1451.24440627
max memory	1.6717791232E10

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