details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	0.0558540821075 seconds
cpu usage	0.175157568
max memory	2.3072768E7

stage attributes

key	value
output-size	1405
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: p(m,n,s(r)) -> p(m,r,n) p(m,0(),0()) -> m p(m,s(n),0()) -> p(0(),n,m) - Signature: {p/3} / {0/0,s/1} - Obligation: derivational complexity wrt. signature {0,p,s} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 1. The enriched problem is compatible with follwoing automaton. 0_0() -> 1 0_1() -> 1 p_0(1,1,1) -> 1 p_1(1,1,1) -> 1 s_0(1) -> 1 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: p(m,n,s(r)) -> p(m,r,n) p(m,0(),0()) -> m p(m,s(n),0()) -> p(0(),n,m) - Signature: {p/3} / {0/0,s/1} - Obligation: derivational complexity wrt. signature {0,p,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