details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	4.86854696274 seconds
cpu usage	9.032491799
max memory	8.5757952E7

stage attributes

key	value
output-size	1962
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(f(x)) -> f(c(f(x))) f(f(x)) -> f(d(f(x))) g(c(x)) -> x g(c(0())) -> g(d(1())) g(c(1())) -> g(d(0())) g(d(x)) -> x - Signature: {f/1,g/1} / {0/0,1/0,c/1,d/1} - Obligation: derivational complexity wrt. signature {0,1,c,d,f,g} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. 0_0() -> 1 0_1() -> 1 0_1() -> 7 1_0() -> 1 1_1() -> 1 1_1() -> 7 c_0(1) -> 1 c_1(3) -> 2 c_2(5) -> 4 d_0(1) -> 1 d_1(3) -> 2 d_1(7) -> 6 d_2(5) -> 4 f_0(1) -> 1 f_1(1) -> 3 f_1(2) -> 1 f_1(2) -> 3 f_2(2) -> 5 f_2(4) -> 3 g_0(1) -> 1 g_1(6) -> 1 7 -> 1 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(f(x)) -> f(c(f(x))) f(f(x)) -> f(d(f(x))) g(c(x)) -> x g(c(0())) -> g(d(1())) g(c(1())) -> g(d(0())) g(d(x)) -> x - Signature: {f/1,g/1} / {0/0,1/0,c/1,d/1} - Obligation: derivational complexity wrt. signature {0,1,c,d,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