Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713230
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
n046.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
1.38605380058 seconds
cpu usage
3.953757089
max memory
4.28142592E8
stage attributes
key
value
output-size
14414
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: le(0(),Y) -> true() le(s(X),0()) -> false() le(s(X),s(Y)) -> le(X,Y) app(nil(),Y) -> Y app(cons(N,L),Y) -> cons(N,app(L,Y)) low(N,nil()) -> nil() low(N,cons(M,L)) -> iflow(le(M,N),N,cons(M,L)) iflow(true(),N,cons(M,L)) -> cons(M,low(N,L)) iflow(false(),N,cons(M,L)) -> low(N,L) high(N,nil()) -> nil() high(N,cons(M,L)) -> ifhigh(le(M,N),N,cons(M,L)) ifhigh(true(),N,cons(M,L)) -> high(N,L) ifhigh(false(),N,cons(M,L)) -> cons(M,high(N,L)) quicksort(nil()) -> nil() quicksort(cons(N,L)) -> app(quicksort(low(N,L)),cons(N,quicksort(high(N,L)))) Proof: DP Processor: DPs: le#(s(X),s(Y)) -> le#(X,Y) app#(cons(N,L),Y) -> app#(L,Y) low#(N,cons(M,L)) -> le#(M,N) low#(N,cons(M,L)) -> iflow#(le(M,N),N,cons(M,L)) iflow#(true(),N,cons(M,L)) -> low#(N,L) iflow#(false(),N,cons(M,L)) -> low#(N,L) high#(N,cons(M,L)) -> le#(M,N) high#(N,cons(M,L)) -> ifhigh#(le(M,N),N,cons(M,L)) ifhigh#(true(),N,cons(M,L)) -> high#(N,L) ifhigh#(false(),N,cons(M,L)) -> high#(N,L) quicksort#(cons(N,L)) -> high#(N,L) quicksort#(cons(N,L)) -> quicksort#(high(N,L)) quicksort#(cons(N,L)) -> low#(N,L) quicksort#(cons(N,L)) -> quicksort#(low(N,L)) quicksort#(cons(N,L)) -> app#(quicksort(low(N,L)),cons(N,quicksort(high(N,L)))) TRS: le(0(),Y) -> true() le(s(X),0()) -> false() le(s(X),s(Y)) -> le(X,Y) app(nil(),Y) -> Y app(cons(N,L),Y) -> cons(N,app(L,Y)) low(N,nil()) -> nil() low(N,cons(M,L)) -> iflow(le(M,N),N,cons(M,L)) iflow(true(),N,cons(M,L)) -> cons(M,low(N,L)) iflow(false(),N,cons(M,L)) -> low(N,L) high(N,nil()) -> nil() high(N,cons(M,L)) -> ifhigh(le(M,N),N,cons(M,L)) ifhigh(true(),N,cons(M,L)) -> high(N,L) ifhigh(false(),N,cons(M,L)) -> cons(M,high(N,L)) quicksort(nil()) -> nil() quicksort(cons(N,L)) -> app(quicksort(low(N,L)),cons(N,quicksort(high(N,L)))) TDG Processor: DPs: le#(s(X),s(Y)) -> le#(X,Y) app#(cons(N,L),Y) -> app#(L,Y) low#(N,cons(M,L)) -> le#(M,N) low#(N,cons(M,L)) -> iflow#(le(M,N),N,cons(M,L)) iflow#(true(),N,cons(M,L)) -> low#(N,L) iflow#(false(),N,cons(M,L)) -> low#(N,L) high#(N,cons(M,L)) -> le#(M,N) high#(N,cons(M,L)) -> ifhigh#(le(M,N),N,cons(M,L)) ifhigh#(true(),N,cons(M,L)) -> high#(N,L) ifhigh#(false(),N,cons(M,L)) -> high#(N,L) quicksort#(cons(N,L)) -> high#(N,L) quicksort#(cons(N,L)) -> quicksort#(high(N,L)) quicksort#(cons(N,L)) -> low#(N,L) quicksort#(cons(N,L)) -> quicksort#(low(N,L)) quicksort#(cons(N,L)) -> app#(quicksort(low(N,L)),cons(N,quicksort(high(N,L)))) TRS: le(0(),Y) -> true() le(s(X),0()) -> false() le(s(X),s(Y)) -> le(X,Y) app(nil(),Y) -> Y app(cons(N,L),Y) -> cons(N,app(L,Y)) low(N,nil()) -> nil() low(N,cons(M,L)) -> iflow(le(M,N),N,cons(M,L)) iflow(true(),N,cons(M,L)) -> cons(M,low(N,L)) iflow(false(),N,cons(M,L)) -> low(N,L) high(N,nil()) -> nil() high(N,cons(M,L)) -> ifhigh(le(M,N),N,cons(M,L)) ifhigh(true(),N,cons(M,L)) -> high(N,L) ifhigh(false(),N,cons(M,L)) -> cons(M,high(N,L)) quicksort(nil()) -> nil() quicksort(cons(N,L)) -> app(quicksort(low(N,L)),cons(N,quicksort(high(N,L)))) graph: quicksort#(cons(N,L)) -> quicksort#(high(N,L)) -> quicksort#(cons(N,L)) -> app#(quicksort(low(N,L)),cons(N,quicksort(high(N,L)))) quicksort#(cons(N,L)) -> quicksort#(high(N,L)) -> quicksort#(cons(N,L)) -> quicksort#(low(N,L)) quicksort#(cons(N,L)) -> quicksort#(high(N,L)) -> quicksort#(cons(N,L)) -> low#(N,L) quicksort#(cons(N,L)) -> quicksort#(high(N,L)) ->
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472