Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905138
details
property
value
status
complete
benchmark
Ex2_Luc03b_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.214650869 seconds
cpu usage
828.529973306
max memory
1.588727808E9
stage attributes
key
value
output-size
3077
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__add(X1,X2) -> add(X1,X2) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__fst(X1,X2) -> fst(X1,X2) a__fst(0(),Z) -> nil() a__fst(s(X),cons(Y,Z)) -> cons(mark(Y),fst(X,Z)) a__len(X) -> len(X) a__len(cons(X,Z)) -> s(len(Z)) a__len(nil()) -> 0() mark(0()) -> 0() mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(fst(X1,X2)) -> a__fst(mark(X1),mark(X2)) mark(len(X)) -> a__len(mark(X)) mark(nil()) -> nil() mark(s(X)) -> s(X) - Signature: {a__add/2,a__from/1,a__fst/2,a__len/1,mark/1} / {0/0,add/2,cons/2,from/1,fst/2,len/1,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__add,a__from,a__fst,a__len,mark} and constructors {0 ,add,cons,from,fst,len,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: a__add(X1,X2) -> add(X1,X2) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__from(X) -> cons(mark(X),from(s(X))) a__from(X) -> from(X) a__fst(X1,X2) -> fst(X1,X2) a__fst(0(),Z) -> nil() a__fst(s(X),cons(Y,Z)) -> cons(mark(Y),fst(X,Z)) a__len(X) -> len(X) a__len(cons(X,Z)) -> s(len(Z)) a__len(nil()) -> 0() mark(0()) -> 0() mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(from(X)) -> a__from(mark(X)) mark(fst(X1,X2)) -> a__fst(mark(X1),mark(X2)) mark(len(X)) -> a__len(mark(X)) mark(nil()) -> nil() mark(s(X)) -> s(X) - Signature: {a__add/2,a__from/1,a__fst/2,a__len/1,mark/1} / {0/0,add/2,cons/2,from/1,fst/2,len/1,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {a__add,a__from,a__fst,a__len,mark} and constructors {0 ,add,cons,from,fst,len,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: mark(x){x -> add(x,y)} = mark(add(x,y)) ->^+ a__add(mark(x),mark(y)) = 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