details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	1.24272179604 seconds
cpu usage	2.447858185
max memory	5.5701504E7

stage attributes

key	value
output-size	1715
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: b(X) -> a(X) f(a(g(X))) -> b(X) f(f(X)) -> f(a(b(f(X)))) - Signature: {b/1,f/1} / {a/1,g/1} - Obligation: derivational complexity wrt. signature {a,b,f,g} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. a_0(1) -> 1 a_1(1) -> 1 a_1(3) -> 2 a_2(1) -> 1 a_2(1) -> 4 a_2(4) -> 3 a_2(6) -> 5 a_3(7) -> 6 b_0(1) -> 1 b_1(1) -> 1 b_1(1) -> 4 b_1(4) -> 3 b_2(7) -> 6 f_0(1) -> 1 f_1(1) -> 4 f_1(2) -> 1 f_1(2) -> 4 f_2(2) -> 7 f_2(5) -> 4 g_0(1) -> 1 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: b(X) -> a(X) f(a(g(X))) -> b(X) f(f(X)) -> f(a(b(f(X)))) - Signature: {b/1,f/1} / {a/1,g/1} - Obligation: derivational complexity wrt. signature {a,b,f,g} + 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