Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903574
details
property
value
status
complete
benchmark
Ex1_Luc02b_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
2.24337601662 seconds
cpu usage
8.858438384
max memory
1.18718464E8
stage attributes
key
value
output-size
61645
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__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) first(X1,X2) -> n__first(X1,X2) first(0(),Z) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0(),cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) - Signature: {activate/1,first/2,from/1,sel/2} / {0/0,cons/2,n__first/2,n__from/1,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,first,from,sel} and constructors {0,cons,n__first,n__from ,nil,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__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) first(X1,X2) -> n__first(X1,X2) first(0(),Z) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0(),cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) - Signature: {activate/1,first/2,from/1,sel/2} / {0/0,cons/2,n__first/2,n__from/1,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,first,from,sel} and constructors {0,cons,n__first,n__from ,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(v){v -> n__first(s(x),cons(z,v))} = activate(n__first(s(x),cons(z,v))) ->^+ cons(z,n__first(x,activate(v))) = C[activate(v) = activate(v){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__first(X1,X2)) -> first(X1,X2) activate(n__from(X)) -> from(X) first(X1,X2) -> n__first(X1,X2) first(0(),Z) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) from(X) -> cons(X,n__from(s(X))) from(X) -> n__from(X) sel(0(),cons(X,Z)) -> X sel(s(X),cons(Y,Z)) -> sel(X,activate(Z)) - Signature: {activate/1,first/2,from/1,sel/2} / {0/0,cons/2,n__first/2,n__from/1,nil/0,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,first,from,sel} and constructors {0,cons,n__first,n__from ,nil,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following weak dependency pairs: Strict DPs activate#(X) -> c_1(X) activate#(n__first(X1,X2)) -> c_2(first#(X1,X2)) activate#(n__from(X)) -> c_3(from#(X)) first#(X1,X2) -> c_4(X1,X2) first#(0(),Z) -> c_5() first#(s(X),cons(Y,Z)) -> c_6(Y,X,activate#(Z)) from#(X) -> c_7(X,X) from#(X) -> c_8(X) sel#(0(),cons(X,Z)) -> c_9(X) sel#(s(X),cons(Y,Z)) -> c_10(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__first(X1,X2)) -> c_2(first#(X1,X2)) activate#(n__from(X)) -> c_3(from#(X)) first#(X1,X2) -> c_4(X1,X2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127