details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	99.3932921886 seconds
cpu usage	347.662814394
max memory	2.126106624E9

stage attributes

key	value
output-size	1398
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Problem: average(x,y) -> if(ge(x,y),x,y) if(true(),x,y) -> averIter(y,x,y) if(false(),x,y) -> averIter(x,y,x) averIter(x,y,z) -> ifIter(ge(x,y),x,y,z) ifIter(true(),x,y,z) -> z ifIter(false(),x,y,z) -> averIter(plus(x,s(s(s(0())))),plus(y,s(0())),plus(z,s(0()))) append(nil(),y) -> y append(cons(n,x),y) -> cons(n,app(x,y)) low(n,nil()) -> nil() low(n,cons(m,x)) -> if_low(ge(m,n),n,cons(m,x)) if_low(false(),n,cons(m,x)) -> cons(m,low(n,x)) if_low(true(),n,cons(m,x)) -> low(n,x) high(n,nil()) -> nil() high(n,cons(m,x)) -> if_high(ge(m,n),n,cons(m,x)) if_high(false(),n,cons(m,x)) -> high(n,x) if_high(true(),n,cons(m,x)) -> cons(average(m,m),high(n,x)) quicksort(x) -> ifquick(isempty(x),x) ifquick(true(),x) -> nil() ifquick(false(),x) -> append(quicksort(low(head(x),tail(x))),cons(tail(x),quicksort(high(head(x),tail(x))))) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) isempty(nil()) -> true() isempty(cons(n,x)) -> false() head(nil()) -> error() head(cons(n,x)) -> n tail(nil()) -> nil() tail(cons(n,x)) -> x ge(x,0()) -> true() ge(0(),s(y)) -> false() ge(s(x),s(y)) -> ge(x,y) a() -> b() a() -> c() Proof: Open popout

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

job log

popout

actions

all output return to TRS Standard