details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_dc
runtime (wallclock)	0.205235004425 seconds
cpu usage	0.729566393
max memory	2.3375872E7

stage attributes

key	value
output-size	1569
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: first(0(),X) -> nil() first(s(X),cons(Y)) -> cons(Y) from(X) -> cons(X) - Signature: {first/2,from/1} / {0/0,cons/1,nil/0,s/1} - Obligation: derivational complexity wrt. signature {0,cons,first,from,nil,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 cons_0(1) -> 1 cons_1(1) -> 1 first_0(1,1) -> 1 from_0(1) -> 1 nil_0() -> 1 nil_1() -> 1 s_0(1) -> 1 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: first(0(),X) -> nil() first(s(X),cons(Y)) -> cons(Y) from(X) -> cons(X) - Signature: {first/2,from/1} / {0/0,cons/1,nil/0,s/1} - Obligation: derivational complexity wrt. signature {0,cons,first,from,nil,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