Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905066
details
property
value
status
complete
benchmark
otto09.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n042.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
203.352524042 seconds
cpu usage
756.714566569
max memory
2.200854528E9
stage attributes
key
value
output-size
2069
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: help(x,s(y),c) -> if(lt(c,x),x,s(y),c) if(false(),x,s(y),c) -> 0() if(true(),x,s(y),c) -> s(help(x,s(y),plus(c,s(y)))) lt(x,0()) -> false() lt(0(),s(y)) -> true() lt(s(x),s(y)) -> lt(x,y) plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) quot(x,s(y)) -> help(x,s(y),0()) - Signature: {help/3,if/4,lt/2,plus/2,quot/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {help,if,lt,plus,quot} 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: help(x,s(y),c) -> if(lt(c,x),x,s(y),c) if(false(),x,s(y),c) -> 0() if(true(),x,s(y),c) -> s(help(x,s(y),plus(c,s(y)))) lt(x,0()) -> false() lt(0(),s(y)) -> true() lt(s(x),s(y)) -> lt(x,y) plus(x,0()) -> x plus(x,s(y)) -> s(plus(x,y)) quot(x,s(y)) -> help(x,s(y),0()) - Signature: {help/3,if/4,lt/2,plus/2,quot/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {help,if,lt,plus,quot} and constructors {0,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: lt(x,y){x -> s(x),y -> s(y)} = lt(s(x),s(y)) ->^+ lt(x,y) = C[lt(x,y) = lt(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