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