details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.457466125 seconds
cpu usage	473.22026001
max memory	2.5554944E9

stage attributes

key	value
output-size	1814
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: fac(s(x)) -> times(fac(p(s(x))),s(x)) p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) times(x,0()) -> 0() times(0(),y) -> 0() times(s(x),y) -> plus(times(x,y),y) - Signature: {fac/1,p/1,plus/2,times/2} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {fac,p,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: fac(s(x)) -> times(fac(p(s(x))),s(x)) p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) times(x,0()) -> 0() times(0(),y) -> 0() times(s(x),y) -> plus(times(x,y),y) - Signature: {fac/1,p/1,plus/2,times/2} / {0/0,s/1} - Obligation: runtime complexity wrt. defined symbols {fac,p,plus,times} and constructors {0,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: p(s(x)){x -> s(x)} = p(s(s(x))) ->^+ s(p(s(x))) = C[p(s(x)) = p(s(x)){}] 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