Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904449
details
property
value
status
complete
benchmark
Ex7_BLR02.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
Strategy_removed_CSR_05
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.232661009 seconds
cpu usage
1144.27818793
max memory
2.942734336E9
stage attributes
key
value
output-size
1912
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: 2nd(cons(X,XS)) -> head(XS) from(X) -> cons(X,from(s(X))) head(cons(X,XS)) -> X sel(0(),cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) take(0(),XS) -> nil() take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) - Signature: {2nd/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {2nd,from,head,sel,take} and constructors {0,cons,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: 2nd(cons(X,XS)) -> head(XS) from(X) -> cons(X,from(s(X))) head(cons(X,XS)) -> X sel(0(),cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) take(0(),XS) -> nil() take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) - Signature: {2nd/1,from/1,head/1,sel/2,take/2} / {0/0,cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {2nd,from,head,sel,take} and constructors {0,cons,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: sel(x,z){x -> s(x),z -> cons(y,z)} = sel(s(x),cons(y,z)) ->^+ sel(x,z) = C[sel(x,z) = sel(x,z){}] 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