details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	5.3220038414 seconds
cpu usage	18.442803322
max memory	1.72449792E8

stage attributes

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

output

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