details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.022501945 seconds
cpu usage	648.261839931
max memory	6.44452352E8

stage attributes

key	value
output-size	1563
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: -(x,0()) -> x -(s(x),s(y)) -> -(x,y) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) p(s(x)) -> x - Signature: {-/2,f/2,p/1} / {0/0,s/1} - Obligation: 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()) -> x -(s(x),s(y)) -> -(x,y) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) p(s(x)) -> x - Signature: {-/2,f/2,p/1} / {0/0,s/1} - Obligation: 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){x -> s(x),y -> s(y)} = -(s(x),s(y)) ->^+ -(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 Full Rewri 10127