Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905260
details
property
value
status
complete
benchmark
Ex1_Luc04b_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.28289485 seconds
cpu usage
1083.65457665
max memory
3.659956224E9
stage attributes
key
value
output-size
2630
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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__incr(X)) -> incr(activate(X)) activate(n__nats()) -> nats() activate(n__odds()) -> odds() head(cons(X,XS)) -> X incr(X) -> n__incr(X) incr(cons(X,XS)) -> cons(s(X),n__incr(activate(XS))) nats() -> cons(0(),n__incr(n__nats())) nats() -> n__nats() odds() -> incr(pairs()) odds() -> n__odds() pairs() -> cons(0(),n__incr(n__odds())) tail(cons(X,XS)) -> activate(XS) - Signature: {activate/1,head/1,incr/1,nats/0,odds/0,pairs/0,tail/1} / {0/0,cons/2,n__incr/1,n__nats/0,n__odds/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,head,incr,nats,odds,pairs ,tail} and constructors {0,cons,n__incr,n__nats,n__odds,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__incr(X)) -> incr(activate(X)) activate(n__nats()) -> nats() activate(n__odds()) -> odds() head(cons(X,XS)) -> X incr(X) -> n__incr(X) incr(cons(X,XS)) -> cons(s(X),n__incr(activate(XS))) nats() -> cons(0(),n__incr(n__nats())) nats() -> n__nats() odds() -> incr(pairs()) odds() -> n__odds() pairs() -> cons(0(),n__incr(n__odds())) tail(cons(X,XS)) -> activate(XS) - Signature: {activate/1,head/1,incr/1,nats/0,odds/0,pairs/0,tail/1} / {0/0,cons/2,n__incr/1,n__nats/0,n__odds/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,head,incr,nats,odds,pairs ,tail} and constructors {0,cons,n__incr,n__nats,n__odds,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(x){x -> n__incr(x)} = activate(n__incr(x)) ->^+ incr(activate(x)) = C[activate(x) = activate(x){}] 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 Inner Rewri 22807