details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.0553019046783 seconds
cpu usage	0.196903124
max memory	1.6969728E7

stage attributes

key	value
output-size	2237
starexec-result	WORST_CASE(?,O(n^1))

output

/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) * Step 1: Sum WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__f(X)) -> f(X) f(X) -> n__f(X) f(f(a())) -> f(g(n__f(a()))) - Signature: {activate/1,f/1} / {a/0,g/1,n__f/1} - Obligation: runtime complexity wrt. defined symbols {activate,f} and constructors {a,g,n__f} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__f(X)) -> f(X) f(X) -> n__f(X) f(f(a())) -> f(g(n__f(a()))) - Signature: {activate/1,f/1} / {a/0,g/1,n__f/1} - Obligation: runtime complexity wrt. defined symbols {activate,f} and constructors {a,g,n__f} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. a_0() -> 1 a_0() -> 2 activate_0(2) -> 1 f_0(2) -> 1 f_1(2) -> 1 g_0(2) -> 1 g_0(2) -> 2 n__f_0(2) -> 1 n__f_0(2) -> 2 n__f_1(2) -> 1 n__f_2(2) -> 1 2 -> 1 * Step 3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: activate(X) -> X activate(n__f(X)) -> f(X) f(X) -> n__f(X) f(f(a())) -> f(g(n__f(a()))) - Signature: {activate/1,f/1} / {a/0,g/1,n__f/1} - Obligation: runtime complexity wrt. defined symbols {activate,f} and constructors {a,g,n__f} + 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 Runti Compl Full Rewri 10127