details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	2.93178892136 seconds
cpu usage	7.247712462
max memory	8.7719936E7

stage attributes

key	value
output-size	1603
starexec-result	WORST_CASE(Omega(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(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: from(X) -> cons(X,from(s(X))) length(cons(X,Y)) -> s(length1(Y)) length(nil()) -> 0() length1(X) -> length(X) - Signature: {from/1,length/1,length1/1} / {0/0,cons/2,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {from,length,length1} and constructors {0,cons,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: from(X) -> cons(X,from(s(X))) length(cons(X,Y)) -> s(length1(Y)) length(nil()) -> 0() length1(X) -> length(X) - Signature: {from/1,length/1,length1/1} / {0/0,cons/2,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {from,length,length1} and constructors {0,cons,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: length(x){x -> cons(y,x)} = length(cons(y,x)) ->^+ s(length(x)) = C[length(x) = length(x){}] WORST_CASE(Omega(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