details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	15.7558610439 seconds
cpu usage	23.899284016
max memory	2.05123584E8

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(x,f(a(),a())) -> f(f(f(a(),a()),a()),x) - Signature: {f/2} / {a/0} - Obligation: derivational complexity wrt. signature {a,f} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 1. The enriched problem is compatible with follwoing automaton. a_0() -> 1 a_1() -> 4 a_1() -> 5 a_1() -> 6 f_0(1,1) -> 1 f_1(2,1) -> 1 f_1(2,2) -> 1 f_1(3,4) -> 2 f_1(5,6) -> 3 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(x,f(a(),a())) -> f(f(f(a(),a()),a()),x) - Signature: {f/2} / {a/0} - Obligation: derivational complexity wrt. signature {a,f} + 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