details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	2.60968 seconds
cpu usage	7.78205
user time	6.56071
system time	1.22134
max virtual memory	1932344.0
max residence set size	162620.0

stage attributes

key	value
starexec-result	NO

output

NO Problem: a__zeros() -> cons(0(),zeros()) a__and(tt(),X) -> mark(X) a__length(nil()) -> 0() a__length(cons(N,L)) -> s(a__length(mark(L))) a__take(0(),IL) -> nil() a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) mark(zeros()) -> a__zeros() mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(nil()) -> nil() mark(s(X)) -> s(mark(X)) a__zeros() -> zeros() a__and(X1,X2) -> and(X1,X2) a__length(X) -> length(X) a__take(X1,X2) -> take(X1,X2) Proof: Matrix Interpretation Processor: dim=1 interpretation: [tt] = 4, [a__length](x0) = 2x0, [0] = 0, [cons](x0, x1) = x0 + x1, [a__and](x0, x1) = 4x0 + 4x1 + 6, [a__take](x0, x1) = 2x0 + x1, [a__zeros] = 0, [nil] = 0, [and](x0, x1) = 4x0 + 4x1 + 6, [take](x0, x1) = 2x0 + x1, [s](x0) = x0, [length](x0) = 2x0, [mark](x0) = x0, [zeros] = 0 orientation: a__zeros() = 0 >= 0 = cons(0(),zeros()) a__and(tt(),X) = 4X + 22 >= X = mark(X) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = 2L + 2N >= 2L = s(a__length(mark(L))) a__take(0(),IL) = IL >= 0 = nil() a__take(s(M),cons(N,IL)) = IL + 2M + N >= IL + 2M + N = cons(mark(N),take(M,IL)) mark(zeros()) = 0 >= 0 = a__zeros() mark(and(X1,X2)) = 4X1 + 4X2 + 6 >= 4X1 + 4X2 + 6 = a__and(mark(X1),X2) mark(length(X)) = 2X >= 2X = a__length(mark(X)) mark(take(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = a__take(mark(X1),mark(X2)) mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 4 >= 4 = tt() mark(nil()) = 0 >= 0 = nil() mark(s(X)) = X >= X = s(mark(X)) a__zeros() = 0 >= 0 = zeros() a__and(X1,X2) = 4X1 + 4X2 + 6 >= 4X1 + 4X2 + 6 = and(X1,X2) a__length(X) = 2X >= 2X = length(X) a__take(X1,X2) = 2X1 + X2 >= 2X1 + X2 = take(X1,X2) problem: a__zeros() -> cons(0(),zeros()) a__length(nil()) -> 0() a__length(cons(N,L)) -> s(a__length(mark(L))) a__take(0(),IL) -> nil() a__take(s(M),cons(N,IL)) -> cons(mark(N),take(M,IL)) mark(zeros()) -> a__zeros() mark(and(X1,X2)) -> a__and(mark(X1),X2) popout

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

job log

popout

actions

all output return to TRS Standard