details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.04264 seconds
cpu usage	2.98881
user time	2.25592
system time	0.732893
max virtual memory	1841864.0
max residence set size	79236.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: a__U11(tt(),M,N) -> a__U12(tt(),M,N) a__U12(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__plus(N,0()) -> mark(N) a__plus(N,s(M)) -> a__U11(tt(),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2,X3)) -> a__U12(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2,X3) -> U12(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) Proof: Matrix Interpretation Processor: dim=1 interpretation: [a__plus](x0, x1) = x0 + x1, [U12](x0, x1, x2) = x0 + x1 + x2, [a__U11](x0, x1, x2) = 4x0 + x1 + x2, [mark](x0) = x0, [s](x0) = x0, [tt] = 0, [U11](x0, x1, x2) = 4x0 + x1 + x2, [plus](x0, x1) = x0 + x1, [0] = 2, [a__U12](x0, x1, x2) = x0 + x1 + x2 orientation: a__U11(tt(),M,N) = M + N >= M + N = a__U12(tt(),M,N) a__U12(tt(),M,N) = M + N >= M + N = s(a__plus(mark(N),mark(M))) a__plus(N,0()) = N + 2 >= N = mark(N) a__plus(N,s(M)) = M + N >= M + N = a__U11(tt(),M,N) mark(U11(X1,X2,X3)) = 4X1 + X2 + X3 >= 4X1 + X2 + X3 = a__U11(mark(X1),X2,X3) mark(U12(X1,X2,X3)) = X1 + X2 + X3 >= X1 + X2 + X3 = a__U12(mark(X1),X2,X3) mark(plus(X1,X2)) = X1 + X2 >= X1 + X2 = a__plus(mark(X1),mark(X2)) mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(0()) = 2 >= 2 = 0() a__U11(X1,X2,X3) = 4X1 + X2 + X3 >= 4X1 + X2 + X3 = U11(X1,X2,X3) a__U12(X1,X2,X3) = X1 + X2 + X3 >= X1 + X2 + X3 = U12(X1,X2,X3) a__plus(X1,X2) = X1 + X2 >= X1 + X2 = plus(X1,X2) problem: a__U11(tt(),M,N) -> a__U12(tt(),M,N) a__U12(tt(),M,N) -> s(a__plus(mark(N),mark(M))) a__plus(N,s(M)) -> a__U11(tt(),M,N) mark(U11(X1,X2,X3)) -> a__U11(mark(X1),X2,X3) mark(U12(X1,X2,X3)) -> a__U12(mark(X1),X2,X3) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(0()) -> 0() a__U11(X1,X2,X3) -> U11(X1,X2,X3) a__U12(X1,X2,X3) -> U12(X1,X2,X3) a__plus(X1,X2) -> plus(X1,X2) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 1 0] [a__plus](x0, x1) = [0 0 0]x0 + [0 1 0]x1 [0 0 0] [0 0 0] , [1 0 0] [1 1 0] [1 0 0] [0] [U12](x0, x1, x2) = [0 0 0]x0 + [0 1 0]x1 + [0 0 0]x2 + [1] [0 0 0] [0 0 0] [0 0 0] [0], [1 0 0] [1 1 0] [1 0 0] [1] [a__U11](x0, x1, x2) = [0 0 1]x0 + [0 1 0]x1 + [0 0 0]x2 + [1] [0 0 1] [0 0 0] [0 0 0] [0], [1 0 0] [mark](x0) = [0 1 0]x0 [0 0 0] , [1 0 0] [0] [s](x0) = [0 1 0]x0 + [1] popout

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

job log

popout

actions

all output return to TRS Standard