Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964763
details
property
value
status
complete
benchmark
quick.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
0.0852138996124 seconds
cpu usage
0.089789823
max memory
8794112.0
stage attributes
key
value
output-size
4762
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: le(0(),Y) -> true() 2: le(s(X),0()) -> false() 3: le(s(X),s(Y)) -> le(X,Y) 4: app(nil(),Y) -> Y 5: app(cons(N,L),Y) -> cons(N,app(L,Y)) 6: low(N,nil()) -> nil() 7: low(N,cons(M,L)) -> iflow(le(M,N),N,cons(M,L)) 8: iflow(true(),N,cons(M,L)) -> cons(M,low(N,L)) 9: iflow(false(),N,cons(M,L)) -> low(N,L) 10: high(N,nil()) -> nil() 11: high(N,cons(M,L)) -> ifhigh(le(M,N),N,cons(M,L)) 12: ifhigh(true(),N,cons(M,L)) -> high(N,L) 13: ifhigh(false(),N,cons(M,L)) -> cons(M,high(N,L)) 14: quicksort(nil()) -> nil() 15: quicksort(cons(N,L)) -> app(quicksort(low(N,L)),cons(N,quicksort(high(N,L)))) Number of strict rules: 15 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #ifhigh(false(),N,cons(M,L)) -> #high(N,L) #2: #iflow(false(),N,cons(M,L)) -> #low(N,L) #3: #high(N,cons(M,L)) -> #ifhigh(le(M,N),N,cons(M,L)) #4: #high(N,cons(M,L)) -> #le(M,N) #5: #ifhigh(true(),N,cons(M,L)) -> #high(N,L) #6: #low(N,cons(M,L)) -> #iflow(le(M,N),N,cons(M,L)) #7: #low(N,cons(M,L)) -> #le(M,N) #8: #app(cons(N,L),Y) -> #app(L,Y) #9: #le(s(X),s(Y)) -> #le(X,Y) #10: #iflow(true(),N,cons(M,L)) -> #low(N,L) #11: #quicksort(cons(N,L)) -> #app(quicksort(low(N,L)),cons(N,quicksort(high(N,L)))) #12: #quicksort(cons(N,L)) -> #quicksort(low(N,L)) #13: #quicksort(cons(N,L)) -> #low(N,L) #14: #quicksort(cons(N,L)) -> #quicksort(high(N,L)) #15: #quicksort(cons(N,L)) -> #high(N,L) Number of SCCs: 5, DPs: 10 SCC { #8 } Sum... succeeded. le(x1,x2) w: (0) s(x1) w: (0) #le(x1,x2) w: (0) #quicksort(x1) w: (0) #high(x1,x2) w: (0) false() w: (0) quicksort(x1) w: (0) true() w: (0) #iflow(x1,x2,x3) w: (0) 0() w: (0) high(x1,x2) w: (0) nil() w: (0) #app(x1,x2) w: (x1) low(x1,x2) w: (0) iflow(x1,x2,x3) w: (0) ifhigh(x1,x2,x3) w: (0) cons(x1,x2) w: (1 + x2) #ifhigh(x1,x2,x3) w: (0) #low(x1,x2) w: (0) app(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #8 Number of SCCs: 4, DPs: 9 SCC { #9 } Sum... succeeded. le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (x2) #quicksort(x1) w: (0) #high(x1,x2) w: (0) false() w: (0) quicksort(x1) w: (0) true() w: (0) #iflow(x1,x2,x3) w: (0) 0() w: (0) high(x1,x2) w: (0) nil() w: (0) #app(x1,x2) w: (0) low(x1,x2) w: (0) iflow(x1,x2,x3) w: (0) ifhigh(x1,x2,x3) w: (0) cons(x1,x2) w: (1) #ifhigh(x1,x2,x3) w: (0) #low(x1,x2) w: (0) app(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #9 Number of SCCs: 3, DPs: 8 SCC { #12 #14 } Sum... succeeded. le(x1,x2) w: (1 + x2 + x1) s(x1) w: (21239) #le(x1,x2) w: (0) #quicksort(x1) w: (x1) #high(x1,x2) w: (0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard