Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487066811
details
property
value
status
complete
benchmark
qsort.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n187.star.cs.uiowa.edu
space
AProVE_09_Inductive
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.450601 seconds
cpu usage
0.074414
user time
0.04604
system time
0.028374
max virtual memory
113188.0
max residence set size
9304.0
stage attributes
key
value
starexec-result
MAYBE
output
MAYBE Input TRS: 1: qsort(nil()) -> nil() 2: qsort(cons(x,xs)) -> append(qsort(filterlow(x,cons(x,xs))),cons(x,qsort(filterhigh(x,cons(x,xs))))) 3: filterlow(n,nil()) -> nil() 4: filterlow(n,cons(x,xs)) -> if1(ge(n,x),n,x,xs) 5: if1(true(),n,x,xs) -> filterlow(n,xs) 6: if1(false(),n,x,xs) -> cons(x,filterlow(n,xs)) 7: filterhigh(n,nil()) -> nil() 8: filterhigh(n,cons(x,xs)) -> if2(ge(x,n),n,x,xs) 9: if2(true(),n,x,xs) -> filterhigh(n,xs) 10: if2(false(),n,x,xs) -> cons(x,filterhigh(n,xs)) 11: ge(x,0()) -> true() 12: ge(0(),s(x)) -> false() 13: ge(s(x),s(y)) -> ge(x,y) 14: append(nil(),ys()) -> ys() 15: append(cons(x,xs),ys()) -> cons(x,append(xs,ys())) Number of strict rules: 15 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #qsort(cons(x,xs)) -> #append(qsort(filterlow(x,cons(x,xs))),cons(x,qsort(filterhigh(x,cons(x,xs))))) #2: #qsort(cons(x,xs)) -> #qsort(filterlow(x,cons(x,xs))) #3: #qsort(cons(x,xs)) -> #filterlow(x,cons(x,xs)) #4: #qsort(cons(x,xs)) -> #qsort(filterhigh(x,cons(x,xs))) #5: #qsort(cons(x,xs)) -> #filterhigh(x,cons(x,xs)) #6: #if1(false(),n,x,xs) -> #filterlow(n,xs) #7: #ge(s(x),s(y)) -> #ge(x,y) #8: #if2(true(),n,x,xs) -> #filterhigh(n,xs) #9: #if2(false(),n,x,xs) -> #filterhigh(n,xs) #10: #if1(true(),n,x,xs) -> #filterlow(n,xs) #11: #filterhigh(n,cons(x,xs)) -> #if2(ge(x,n),n,x,xs) #12: #filterhigh(n,cons(x,xs)) -> #ge(x,n) #13: #append(cons(x,xs),ys()) -> #append(xs,ys()) #14: #filterlow(n,cons(x,xs)) -> #if1(ge(n,x),n,x,xs) #15: #filterlow(n,cons(x,xs)) -> #ge(n,x) Number of SCCs: 5, DPs: 10 SCC { #13 } POLO(Sum)... succeeded. s w: 0 #append w: x1 if1 w: 0 false w: 0 #ge w: 0 filterlow w: 0 qsort w: 0 true w: 0 #if1 w: 0 if2 w: 0 #qsort w: 0 append w: 0 0 w: 0 ge w: 0 nil w: 0 #filterlow w: 0 cons w: x2 + 1 filterhigh w: 0 ys w: 0 #filterhigh w: 0 #if2 w: 0 USABLE RULES: { } Removed DPs: #13 Number of SCCs: 4, DPs: 9 SCC { #7 } POLO(Sum)... succeeded. s w: x1 + 1 #append w: 0 if1 w: 0 false w: 0 #ge w: x2 filterlow w: 0 qsort w: 0 true w: 0 #if1 w: 0 if2 w: 0 #qsort w: 0 append w: 0 0 w: 0 ge w: 0 nil w: 0 #filterlow w: 0 cons w: 1 filterhigh w: 0 ys w: 0 #filterhigh w: 0 #if2 w: 0 USABLE RULES: { } Removed DPs: #7 Number of SCCs: 3, DPs: 8 SCC { #2 #4 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard