details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rci
runtime (wallclock)	294.040797949 seconds
cpu usage	775.322240086
max memory	1.569103872E9

stage attributes

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

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: plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z))) quot(0(),s(y),s(z)) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) - Signature: {plus/2,quot/3} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {plus,quot} 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(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) quot(x,0(),s(z)) -> s(quot(x,plus(z,s(0())),s(z))) quot(0(),s(y),s(z)) -> 0() quot(s(x),s(y),z) -> quot(x,y,z) - Signature: {plus/2,quot/3} / {0/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {plus,quot} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: plus(x,y){x -> s(x)} = plus(s(x),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 Inner Rewri 22807