Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905042
details
property
value
status
complete
benchmark
thiemann06.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
227.95404911 seconds
cpu usage
853.093855234
max memory
2.789810176E9
stage attributes
key
value
output-size
2634
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: average(x,y) -> if(le(x,0()),le(y,0()),le(y,s(0())),le(y,s(s(0()))),x,y) if(false(),b1,b2,b3,x,y) -> average(p(x),s(y)) if(true(),b1,b2,b3,x,y) -> if2(b1,b2,b3,x,y) if2(false(),b2,b3,x,y) -> if3(b2,b3,x,y) if2(true(),b2,b3,x,y) -> 0() if3(false(),b3,x,y) -> if4(b3,x,y) if3(true(),b3,x,y) -> 0() if4(false(),x,y) -> average(s(x),p(p(y))) if4(true(),x,y) -> s(0()) le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) p(0()) -> 0() p(s(x)) -> x - Signature: {average/2,if/6,if2/5,if3/4,if4/3,le/2,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {average,if,if2,if3,if4,le,p} 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: average(x,y) -> if(le(x,0()),le(y,0()),le(y,s(0())),le(y,s(s(0()))),x,y) if(false(),b1,b2,b3,x,y) -> average(p(x),s(y)) if(true(),b1,b2,b3,x,y) -> if2(b1,b2,b3,x,y) if2(false(),b2,b3,x,y) -> if3(b2,b3,x,y) if2(true(),b2,b3,x,y) -> 0() if3(false(),b3,x,y) -> if4(b3,x,y) if3(true(),b3,x,y) -> 0() if4(false(),x,y) -> average(s(x),p(p(y))) if4(true(),x,y) -> s(0()) le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) p(0()) -> 0() p(s(x)) -> x - Signature: {average/2,if/6,if2/5,if3/4,if4/3,le/2,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {average,if,if2,if3,if4,le,p} and constructors {0,false,s ,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: le(x,y){x -> s(x),y -> s(y)} = le(s(x),s(y)) ->^+ le(x,y) = C[le(x,y) = le(x,y){}] 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