Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903562
details
property
value
status
complete
benchmark
ExIntrod_GM04_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
2.37674617767 seconds
cpu usage
9.414304949
max memory
1.28147456E8
stage attributes
key
value
output-size
17502
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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: active(adx(X)) -> adx(active(X)) active(adx(cons(X,Y))) -> mark(incr(cons(X,adx(Y)))) active(hd(X)) -> hd(active(X)) active(hd(cons(X,Y))) -> mark(X) active(incr(X)) -> incr(active(X)) active(incr(cons(X,Y))) -> mark(cons(s(X),incr(Y))) active(nats()) -> mark(adx(zeros())) active(tl(X)) -> tl(active(X)) active(tl(cons(X,Y))) -> mark(Y) active(zeros()) -> mark(cons(0(),zeros())) adx(mark(X)) -> mark(adx(X)) adx(ok(X)) -> ok(adx(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) hd(mark(X)) -> mark(hd(X)) hd(ok(X)) -> ok(hd(X)) incr(mark(X)) -> mark(incr(X)) incr(ok(X)) -> ok(incr(X)) proper(0()) -> ok(0()) proper(adx(X)) -> adx(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(hd(X)) -> hd(proper(X)) proper(incr(X)) -> incr(proper(X)) proper(nats()) -> ok(nats()) proper(s(X)) -> s(proper(X)) proper(tl(X)) -> tl(proper(X)) proper(zeros()) -> ok(zeros()) s(ok(X)) -> ok(s(X)) tl(mark(X)) -> mark(tl(X)) tl(ok(X)) -> ok(tl(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,adx/1,cons/2,hd/1,incr/1,proper/1,s/1,tl/1,top/1} / {0/0,mark/1,nats/0,ok/1,zeros/0} - Obligation: runtime complexity wrt. defined symbols {active,adx,cons,hd,incr,proper,s,tl,top} and constructors {0,mark ,nats,ok,zeros} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: active(adx(X)) -> adx(active(X)) active(adx(cons(X,Y))) -> mark(incr(cons(X,adx(Y)))) active(hd(X)) -> hd(active(X)) active(hd(cons(X,Y))) -> mark(X) active(incr(X)) -> incr(active(X)) active(incr(cons(X,Y))) -> mark(cons(s(X),incr(Y))) active(nats()) -> mark(adx(zeros())) active(tl(X)) -> tl(active(X)) active(tl(cons(X,Y))) -> mark(Y) active(zeros()) -> mark(cons(0(),zeros())) adx(mark(X)) -> mark(adx(X)) adx(ok(X)) -> ok(adx(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) hd(mark(X)) -> mark(hd(X)) hd(ok(X)) -> ok(hd(X)) incr(mark(X)) -> mark(incr(X)) incr(ok(X)) -> ok(incr(X)) proper(0()) -> ok(0()) proper(adx(X)) -> adx(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(hd(X)) -> hd(proper(X)) proper(incr(X)) -> incr(proper(X)) proper(nats()) -> ok(nats()) proper(s(X)) -> s(proper(X)) proper(tl(X)) -> tl(proper(X)) proper(zeros()) -> ok(zeros()) s(ok(X)) -> ok(s(X)) tl(mark(X)) -> mark(tl(X)) tl(ok(X)) -> ok(tl(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) - Signature: {active/1,adx/1,cons/2,hd/1,incr/1,proper/1,s/1,tl/1,top/1} / {0/0,mark/1,nats/0,ok/1,zeros/0} - Obligation: runtime complexity wrt. defined symbols {active,adx,cons,hd,incr,proper,s,tl,top} and constructors {0,mark ,nats,ok,zeros} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: adx(x){x -> mark(x)} = adx(mark(x)) ->^+ mark(adx(x)) = C[adx(x) = adx(x){}] ** Step 1.b:1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127