details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	295.124484062 seconds
cpu usage	727.346058751
max memory	1.02211584E9

stage attributes

key	value
output-size	4547
starexec-result	WORST_CASE(Omega(n^1),?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__incr(X) -> incr(X) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__oddNs() -> a__incr(a__pairNs()) a__oddNs() -> oddNs() a__pairNs() -> cons(0(),incr(oddNs())) a__pairNs() -> pairNs() a__repItems(X) -> repItems(X) a__repItems(cons(X,XS)) -> cons(mark(X),cons(X,repItems(XS))) a__repItems(nil()) -> nil() a__tail(X) -> tail(X) a__tail(cons(X,XS)) -> mark(XS) a__take(X1,X2) -> take(X1,X2) a__take(0(),XS) -> nil() a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) a__zip(X,nil()) -> nil() a__zip(X1,X2) -> zip(X1,X2) a__zip(cons(X,XS),cons(Y,YS)) -> cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__zip(nil(),XS) -> nil() mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(incr(X)) -> a__incr(mark(X)) mark(nil()) -> nil() mark(oddNs()) -> a__oddNs() mark(pair(X1,X2)) -> pair(mark(X1),mark(X2)) mark(pairNs()) -> a__pairNs() mark(repItems(X)) -> a__repItems(mark(X)) mark(s(X)) -> s(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(zip(X1,X2)) -> a__zip(mark(X1),mark(X2)) - Signature: {a__incr/1,a__oddNs/0,a__pairNs/0,a__repItems/1,a__tail/1,a__take/2,a__zip/2,mark/1} / {0/0,cons/2,incr/1 ,nil/0,oddNs/0,pair/2,pairNs/0,repItems/1,s/1,tail/1,take/2,zip/2} - Obligation: runtime complexity wrt. defined symbols {a__incr,a__oddNs,a__pairNs,a__repItems,a__tail,a__take,a__zip ,mark} and constructors {0,cons,incr,nil,oddNs,pair,pairNs,repItems,s,tail,take,zip} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__incr(X) -> incr(X) a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__oddNs() -> a__incr(a__pairNs()) a__oddNs() -> oddNs() a__pairNs() -> cons(0(),incr(oddNs())) a__pairNs() -> pairNs() a__repItems(X) -> repItems(X) a__repItems(cons(X,XS)) -> cons(mark(X),cons(X,repItems(XS))) a__repItems(nil()) -> nil() a__tail(X) -> tail(X) a__tail(cons(X,XS)) -> mark(XS) a__take(X1,X2) -> take(X1,X2) a__take(0(),XS) -> nil() a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) a__zip(X,nil()) -> nil() a__zip(X1,X2) -> zip(X1,X2) a__zip(cons(X,XS),cons(Y,YS)) -> cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__zip(nil(),XS) -> nil() mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(incr(X)) -> a__incr(mark(X)) mark(nil()) -> nil() mark(oddNs()) -> a__oddNs() mark(pair(X1,X2)) -> pair(mark(X1),mark(X2)) mark(pairNs()) -> a__pairNs() mark(repItems(X)) -> a__repItems(mark(X)) mark(s(X)) -> s(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(zip(X1,X2)) -> a__zip(mark(X1),mark(X2)) - Signature: {a__incr/1,a__oddNs/0,a__pairNs/0,a__repItems/1,a__tail/1,a__take/2,a__zip/2,mark/1} / {0/0,cons/2,incr/1 ,nil/0,oddNs/0,pair/2,pairNs/0,repItems/1,s/1,tail/1,take/2,zip/2} - Obligation: runtime complexity wrt. defined symbols {a__incr,a__oddNs,a__pairNs,a__repItems,a__tail,a__take,a__zip ,mark} and constructors {0,cons,incr,nil,oddNs,pair,pairNs,repItems,s,tail,take,zip} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> cons(x,y)} = mark(cons(x,y)) ->^+ cons(mark(x),y) = C[mark(x) = mark(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