details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.565312862396 seconds
cpu usage	0.941599614
max memory	2.41487872E8

stage attributes

key	value
output-size	5611
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: sort(nil()) -> nil() sort(cons(x,y)) -> insert(x,sort(y)) insert(x,nil()) -> cons(x,nil()) insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v) choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w)) choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w)) choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z) Proof: DP Processor: DPs: sort#(cons(x,y)) -> sort#(y) sort#(cons(x,y)) -> insert#(x,sort(y)) insert#(x,cons(v,w)) -> choose#(x,cons(v,w),x,v) choose#(x,cons(v,w),0(),s(z)) -> insert#(x,w) choose#(x,cons(v,w),s(y),s(z)) -> choose#(x,cons(v,w),y,z) TRS: sort(nil()) -> nil() sort(cons(x,y)) -> insert(x,sort(y)) insert(x,nil()) -> cons(x,nil()) insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v) choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w)) choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w)) choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z) TDG Processor: DPs: sort#(cons(x,y)) -> sort#(y) sort#(cons(x,y)) -> insert#(x,sort(y)) insert#(x,cons(v,w)) -> choose#(x,cons(v,w),x,v) choose#(x,cons(v,w),0(),s(z)) -> insert#(x,w) choose#(x,cons(v,w),s(y),s(z)) -> choose#(x,cons(v,w),y,z) TRS: sort(nil()) -> nil() sort(cons(x,y)) -> insert(x,sort(y)) insert(x,nil()) -> cons(x,nil()) insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v) choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w)) choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w)) choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z) graph: choose#(x,cons(v,w),s(y),s(z)) -> choose#(x,cons(v,w),y,z) -> choose#(x,cons(v,w),s(y),s(z)) -> choose#(x,cons(v,w),y,z) choose#(x,cons(v,w),s(y),s(z)) -> choose#(x,cons(v,w),y,z) -> choose#(x,cons(v,w),0(),s(z)) -> insert#(x,w) choose#(x,cons(v,w),0(),s(z)) -> insert#(x,w) -> insert#(x,cons(v,w)) -> choose#(x,cons(v,w),x,v) insert#(x,cons(v,w)) -> choose#(x,cons(v,w),x,v) -> choose#(x,cons(v,w),s(y),s(z)) -> choose#(x,cons(v,w),y,z) insert#(x,cons(v,w)) -> choose#(x,cons(v,w),x,v) -> choose#(x,cons(v,w),0(),s(z)) -> insert#(x,w) sort#(cons(x,y)) -> insert#(x,sort(y)) -> insert#(x,cons(v,w)) -> choose#(x,cons(v,w),x,v) sort#(cons(x,y)) -> sort#(y) -> sort#(cons(x,y)) -> insert#(x,sort(y)) sort#(cons(x,y)) -> sort#(y) -> sort#(cons(x,y)) -> sort#(y) SCC Processor: #sccs: 2 #rules: 4 #arcs: 8/25 DPs: sort#(cons(x,y)) -> sort#(y) TRS: sort(nil()) -> nil() sort(cons(x,y)) -> insert(x,sort(y)) insert(x,nil()) -> cons(x,nil()) insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v) choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w)) choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w)) choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z) Subterm Criterion Processor: simple projection: pi(sort#) = 0 problem: DPs: TRS: sort(nil()) -> nil() sort(cons(x,y)) -> insert(x,sort(y)) insert(x,nil()) -> cons(x,nil()) insert(x,cons(v,w)) -> choose(x,cons(v,w),x,v) choose(x,cons(v,w),y,0()) -> cons(x,cons(v,w)) choose(x,cons(v,w),0(),s(z)) -> cons(v,insert(x,w)) choose(x,cons(v,w),s(y),s(z)) -> choose(x,cons(v,w),y,z) Qed DPs: choose#(x,cons(v,w),s(y),s(z)) -> choose#(x,cons(v,w),y,z) choose#(x,cons(v,w),0(),s(z)) -> insert#(x,w) insert#(x,cons(v,w)) -> choose#(x,cons(v,w),x,v) TRS: sort(nil()) -> nil() popout

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

job log

popout

actions

all output return to TRS Standard