Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903416
details
property
value
status
complete
benchmark
ExIntrod_GM01_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
12.243844986 seconds
cpu usage
32.834458174
max memory
1.89288448E8
stage attributes
key
value
output-size
2796
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: activate(X) -> X activate(n__adx(X)) -> adx(X) activate(n__incr(X)) -> incr(X) activate(n__zeros()) -> zeros() adx(X) -> n__adx(X) adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L)))) adx(nil()) -> nil() head(cons(X,L)) -> X incr(X) -> n__incr(X) incr(cons(X,L)) -> cons(s(X),n__incr(activate(L))) incr(nil()) -> nil() nats() -> adx(zeros()) tail(cons(X,L)) -> activate(L) zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {activate/1,adx/1,head/1,incr/1,nats/0,tail/1,zeros/0} / {0/0,cons/2,n__adx/1,n__incr/1,n__zeros/0,nil/0 ,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,adx,head,incr,nats,tail,zeros} and constructors {0,cons ,n__adx,n__incr,n__zeros,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__adx(X)) -> adx(X) activate(n__incr(X)) -> incr(X) activate(n__zeros()) -> zeros() adx(X) -> n__adx(X) adx(cons(X,L)) -> incr(cons(X,n__adx(activate(L)))) adx(nil()) -> nil() head(cons(X,L)) -> X incr(X) -> n__incr(X) incr(cons(X,L)) -> cons(s(X),n__incr(activate(L))) incr(nil()) -> nil() nats() -> adx(zeros()) tail(cons(X,L)) -> activate(L) zeros() -> cons(0(),n__zeros()) zeros() -> n__zeros() - Signature: {activate/1,adx/1,head/1,incr/1,nats/0,tail/1,zeros/0} / {0/0,cons/2,n__adx/1,n__incr/1,n__zeros/0,nil/0 ,s/1} - Obligation: runtime complexity wrt. defined symbols {activate,adx,head,incr,nats,tail,zeros} and constructors {0,cons ,n__adx,n__incr,n__zeros,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(z){z -> n__adx(cons(x,z))} = activate(n__adx(cons(x,z))) ->^+ incr(cons(x,n__adx(activate(z)))) = C[activate(z) = activate(z){}] 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