details

property	value
status	complete
benchmark	#3.17a.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n191.star.cs.uiowa.edu
space	AG01

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.51488 seconds
cpu usage	4.83885
user time	4.01398
system time	0.824872
max virtual memory	1977288.0
max residence set size	88408.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: app(nil(),k) -> k app(l,nil()) -> l app(cons(x,l),k) -> cons(x,app(l,k)) sum(cons(x,nil())) -> cons(x,nil()) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l)))) pred(cons(s(x),nil())) -> cons(x,nil()) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [0] [plus](x0, x1) = [0 0 0]x0 + x1 + [1] [1 0 0] [0], [1] [app](x0, x1) = x0 + x1 + [0] [0], [1 0 0] [sum](x0) = [0 0 0]x0 [0 0 0] , [0] [0] = [0] [0], [0] [nil] = [0] [0], [1 0 0] [pred](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [s](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] orientation: [1] app(nil(),k) = k + [0] >= k = k [0] [1] app(l,nil()) = l + [0] >= l = l [0] [1 0 0] [1 0 0] [1] [1 0 0] [1 0 0] [1 0 0] [1] app(cons(x,l),k) = k + [0 0 0]l + [0 0 0]x + [0] >= [0 0 0]k + [0 0 0]l + [0 0 0]x + [0] = cons(x,app(l,k)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0 0 0] [0] [1 0 0] [1 0 0] sum(cons(x,nil())) = [0 0 0]x >= [0 0 0]x = cons(x,nil()) [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] sum(cons(x,cons(y,l))) = [0 0 0]l + [0 0 0]x + [0 0 0]y >= [0 0 0]l + [0 0 0]x + [0 0 0]y = sum(cons(plus(x,y),l)) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] [1] [1 0 0] [1 0 0] [1 0 0] [1 0 0] [1] sum(app(l,cons(x,cons(y,k)))) = [0 0 0]k + [0 0 0]l + [0 0 0]x + [0 0 0]y + [0] >= [0 0 0]k + [0 0 0]l + [0 0 0]x + [0 0 0]y + [0] = sum(app(l,sum(cons(x,cons(y,k))))) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0] [0] plus(0(),y) = y + [1] >= y = y [0] [1 0 0] [0] [1 0 0] [1 0 0] plus(s(x),y) = [0 0 0]x + y + [1] >= [0 0 0]x + [0 0 0]y = s(plus(x,y)) [1 0 0] [0] [0 0 0] [0 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] [1 0 0] sum(plus(cons(0(),x),cons(y,l))) = [0 0 0]l + [0 0 0]x + [0 0 0]y >= [0 0 0]l + [0 0 0]x + [0 0 0]y = pred(sum(cons(s(x),cons(y,l)))) [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [1 0 0] [1 0 0] pred(cons(s(x),nil())) = [0 0 0]x >= [0 0 0]x = cons(x,nil()) [0 0 0] [0 0 0] problem: app(cons(x,l),k) -> cons(x,app(l,k)) sum(cons(x,nil())) -> cons(x,nil()) sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) plus(0(),y) -> y plus(s(x),y) -> s(plus(x,y)) sum(plus(cons(0(),x),cons(y,l))) -> pred(sum(cons(s(x),cons(y,l)))) pred(cons(s(x),nil())) -> cons(x,nil()) Matrix Interpretation Processor: dim=3 popout

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

job log

popout

actions

all output return to TRS Standard