details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	42.3937249184 seconds
cpu usage	142.799618533
max memory	1.123790848E9

stage attributes

key	value
output-size	1519
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Problem: qsort(xs) -> qs(half(length(xs)),xs) qs(n,nil()) -> nil() qs(n,cons(x,xs)) -> append(qs(half(n),filterlow(get(n,cons(x,xs)),cons(x,xs))),cons(get(n,cons(x,xs)), qs(half(n), filterhigh ( get(n,cons(x,xs)),cons(x,xs))))) filterlow(n,nil()) -> nil() filterlow(n,cons(x,xs)) -> if1(ge(n,x),n,x,xs) if1(true(),n,x,xs) -> filterlow(n,xs) if1(false(),n,x,xs) -> cons(x,filterlow(n,xs)) filterhigh(n,nil()) -> nil() filterhigh(n,cons(x,xs)) -> if2(ge(x,n),n,x,xs) if2(true(),n,x,xs) -> filterhigh(n,xs) if2(false(),n,x,xs) -> cons(x,filterhigh(n,xs)) ge(x,0()) -> true() ge(0(),s(x)) -> false() ge(s(x),s(y)) -> ge(x,y) append(nil(),ys()) -> ys() append(cons(x,xs),ys()) -> cons(x,append(xs,ys())) length(nil()) -> 0() length(cons(x,xs)) -> s(length(xs)) half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) get(n,nil()) -> 0() get(n,cons(x,nil())) -> x get(0(),cons(x,cons(y,xs))) -> x get(s(n),cons(x,cons(y,xs))) -> get(n,cons(y,xs)) Proof: Open popout

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

job log

popout

actions

all output return to TRS Stand 20472