details

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

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	1.71131777763 seconds
cpu usage	300.258416466
max memory	1.07814912E8

stage attributes

key	value
output-size	21937
starexec-result	WORST_CASE(Omega(n^1),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(Omega(n^1),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__from(X)) -> from(X) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) - Signature: {activate/1,from/1,sel/2} / {0/0,cons/2,n__from/1,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,from,sel} and constructors {0,cons,n__from,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__from(X)) -> from(X) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) - Signature: {activate/1,from/1,sel/2} / {0/0,cons/2,n__from/1,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,from,sel} and constructors {0,cons,n__from,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: sel(y,x){y -> s(y),x -> cons(u,x)} = sel(s(y),cons(u,x)) ->^+ sel(y,x) = C[sel(y,x) = sel(y,x){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__from(X)) -> from(X) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) - Signature: {activate/1,from/1,sel/2} / {0/0,cons/2,n__from/1,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,from,sel} and constructors {0,cons,n__from,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following weak dependency pairs: Strict DPs activate#(X) -> c_1(X) activate#(n__from(X)) -> c_2(from#(X)) from#(X) -> c_3(X,X) from#(X) -> c_4(X) sel#(0(),cons(X,Y)) -> c_5(X) sel#(s(X),cons(Y,Z)) -> c_6(sel#(X,activate(Z))) Weak DPs and mark the set of starting terms. ** Step 1.b:2: UsableRules WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: activate#(X) -> c_1(X) activate#(n__from(X)) -> c_2(from#(X)) from#(X) -> c_3(X,X) from#(X) -> c_4(X) sel#(0(),cons(X,Y)) -> c_5(X) sel#(s(X),cons(Y,Z)) -> c_6(sel#(X,activate(Z))) - Strict TRS: activate(X) -> X activate(n__from(X)) -> from(X) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0(),cons(X,Y)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) - Signature: {activate/1,from/1,sel/2,activate#/1,from#/1,sel#/2} / {0/0,cons/2,n__from/1,s/1,c_1/1,c_2/1,c_3/2,c_4/1 ,c_5/1,c_6/1} - Obligation: runtime complexity wrt. defined symbols {activate#,from#,sel#} and constructors {0,cons,n__from,s} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: activate(X) -> X popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127