details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	4.48359 seconds
cpu usage	14.6026
user time	13.1294
system time	1.47328
max virtual memory	2116632.0
max residence set size	197100.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: active(and(true(),X)) -> mark(X) active(and(false(),Y)) -> mark(false()) active(if(true(),X,Y)) -> mark(X) active(if(false(),X,Y)) -> mark(Y) active(add(0(),X)) -> mark(X) active(add(s(X),Y)) -> mark(s(add(X,Y))) active(first(0(),X)) -> mark(nil()) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(from(X)) -> mark(cons(X,from(s(X)))) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(true()) -> active(true()) mark(false()) -> active(false()) mark(if(X1,X2,X3)) -> active(if(mark(X1),X2,X3)) mark(add(X1,X2)) -> active(add(mark(X1),X2)) mark(0()) -> active(0()) mark(s(X)) -> active(s(X)) mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(cons(X1,X2)) -> active(cons(X1,X2)) mark(from(X)) -> active(from(X)) and(mark(X1),X2) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) and(active(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) if(mark(X1),X2,X3) -> if(X1,X2,X3) if(X1,mark(X2),X3) -> if(X1,X2,X3) if(X1,X2,mark(X3)) -> if(X1,X2,X3) if(active(X1),X2,X3) -> if(X1,X2,X3) if(X1,active(X2),X3) -> if(X1,X2,X3) if(X1,X2,active(X3)) -> if(X1,X2,X3) add(mark(X1),X2) -> add(X1,X2) add(X1,mark(X2)) -> add(X1,X2) add(active(X1),X2) -> add(X1,X2) add(X1,active(X2)) -> add(X1,X2) s(mark(X)) -> s(X) s(active(X)) -> s(X) first(mark(X1),X2) -> first(X1,X2) first(X1,mark(X2)) -> first(X1,X2) first(active(X1),X2) -> first(X1,X2) first(X1,active(X2)) -> first(X1,X2) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) from(mark(X)) -> from(X) from(active(X)) -> from(X) Proof: Matrix Interpretation Processor: dim=3 interpretation: [0] [false] = [1] [1], [1 1 0] [1] [s](x0) = [0 0 0]x0 + [0] [0 0 0] [0], [1 0 0] [1 0 0] [1] [and](x0, x1) = [0 1 0]x0 + [0 1 0]x1 + [1] [0 0 0] [0 1 0] [1], [1 1 0] [mark](x0) = [0 1 0]x0 [0 0 0] , [1 0 0] [1 1 0] [1 0 0] [if](x0, x1, x2) = [0 1 0]x0 + [0 1 0]x1 + [0 1 0]x2 [0 0 0] [0 0 0] [0 1 0] , [0] [nil] = [0] [0], [0] [true] = [1] [0], [1 0 0] [1 0 0] [0] [add](x0, x1) = [0 1 0]x0 + [0 1 0]x1 + [1] [0 0 0] [0 1 0] [1], [1 1 0] [0] [from](x0) = [1 1 0]x0 + [1] [1 1 0] [1], [1 1 0] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [1 0 0] [1 0 0] [first](x0, x1) = [0 1 0]x0 + [0 1 0]x1 [0 0 0] [0 0 0] , [0] [0] = [0] popout

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

job log

popout

actions

all output return to TRS Standard