details

property	value
status	complete
benchmark	while.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n057.star.cs.uiowa.edu
space	Mixed_TRS

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	106.638987064 seconds
cpu usage	408.446894856
max memory	1.532301312E9

stage attributes

key	value
output-size	1412
starexec-result	WORST_CASE(Omega(n^1),?)

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