details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.963773 seconds
cpu usage	2.76651
user time	2.13707
system time	0.629434
max virtual memory	5344684.0
max residence set size	68688.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: cond(true(),x,y) -> cond(gr(x,y),p(x),s(y)) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x Proof: DP Processor: DPs: cond#(true(),x,y) -> p#(x) cond#(true(),x,y) -> gr#(x,y) cond#(true(),x,y) -> cond#(gr(x,y),p(x),s(y)) gr#(s(x),s(y)) -> gr#(x,y) TRS: cond(true(),x,y) -> cond(gr(x,y),p(x),s(y)) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x TDG Processor: DPs: cond#(true(),x,y) -> p#(x) cond#(true(),x,y) -> gr#(x,y) cond#(true(),x,y) -> cond#(gr(x,y),p(x),s(y)) gr#(s(x),s(y)) -> gr#(x,y) TRS: cond(true(),x,y) -> cond(gr(x,y),p(x),s(y)) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x graph: gr#(s(x),s(y)) -> gr#(x,y) -> gr#(s(x),s(y)) -> gr#(x,y) cond#(true(),x,y) -> gr#(x,y) -> gr#(s(x),s(y)) -> gr#(x,y) cond#(true(),x,y) -> cond#(gr(x,y),p(x),s(y)) -> cond#(true(),x,y) -> cond#(gr(x,y),p(x),s(y)) cond#(true(),x,y) -> cond#(gr(x,y),p(x),s(y)) -> cond#(true(),x,y) -> gr#(x,y) cond#(true(),x,y) -> cond#(gr(x,y),p(x),s(y)) -> cond#(true(),x,y) -> p#(x) SCC Processor: #sccs: 2 #rules: 2 #arcs: 5/16 DPs: cond#(true(),x,y) -> cond#(gr(x,y),p(x),s(y)) TRS: cond(true(),x,y) -> cond(gr(x,y),p(x),s(y)) gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) p(0()) -> 0() p(s(x)) -> x Usable Rule Processor: DPs: cond#(true(),x,y) -> cond#(gr(x,y),p(x),s(y)) TRS: p(0()) -> 0() p(s(x)) -> x gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) Arctic Interpretation Processor: dimension: 1 usable rules: p(0()) -> 0() p(s(x)) -> x gr(0(),x) -> false() gr(s(x),0()) -> true() gr(s(x),s(y)) -> gr(x,y) interpretation: [s](x0) = 10x0 + 10, [p](x0) = -8x0 + 0, [0] = 0, [true] = 4, [cond#](x0, x1, x2) = x0 + x1 + 0, [false] = 0, [gr](x0, x1) = -6x0 + 0 orientation: cond#(true(),x,y) = x + 4 >= -6x + 0 = cond#(gr(x,y),p(x),s(y)) p(0()) = 0 >= 0 = 0() p(s(x)) = 2x + 2 >= x = x gr(0(),x) = 0 >= 0 = false() gr(s(x),0()) = 4x + 4 >= 4 = true() popout

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

job log

popout

actions

all output return to TRS Standard