details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	2.32333302498 seconds
cpu usage	301.396467829
max memory	1.18099968E8

stage attributes

key	value
output-size	60122
starexec-result	WORST_CASE(Omega(n^1),O(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),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: 2nd(cons(X,XS)) -> head(activate(XS)) activate(X) -> X activate(n__from(X)) -> from(X) activate(n__take(X1,X2)) -> take(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) head(cons(X,XS)) -> X sel(0(),cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,activate(XS)) take(X1,X2) -> n__take(X1,X2) take(0(),XS) -> nil() take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS))) - Signature: {2nd/1,activate/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,n__from/1,n__take/2,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {2nd,activate,from,head,sel,take} and constructors {0,cons,n__from ,n__take,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: 2nd(cons(X,XS)) -> head(activate(XS)) activate(X) -> X activate(n__from(X)) -> from(X) activate(n__take(X1,X2)) -> take(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) head(cons(X,XS)) -> X sel(0(),cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,activate(XS)) take(X1,X2) -> n__take(X1,X2) take(0(),XS) -> nil() take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS))) - Signature: {2nd/1,activate/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,n__from/1,n__take/2,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {2nd,activate,from,head,sel,take} and constructors {0,cons,n__from ,n__take,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(v){v -> n__take(s(x),cons(z,v))} = activate(n__take(s(x),cons(z,v))) ->^+ cons(z,n__take(x,activate(v))) = C[activate(v) = activate(v){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: 2nd(cons(X,XS)) -> head(activate(XS)) activate(X) -> X activate(n__from(X)) -> from(X) activate(n__take(X1,X2)) -> take(X1,X2) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) head(cons(X,XS)) -> X sel(0(),cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,activate(XS)) take(X1,X2) -> n__take(X1,X2) take(0(),XS) -> nil() take(s(N),cons(X,XS)) -> cons(X,n__take(N,activate(XS))) - Signature: {2nd/1,activate/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,n__from/1,n__take/2,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {2nd,activate,from,head,sel,take} and constructors {0,cons,n__from ,n__take,nil,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following weak dependency pairs: Strict DPs 2nd#(cons(X,XS)) -> c_1(head#(activate(XS))) activate#(X) -> c_2(X) activate#(n__from(X)) -> c_3(from#(X)) activate#(n__take(X1,X2)) -> c_4(take#(X1,X2)) from#(X) -> c_5(X,X) from#(X) -> c_6(X) head#(cons(X,XS)) -> c_7(X) sel#(0(),cons(X,XS)) -> c_8(X) sel#(s(N),cons(X,XS)) -> c_9(sel#(N,activate(XS))) take#(X1,X2) -> c_10(X1,X2) take#(0(),XS) -> c_11() take#(s(N),cons(X,XS)) -> c_12(X,N,activate#(XS)) Weak DPs popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Runti Compl Full Rewri 10127