Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904192
details
property
value
status
complete
benchmark
thiemann31.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_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.082386017 seconds
cpu usage
833.026065178
max memory
1.942183936E9
stage attributes
key
value
output-size
2322
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: if(false(),x,y,z,u) -> if2(le(y,s(u)),x,y,s(z),s(u)) if(true(),x,y,z,u) -> u if2(false(),x,y,z,u) -> modIter(x,y,z,u) if2(true(),x,y,z,u) -> modIter(x,y,z,0()) le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) mod(x,0()) -> modZeroErro() mod(x,s(y)) -> modIter(x,s(y),0(),0()) modIter(x,s(y),z,u) -> if(le(x,z),x,s(y),z,u) - Signature: {if/5,if2/5,le/2,mod/2,modIter/4} / {0/0,false/0,modZeroErro/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if,if2,le,mod,modIter} and constructors {0,false ,modZeroErro,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: if(false(),x,y,z,u) -> if2(le(y,s(u)),x,y,s(z),s(u)) if(true(),x,y,z,u) -> u if2(false(),x,y,z,u) -> modIter(x,y,z,u) if2(true(),x,y,z,u) -> modIter(x,y,z,0()) le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) mod(x,0()) -> modZeroErro() mod(x,s(y)) -> modIter(x,s(y),0(),0()) modIter(x,s(y),z,u) -> if(le(x,z),x,s(y),z,u) - Signature: {if/5,if2/5,le/2,mod/2,modIter/4} / {0/0,false/0,modZeroErro/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {if,if2,le,mod,modIter} and constructors {0,false ,modZeroErro,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