Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905011
details
property
value
status
complete
benchmark
Ex5_7_Luc97_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n029.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
297.673681974 seconds
cpu usage
1193.4207307
max memory
6.140174336E9
stage attributes
key
value
output-size
5189
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /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: a__dbl(X) -> dbl(X) a__dbl(0()) -> 0() a__dbl(s(X)) -> s(s(dbl(X))) a__dbl1(X) -> dbl1(X) a__dbl1(0()) -> 01() a__dbl1(s(X)) -> s1(s1(a__dbl1(mark(X)))) a__dbls(X) -> dbls(X) a__dbls(cons(X,Y)) -> cons(dbl(X),dbls(Y)) a__dbls(nil()) -> nil() a__from(X) -> cons(X,from(s(X))) a__from(X) -> from(X) a__indx(X1,X2) -> indx(X1,X2) a__indx(cons(X,Y),Z) -> cons(sel(X,Z),indx(Y,Z)) a__indx(nil(),X) -> nil() a__quote(X) -> quote(X) a__quote(0()) -> 01() a__quote(dbl(X)) -> a__dbl1(mark(X)) a__quote(s(X)) -> s1(a__quote(mark(X))) a__quote(sel(X,Y)) -> a__sel1(mark(X),mark(Y)) a__sel(X1,X2) -> sel(X1,X2) a__sel(0(),cons(X,Y)) -> mark(X) a__sel(s(X),cons(Y,Z)) -> a__sel(mark(X),mark(Z)) a__sel1(X1,X2) -> sel1(X1,X2) a__sel1(0(),cons(X,Y)) -> mark(X) a__sel1(s(X),cons(Y,Z)) -> a__sel1(mark(X),mark(Z)) mark(0()) -> 0() mark(01()) -> 01() mark(cons(X1,X2)) -> cons(X1,X2) mark(dbl(X)) -> a__dbl(mark(X)) mark(dbl1(X)) -> a__dbl1(mark(X)) mark(dbls(X)) -> a__dbls(mark(X)) mark(from(X)) -> a__from(X) mark(indx(X1,X2)) -> a__indx(mark(X1),X2) mark(nil()) -> nil() mark(quote(X)) -> a__quote(mark(X)) mark(s(X)) -> s(X) mark(s1(X)) -> s1(mark(X)) mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2)) mark(sel1(X1,X2)) -> a__sel1(mark(X1),mark(X2)) - Signature: {a__dbl/1,a__dbl1/1,a__dbls/1,a__from/1,a__indx/2,a__quote/1,a__sel/2,a__sel1/2,mark/1} / {0/0,01/0,cons/2 ,dbl/1,dbl1/1,dbls/1,from/1,indx/2,nil/0,quote/1,s/1,s1/1,sel/2,sel1/2} - Obligation: innermost runtime complexity wrt. defined symbols {a__dbl,a__dbl1,a__dbls,a__from,a__indx,a__quote,a__sel ,a__sel1,mark} and constructors {0,01,cons,dbl,dbl1,dbls,from,indx,nil,quote,s,s1,sel,sel1} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__dbl(X) -> dbl(X) a__dbl(0()) -> 0() a__dbl(s(X)) -> s(s(dbl(X))) a__dbl1(X) -> dbl1(X) a__dbl1(0()) -> 01() a__dbl1(s(X)) -> s1(s1(a__dbl1(mark(X)))) a__dbls(X) -> dbls(X) a__dbls(cons(X,Y)) -> cons(dbl(X),dbls(Y)) a__dbls(nil()) -> nil() a__from(X) -> cons(X,from(s(X))) a__from(X) -> from(X) a__indx(X1,X2) -> indx(X1,X2) a__indx(cons(X,Y),Z) -> cons(sel(X,Z),indx(Y,Z)) a__indx(nil(),X) -> nil() a__quote(X) -> quote(X) a__quote(0()) -> 01() a__quote(dbl(X)) -> a__dbl1(mark(X)) a__quote(s(X)) -> s1(a__quote(mark(X))) a__quote(sel(X,Y)) -> a__sel1(mark(X),mark(Y)) a__sel(X1,X2) -> sel(X1,X2) a__sel(0(),cons(X,Y)) -> mark(X) a__sel(s(X),cons(Y,Z)) -> a__sel(mark(X),mark(Z)) a__sel1(X1,X2) -> sel1(X1,X2) a__sel1(0(),cons(X,Y)) -> mark(X) a__sel1(s(X),cons(Y,Z)) -> a__sel1(mark(X),mark(Z)) mark(0()) -> 0() mark(01()) -> 01() mark(cons(X1,X2)) -> cons(X1,X2) mark(dbl(X)) -> a__dbl(mark(X)) mark(dbl1(X)) -> a__dbl1(mark(X)) mark(dbls(X)) -> a__dbls(mark(X)) mark(from(X)) -> a__from(X) mark(indx(X1,X2)) -> a__indx(mark(X1),X2) mark(nil()) -> nil() mark(quote(X)) -> a__quote(mark(X)) mark(s(X)) -> s(X) mark(s1(X)) -> s1(mark(X)) mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807