details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.135108948 seconds
cpu usage	637.577289372
max memory	2.066071552E9

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /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: plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) times(x,0()) -> 0() times(x,plus(y,s(z))) -> plus(times(x,plus(y,times(s(z),0()))),times(x,s(z))) times(x,s(y)) -> plus(times(x,y),x) - Signature: {plus/2,times/2} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {plus,times} and constructors {0,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) times(x,0()) -> 0() times(x,plus(y,s(z))) -> plus(times(x,plus(y,times(s(z),0()))),times(x,s(z))) times(x,s(y)) -> plus(times(x,y),x) - Signature: {plus/2,times/2} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {plus,times} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: plus(x,y){y -> s(y)} = plus(x,s(y)) ->^+ s(plus(x,y)) = C[plus(x,y) = plus(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 Full Rewri 10127