details

property	value
status	complete
benchmark	#4.37.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	Strategy_removed_AG01

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	1.37485718727 seconds
cpu usage	4.447182321
max memory	7.4289152E7

stage attributes

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