details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	294.073113918 seconds
cpu usage	1174.48521975
max memory	2.6141442048E10

stage attributes

key	value
output-size	1848
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(b(a(b(b(a(b(b(b(b(b(b(a(b(x1)))))))))))))) -> b(b(b(b(b(a(b(b(a(b(b(a(b(b(b(b(b(b(x1)))))))))))))))))) - Signature: {b/1} / {a/1} - Obligation: derivational complexity wrt. signature {a,b} + 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(7) -> 6 a_1(10) -> 9 a_1(13) -> 12 b_0(1) -> 1 b_1(1) -> 18 b_1(2) -> 1 b_1(2) -> 7 b_1(2) -> 17 b_1(2) -> 18 b_1(3) -> 2 b_1(4) -> 3 b_1(5) -> 4 b_1(6) -> 5 b_1(7) -> 17 b_1(8) -> 7 b_1(9) -> 8 b_1(11) -> 10 b_1(12) -> 11 b_1(14) -> 13 b_1(15) -> 14 b_1(16) -> 15 b_1(17) -> 16 b_1(18) -> 17 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: b(b(a(b(b(a(b(b(b(b(b(b(a(b(x1)))))))))))))) -> b(b(b(b(b(a(b(b(a(b(b(a(b(b(b(b(b(b(x1)))))))))))))))))) - Signature: {b/1} / {a/1} - Obligation: derivational complexity wrt. signature {a,b} + 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