details

property	value
status	complete
benchmark	hydra-Zantema06.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n078.star.cs.uiowa.edu
space	Mixed_TRS

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.146239042 seconds
cpu usage	651.923821641
max memory	9.73201408E8

stage attributes

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