Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903091
details
property
value
status
complete
benchmark
thiemann09.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
295.032687902 seconds
cpu usage
648.015357444
max memory
3.328E8
stage attributes
key
value
output-size
2752
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /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: ack(0(),x) -> plus(x,s(0())) ack(0(),x) -> s(x) ack(s(x),0()) -> ack(x,s(0())) ack(s(x),s(y)) -> ack(x,ack(s(x),y)) div(x,y) -> quot(x,y,0()) minus(x,0()) -> x minus(0(),y) -> 0() minus(minus(x,y),z) -> minus(x,plus(y,z)) minus(s(x),s(y)) -> minus(x,y) p(0()) -> 0() p(s(x)) -> x plus(0(),y) -> y plus(s(x),y) -> plus(x,s(y)) plus(s(x),y) -> s(plus(y,x)) quot(0(),s(y),z) -> z quot(s(x),s(y),z) -> quot(minus(p(ack(0(),x)),y),s(y),s(z)) zero(0()) -> true() zero(s(x)) -> false() - Signature: {ack/2,div/2,minus/2,p/1,plus/2,quot/3,zero/1} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {ack,div,minus,p,plus,quot,zero} 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: ack(0(),x) -> plus(x,s(0())) ack(0(),x) -> s(x) ack(s(x),0()) -> ack(x,s(0())) ack(s(x),s(y)) -> ack(x,ack(s(x),y)) div(x,y) -> quot(x,y,0()) minus(x,0()) -> x minus(0(),y) -> 0() minus(minus(x,y),z) -> minus(x,plus(y,z)) minus(s(x),s(y)) -> minus(x,y) p(0()) -> 0() p(s(x)) -> x plus(0(),y) -> y plus(s(x),y) -> plus(x,s(y)) plus(s(x),y) -> s(plus(y,x)) quot(0(),s(y),z) -> z quot(s(x),s(y),z) -> quot(minus(p(ack(0(),x)),y),s(y),s(z)) zero(0()) -> true() zero(s(x)) -> false() - Signature: {ack/2,div/2,minus/2,p/1,plus/2,quot/3,zero/1} / {0/0,false/0,s/1,true/0} - Obligation: runtime complexity wrt. defined symbols {ack,div,minus,p,plus,quot,zero} and constructors {0,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: ack(s(x),y){y -> s(y)} = ack(s(x),s(y)) ->^+ ack(x,ack(s(x),y)) = C[ack(s(x),y) = ack(s(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 Full Rewri 10127