details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	9.51573085785 seconds
cpu usage	28.79735552
max memory	1.48652032E8

stage attributes

key	value
output-size	1289
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(h(x),y) -> h(f(y,f(x,h(f(a(),a()))))) - Signature: {f/2} / {a/0,h/1} - Obligation: runtime complexity wrt. defined symbols {f} and constructors {a,h} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: f(h(x),y) -> h(f(y,f(x,h(f(a(),a()))))) - Signature: {f/2} / {a/0,h/1} - Obligation: runtime complexity wrt. defined symbols {f} and constructors {a,h} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: f(x,y){x -> h(x)} = f(h(x),y) ->^+ h(f(y,f(x,h(f(a(),a()))))) = C[f(x,h(f(a(),a()))) = f(x,y){y -> h(f(a(),a()))}] 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