details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	0.0635640621185 seconds
cpu usage	0.206689313
max memory	1.9955712E7

stage attributes

key	value
output-size	1349
starexec-result	WORST_CASE(?,O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_dc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: app(app(app(uncurry(),f),x),y) -> app(app(f,x),y) - Signature: {app/2} / {uncurry/0} - Obligation: derivational complexity wrt. signature {app,uncurry} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 1. The enriched problem is compatible with follwoing automaton. app_0(1,1) -> 1 app_1(1,1) -> 2 app_1(2,1) -> 1 app_1(2,1) -> 2 uncurry_0() -> 1 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: app(app(app(uncurry(),f),x),y) -> app(app(f,x),y) - Signature: {app/2} / {uncurry/0} - Obligation: derivational complexity wrt. signature {app,uncurry} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1)) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Deriv Compl Full Rewri 33144