Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905058
details
property
value
status
complete
benchmark
thiemann12.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.227844 seconds
cpu usage
1097.66304365
max memory
2.081468416E9
stage attributes
key
value
output-size
2226
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: half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) if(false(),x,y) -> log2(half(x),y) if(true(),x,s(y)) -> y inc(0()) -> 0() inc(s(x)) -> s(inc(x)) le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) log(x) -> log2(x,0()) log2(x,y) -> if(le(x,s(0())),x,inc(y)) - Signature: {half/1,if/3,inc/1,le/2,log/1,log2/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {half,if,inc,le,log,log2} and constructors {0,false,s ,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) if(false(),x,y) -> log2(half(x),y) if(true(),x,s(y)) -> y inc(0()) -> 0() inc(s(x)) -> s(inc(x)) le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) log(x) -> log2(x,0()) log2(x,y) -> if(le(x,s(0())),x,inc(y)) - Signature: {half/1,if/3,inc/1,le/2,log/1,log2/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {half,if,inc,le,log,log2} and constructors {0,false,s ,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: half(x){x -> s(s(x))} = half(s(s(x))) ->^+ s(half(x)) = C[half(x) = half(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