details

property	value
status	complete
benchmark	aprove03.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n174.star.cs.uiowa.edu
space	Secret_07_TRS

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	1.10822 seconds
cpu usage	1.09
user time	1.05
system time	0.04
max virtual memory	335616.0
max residence set size	9308.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: average(x,y) -> if(ge(x,y),x,y) 2: if(true(),x,y) -> averIter(y,x,y) 3: if(false(),x,y) -> averIter(x,y,x) 4: averIter(x,y,z) -> ifIter(ge(x,y),x,y,z) 5: ifIter(true(),x,y,z) -> z 6: ifIter(false(),x,y,z) -> averIter(plus(x,s(s(s(0())))),plus(y,s(0())),plus(z,s(0()))) 7: append(nil(),y) -> y 8: append(cons(n,x),y) -> cons(n,app(x,y)) 9: low(n,nil()) -> nil() 10: low(n,cons(m,x)) -> if_low(ge(m,n),n,cons(m,x)) 11: if_low(false(),n,cons(m,x)) -> cons(m,low(n,x)) 12: if_low(true(),n,cons(m,x)) -> low(n,x) 13: high(n,nil()) -> nil() 14: high(n,cons(m,x)) -> if_high(ge(m,n),n,cons(m,x)) 15: if_high(false(),n,cons(m,x)) -> high(n,x) 16: if_high(true(),n,cons(m,x)) -> cons(average(m,m),high(n,x)) 17: quicksort(x) -> ifquick(isempty(x),x) 18: ifquick(true(),x) -> nil() 19: ifquick(false(),x) -> append(quicksort(low(head(x),tail(x))),cons(tail(x),quicksort(high(head(x),tail(x))))) 20: plus(0(),y) -> y 21: plus(s(x),y) -> s(plus(x,y)) 22: isempty(nil()) -> true() 23: isempty(cons(n,x)) -> false() 24: head(nil()) -> error() 25: head(cons(n,x)) -> n 26: tail(nil()) -> nil() 27: tail(cons(n,x)) -> x 28: ge(x,0()) -> true() 29: ge(0(),s(y)) -> false() 30: ge(s(x),s(y)) -> ge(x,y) 31: a() -> b() 32: a() -> c() Number of strict rules: 32 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #if(true(),x,y) -> #averIter(y,x,y) #2: #ifIter(false(),x,y,z) -> #averIter(plus(x,s(s(s(0())))),plus(y,s(0())),plus(z,s(0()))) #3: #ifIter(false(),x,y,z) -> #plus(x,s(s(s(0())))) #4: #ifIter(false(),x,y,z) -> #plus(y,s(0())) #5: #ifIter(false(),x,y,z) -> #plus(z,s(0())) #6: #if_low(false(),n,cons(m,x)) -> #low(n,x) #7: #if_low(true(),n,cons(m,x)) -> #low(n,x) #8: #high(n,cons(m,x)) -> #if_high(ge(m,n),n,cons(m,x)) #9: #high(n,cons(m,x)) -> #ge(m,n) #10: #ge(s(x),s(y)) -> #ge(x,y) #11: #low(n,cons(m,x)) -> #if_low(ge(m,n),n,cons(m,x)) #12: #low(n,cons(m,x)) -> #ge(m,n) #13: #quicksort(x) -> #ifquick(isempty(x),x) #14: #quicksort(x) -> #isempty(x) #15: #ifquick(false(),x) -> #append(quicksort(low(head(x),tail(x))),cons(tail(x),quicksort(high(head(x),tail(x))))) #16: #ifquick(false(),x) -> #quicksort(low(head(x),tail(x))) #17: #ifquick(false(),x) -> #low(head(x),tail(x)) #18: #ifquick(false(),x) -> #head(x) #19: #ifquick(false(),x) -> #tail(x) #20: #ifquick(false(),x) -> #tail(x) #21: #ifquick(false(),x) -> #quicksort(high(head(x),tail(x))) #22: #ifquick(false(),x) -> #high(head(x),tail(x)) #23: #ifquick(false(),x) -> #head(x) #24: #ifquick(false(),x) -> #tail(x) #25: #plus(s(x),y) -> #plus(x,y) #26: #if_high(true(),n,cons(m,x)) -> #average(m,m) #27: #if_high(true(),n,cons(m,x)) -> #high(n,x) #28: #if(false(),x,y) -> #averIter(x,y,x) #29: #average(x,y) -> #if(ge(x,y),x,y) #30: #average(x,y) -> #ge(x,y) #31: #if_high(false(),n,cons(m,x)) -> #high(n,x) #32: #averIter(x,y,z) -> #ifIter(ge(x,y),x,y,z) #33: #averIter(x,y,z) -> #ge(x,y) Number of SCCs: 6, DPs: 13 SCC { #25 } POLO(Sum)... succeeded. a w: 0 isempty w: 0 s w: x1 + 1 #append w: 0 b w: 0 average w: 0 if_high w: 0 ifIter w: 0 #plus w: x1 #isempty w: 0 #quicksort w: 0 #high w: 0 #ifquick w: 0 false w: 0 #head w: 0 #ge w: 0 ifquick w: 0 #if_high w: 0 c w: 0 quicksort w: 0 true w: 0 tail w: 0 #ifIter w: 0 error w: 0 append w: 0 if w: 0 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard