details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	2.88447 seconds
cpu usage	7.73269
user time	6.40436
system time	1.32833
max virtual memory	3713104.0
max residence set size	173464.0

stage attributes

key	value
starexec-result	NO

output

NO Problem: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__U12(X1,X2) -> U12(X1,X2) a__length(X) -> length(X) Proof: Matrix Interpretation Processor: dim=1 interpretation: [tt] = 0, [a__length](x0) = x0, [0] = 0, [cons](x0, x1) = x0 + 4x1, [a__U11](x0, x1) = x0 + 4x1, [nil] = 2, [a__zeros] = 0, [mark](x0) = 4x0, [U12](x0, x1) = x0 + 4x1, [U11](x0, x1) = x0 + 2x1, [s](x0) = x0, [length](x0) = x0, [a__U12](x0, x1) = x0 + 4x1, [zeros] = 0 orientation: a__zeros() = 0 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = 4L >= 4L = a__U12(tt(),L) a__U12(tt(),L) = 4L >= 4L = s(a__length(mark(L))) a__length(nil()) = 2 >= 0 = 0() a__length(cons(N,L)) = 4L + N >= 4L = a__U11(tt(),L) mark(zeros()) = 0 >= 0 = a__zeros() mark(U11(X1,X2)) = 4X1 + 8X2 >= 4X1 + 4X2 = a__U11(mark(X1),X2) mark(U12(X1,X2)) = 4X1 + 16X2 >= 4X1 + 4X2 = a__U12(mark(X1),X2) mark(length(X)) = 4X >= 4X = a__length(mark(X)) mark(cons(X1,X2)) = 4X1 + 16X2 >= 4X1 + 4X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = 4X >= 4X = s(mark(X)) mark(nil()) = 8 >= 2 = nil() a__zeros() = 0 >= 0 = zeros() a__U11(X1,X2) = X1 + 4X2 >= X1 + 2X2 = U11(X1,X2) a__U12(X1,X2) = X1 + 4X2 >= X1 + 4X2 = U12(X1,X2) a__length(X) = X >= X = length(X) problem: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() popout

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

job log

popout

actions

all output return to TRS Standard