details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.0766949653625 seconds
cpu usage	0.086544414
max memory	8806400.0

stage attributes

key	value
output-size	5929
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: quot(0(),s(y)) -> 0() 4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) 5: le(0(),y) -> true() 6: le(s(x),0()) -> false() 7: le(s(x),s(y)) -> le(x,y) 8: app(nil(),y) -> y 9: app(add(n,x),y) -> add(n,app(x,y)) 10: low(n,nil()) -> nil() 11: low(n,add(m,x)) -> if_low(le(m,n),n,add(m,x)) 12: if_low(true(),n,add(m,x)) -> add(m,low(n,x)) 13: if_low(false(),n,add(m,x)) -> low(n,x) 14: high(n,nil()) -> nil() 15: high(n,add(m,x)) -> if_high(le(m,n),n,add(m,x)) 16: if_high(true(),n,add(m,x)) -> high(n,x) 17: if_high(false(),n,add(m,x)) -> add(m,high(n,x)) 18: quicksort(nil()) -> nil() 19: quicksort(add(n,x)) -> app(quicksort(low(n,x)),add(n,quicksort(high(n,x)))) Number of strict rules: 19 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(s(x),s(y)) -> #minus(x,y) #2: #if_low(false(),n,add(m,x)) -> #low(n,x) #3: #app(add(n,x),y) -> #app(x,y) #4: #low(n,add(m,x)) -> #if_low(le(m,n),n,add(m,x)) #5: #low(n,add(m,x)) -> #le(m,n) #6: #if_low(true(),n,add(m,x)) -> #low(n,x) #7: #le(s(x),s(y)) -> #le(x,y) #8: #if_high(false(),n,add(m,x)) -> #high(n,x) #9: #quicksort(add(n,x)) -> #app(quicksort(low(n,x)),add(n,quicksort(high(n,x)))) #10: #quicksort(add(n,x)) -> #quicksort(low(n,x)) #11: #quicksort(add(n,x)) -> #low(n,x) #12: #quicksort(add(n,x)) -> #quicksort(high(n,x)) #13: #quicksort(add(n,x)) -> #high(n,x) #14: #if_high(true(),n,add(m,x)) -> #high(n,x) #15: #high(n,add(m,x)) -> #if_high(le(m,n),n,add(m,x)) #16: #high(n,add(m,x)) -> #le(m,n) #17: #quot(s(x),s(y)) -> #quot(minus(x,y),s(y)) #18: #quot(s(x),s(y)) -> #minus(x,y) Number of SCCs: 7, DPs: 12 SCC { #1 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: 0 minus w: 0 if_high w: 0 #quicksort w: 0 #high w: 0 false w: 0 #if_high w: 0 quicksort w: 0 true w: 0 0 w: 0 quot w: 0 high w: 0 nil w: 0 #app w: 0 #minus w: x1 + x2 low w: 0 add w: 0 #quot w: 0 if_low w: 0 #if_low w: 0 #low w: 0 app w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 6, DPs: 11 SCC { #3 } POLO(Sum)... succeeded. le w: 0 s w: 1 #le w: 0 minus w: 0 if_high w: 0 #quicksort w: 0 #high w: 0 false w: 0 #if_high w: 0 quicksort w: 0 true w: 0 0 w: 0 quot w: 0 high w: 0 nil w: 0 #app w: x1 #minus w: 0 low w: 0 add w: x2 + 1 popout

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

job log

popout

actions

all output return to TRS Stand 20472