Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905276
details
property
value
status
complete
benchmark
Ex7_BLR02_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
295.663917065 seconds
cpu usage
1191.06417361
max memory
4.549730304E9
stage attributes
key
value
output-size
3454
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: a__2nd(X) -> 2nd(X) a__2nd(cons(X,XS)) -> a__head(mark(XS)) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__head(X) -> head(X) a__head(cons(X,XS)) -> mark(X) a__sel(X1,X2) -> sel(X1,X2) a__sel(0(),cons(X,XS)) -> mark(X) a__sel(s(N),cons(X,XS)) -> a__sel(mark(N),mark(XS)) a__take(X1,X2) -> take(X1,X2) a__take(0(),XS) -> nil() a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) mark(0()) -> 0() mark(2nd(X)) -> a__2nd(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(head(X)) -> a__head(mark(X)) mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) - Signature: {a__2nd/1,a__from/1,a__head/1,a__sel/2,a__take/2,mark/1} / {0/0,2nd/1,cons/2,from/1,head/1,nil/0,s/1,sel/2 ,take/2} - Obligation: innermost runtime complexity wrt. defined symbols {a__2nd,a__from,a__head,a__sel,a__take ,mark} and constructors {0,2nd,cons,from,head,nil,s,sel,take} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__2nd(X) -> 2nd(X) a__2nd(cons(X,XS)) -> a__head(mark(XS)) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__head(X) -> head(X) a__head(cons(X,XS)) -> mark(X) a__sel(X1,X2) -> sel(X1,X2) a__sel(0(),cons(X,XS)) -> mark(X) a__sel(s(N),cons(X,XS)) -> a__sel(mark(N),mark(XS)) a__take(X1,X2) -> take(X1,X2) a__take(0(),XS) -> nil() a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) mark(0()) -> 0() mark(2nd(X)) -> a__2nd(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(head(X)) -> a__head(mark(X)) mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) - Signature: {a__2nd/1,a__from/1,a__head/1,a__sel/2,a__take/2,mark/1} / {0/0,2nd/1,cons/2,from/1,head/1,nil/0,s/1,sel/2 ,take/2} - Obligation: innermost runtime complexity wrt. defined symbols {a__2nd,a__from,a__head,a__sel,a__take ,mark} and constructors {0,2nd,cons,from,head,nil,s,sel,take} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> 2nd(x)} = mark(2nd(x)) ->^+ a__2nd(mark(x)) = C[mark(x) = mark(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