Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904246
details
property
value
status
complete
benchmark
thiemann40_modified.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
AProVE_08
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.48379302 seconds
cpu usage
1105.17178537
max memory
6.42953216E8
stage attributes
key
value
output-size
2100
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: id_inc(x) -> x id_inc(x) -> s(x) if(false(),x,y) -> y if(true(),x,y) -> rand(p(x),id_inc(y)) nonZero(0()) -> false() nonZero(s(x)) -> true() p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) rand(x,y) -> if(nonZero(x),x,y) random(x) -> rand(x,0()) - Signature: {id_inc/1,if/3,nonZero/1,p/1,rand/2,random/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {id_inc,if,nonZero,p,rand,random} 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: id_inc(x) -> x id_inc(x) -> s(x) if(false(),x,y) -> y if(true(),x,y) -> rand(p(x),id_inc(y)) nonZero(0()) -> false() nonZero(s(x)) -> true() p(s(0())) -> 0() p(s(s(x))) -> s(p(s(x))) rand(x,y) -> if(nonZero(x),x,y) random(x) -> rand(x,0()) - Signature: {id_inc/1,if/3,nonZero/1,p/1,rand/2,random/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {id_inc,if,nonZero,p,rand,random} and constructors {0 ,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: p(s(x)){x -> s(x)} = p(s(s(x))) ->^+ s(p(s(x))) = C[p(s(x)) = p(s(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