details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.658661 seconds
cpu usage	1.47336
user time	1.19301
system time	0.28035
max virtual memory	1767800.0
max residence set size	72220.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: qsort(nil()) -> nil() qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y)))) lowers(x,nil()) -> nil() lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z)) greaters(x,nil()) -> nil() greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z))) Proof: DP Processor: DPs: qsort#(.(x,y)) -> greaters#(x,y) qsort#(.(x,y)) -> qsort#(greaters(x,y)) qsort#(.(x,y)) -> lowers#(x,y) qsort#(.(x,y)) -> qsort#(lowers(x,y)) lowers#(x,.(y,z)) -> lowers#(x,z) greaters#(x,.(y,z)) -> greaters#(x,z) TRS: qsort(nil()) -> nil() qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y)))) lowers(x,nil()) -> nil() lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z)) greaters(x,nil()) -> nil() greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z))) TDG Processor: DPs: qsort#(.(x,y)) -> greaters#(x,y) qsort#(.(x,y)) -> qsort#(greaters(x,y)) qsort#(.(x,y)) -> lowers#(x,y) qsort#(.(x,y)) -> qsort#(lowers(x,y)) lowers#(x,.(y,z)) -> lowers#(x,z) greaters#(x,.(y,z)) -> greaters#(x,z) TRS: qsort(nil()) -> nil() qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y)))) lowers(x,nil()) -> nil() lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z)) greaters(x,nil()) -> nil() greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z))) graph: lowers#(x,.(y,z)) -> lowers#(x,z) -> lowers#(x,.(y,z)) -> lowers#(x,z) greaters#(x,.(y,z)) -> greaters#(x,z) -> greaters#(x,.(y,z)) -> greaters#(x,z) qsort#(.(x,y)) -> lowers#(x,y) -> lowers#(x,.(y,z)) -> lowers#(x,z) qsort#(.(x,y)) -> greaters#(x,y) -> greaters#(x,.(y,z)) -> greaters#(x,z) qsort#(.(x,y)) -> qsort#(greaters(x,y)) -> qsort#(.(x,y)) -> qsort#(lowers(x,y)) qsort#(.(x,y)) -> qsort#(greaters(x,y)) -> qsort#(.(x,y)) -> lowers#(x,y) qsort#(.(x,y)) -> qsort#(greaters(x,y)) -> qsort#(.(x,y)) -> qsort#(greaters(x,y)) qsort#(.(x,y)) -> qsort#(greaters(x,y)) -> qsort#(.(x,y)) -> greaters#(x,y) qsort#(.(x,y)) -> qsort#(lowers(x,y)) -> qsort#(.(x,y)) -> qsort#(lowers(x,y)) qsort#(.(x,y)) -> qsort#(lowers(x,y)) -> qsort#(.(x,y)) -> lowers#(x,y) qsort#(.(x,y)) -> qsort#(lowers(x,y)) -> qsort#(.(x,y)) -> qsort#(greaters(x,y)) qsort#(.(x,y)) -> qsort#(lowers(x,y)) -> qsort#(.(x,y)) -> greaters#(x,y) SCC Processor: #sccs: 3 #rules: 4 #arcs: 12/36 DPs: qsort#(.(x,y)) -> qsort#(greaters(x,y)) qsort#(.(x,y)) -> qsort#(lowers(x,y)) TRS: qsort(nil()) -> nil() qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y)))) lowers(x,nil()) -> nil() lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z)) greaters(x,nil()) -> nil() greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z))) EDG Processor: DPs: qsort#(.(x,y)) -> qsort#(greaters(x,y)) qsort#(.(x,y)) -> qsort#(lowers(x,y)) TRS: qsort(nil()) -> nil() qsort(.(x,y)) -> ++(qsort(lowers(x,y)),.(x,qsort(greaters(x,y)))) lowers(x,nil()) -> nil() lowers(x,.(y,z)) -> if(<=(y,x),.(y,lowers(x,z)),lowers(x,z)) greaters(x,nil()) -> nil() greaters(x,.(y,z)) -> if(<=(y,x),greaters(x,z),.(y,greaters(x,z))) graph: SCC Processor: #sccs: 0 #rules: 0 #arcs: 0/4 DPs: greaters#(x,.(y,z)) -> greaters#(x,z) popout

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

job log

popout

actions

all output return to TRS Standard