details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.15997 seconds
cpu usage	3.43947
user time	2.67203
system time	0.767439
max virtual memory	1959520.0
max residence set size	72040.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: active(zeros()) -> mark(cons(0(),zeros())) active(tail(cons(X,XS))) -> mark(XS) active(cons(X1,X2)) -> cons(active(X1),X2) active(tail(X)) -> tail(active(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) tail(mark(X)) -> mark(tail(X)) proper(zeros()) -> ok(zeros()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(tail(X)) -> tail(proper(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) tail(ok(X)) -> ok(tail(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Proof: Matrix Interpretation Processor: dim=1 interpretation: [mark](x0) = x0, [top](x0) = 2x0, [active](x0) = x0, [cons](x0, x1) = 2x0 + x1, [tail](x0) = 2x0 + 2, [zeros] = 0, [ok](x0) = x0, [proper](x0) = x0, [0] = 0 orientation: active(zeros()) = 0 >= 0 = mark(cons(0(),zeros())) active(tail(cons(X,XS))) = 4X + 2XS + 2 >= XS = mark(XS) active(cons(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = cons(active(X1),X2) active(tail(X)) = 2X + 2 >= 2X + 2 = tail(active(X)) cons(mark(X1),X2) = 2X1 + X2 >= 2X1 + X2 = mark(cons(X1,X2)) tail(mark(X)) = 2X + 2 >= 2X + 2 = mark(tail(X)) proper(zeros()) = 0 >= 0 = ok(zeros()) proper(cons(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = cons(proper(X1),proper(X2)) proper(0()) = 0 >= 0 = ok(0()) proper(tail(X)) = 2X + 2 >= 2X + 2 = tail(proper(X)) cons(ok(X1),ok(X2)) = 2X1 + X2 >= 2X1 + X2 = ok(cons(X1,X2)) tail(ok(X)) = 2X + 2 >= 2X + 2 = ok(tail(X)) top(mark(X)) = 2X >= 2X = top(proper(X)) top(ok(X)) = 2X >= 2X = top(active(X)) problem: active(zeros()) -> mark(cons(0(),zeros())) active(cons(X1,X2)) -> cons(active(X1),X2) active(tail(X)) -> tail(active(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) tail(mark(X)) -> mark(tail(X)) proper(zeros()) -> ok(zeros()) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(tail(X)) -> tail(proper(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) tail(ok(X)) -> ok(tail(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [mark](x0) = [0 1 0]x0 + [0] [0 0 0] [1], [1 1 0] [0] [top](x0) = [0 0 0]x0 + [0] [0 0 0] [1], [1 1 0] [0] [active](x0) = [0 0 1]x0 + [0] [0 0 0] [1], [1 0 0] [cons](x0, x1) = x0 + [0 0 0]x1 [0 0 0] , popout

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

job log

popout

actions

all output return to TRS Standard