details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	294.115121126 seconds
cpu usage	326.701327361
max memory	1.390620672E9

stage attributes

key	value
output-size	1414
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: b(b(c(a(b(c(x1)))))) -> a(b(b(c(b(c(a(x1))))))) - Signature: {b/1} / {a/1,c/1} - Obligation: derivational complexity wrt. signature {a,b,c} + 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) -> 1 a_1(1) -> 7 a_1(2) -> 1 b_0(1) -> 1 b_1(3) -> 2 b_1(4) -> 3 b_1(6) -> 5 c_0(1) -> 1 c_1(5) -> 4 c_1(7) -> 6 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: b(b(c(a(b(c(x1)))))) -> a(b(b(c(b(c(a(x1))))))) - Signature: {b/1} / {a/1,c/1} - Obligation: derivational complexity wrt. signature {a,b,c} + 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