Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903604
details
property
value
status
complete
benchmark
OvConsOS_nosorts-noand_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
29.691259861 seconds
cpu usage
83.180082918
max memory
3.86789376E8
stage attributes
key
value
output-size
3156
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: U11(tt(),L) -> U12(tt(),activate(L)) U12(tt(),L) -> s(length(activate(L))) U21(tt(),IL,M,N) -> U22(tt(),activate(IL),activate(M),activate(N)) U22(tt(),IL,M,N) -> U23(tt(),activate(IL),activate(M),activate(N)) U23(tt(),IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL))) activate(X) -> X activate(n__take(X1,X2)) -> take(X1,X2) activate(n__zeros()) -> zeros() length(cons(N,L)) -> U11(tt(),activate(L)) length(nil()) -> 0() take(X1,X2) -> n__take(X1,X2) take(0(),IL) -> nil() take(s(M),cons(N,IL)) -> U21(tt(),activate(IL),M,N) zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {U11/2,U12/2,U21/4,U22/4,U23/4,activate/1,length/1,take/2,zeros/0} / {0/0,cons/2,n__take/2,n__zeros/0,nil/0 ,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,U21,U22,U23,activate,length,take ,zeros} and constructors {0,cons,n__take,n__zeros,nil,s,tt} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: U11(tt(),L) -> U12(tt(),activate(L)) U12(tt(),L) -> s(length(activate(L))) U21(tt(),IL,M,N) -> U22(tt(),activate(IL),activate(M),activate(N)) U22(tt(),IL,M,N) -> U23(tt(),activate(IL),activate(M),activate(N)) U23(tt(),IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL))) activate(X) -> X activate(n__take(X1,X2)) -> take(X1,X2) activate(n__zeros()) -> zeros() length(cons(N,L)) -> U11(tt(),activate(L)) length(nil()) -> 0() take(X1,X2) -> n__take(X1,X2) take(0(),IL) -> nil() take(s(M),cons(N,IL)) -> U21(tt(),activate(IL),M,N) zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {U11/2,U12/2,U21/4,U22/4,U23/4,activate/1,length/1,take/2,zeros/0} / {0/0,cons/2,n__take/2,n__zeros/0,nil/0 ,s/1,tt/0} - Obligation: runtime complexity wrt. defined symbols {U11,U12,U21,U22,U23,activate,length,take ,zeros} and constructors {0,cons,n__take,n__zeros,nil,s,tt} + 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))) ->^+ U21(tt(),activate(v),x,z) = C[activate(v) = activate(v){}] 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