details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	5.08759 seconds
cpu usage	22.9355
user time	19.7101
system time	3.22542
max virtual memory	5962932.0
max residence set size	123532.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: terms(N) -> cons(recip(sqr(N)),n__terms(s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(n__add(sqr(activate(X)),dbl(activate(X)))) dbl(0()) -> 0() dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(activate(X),activate(Z))) terms(X) -> n__terms(X) add(X1,X2) -> n__add(X1,X2) s(X) -> n__s(X) dbl(X) -> n__dbl(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(X) activate(n__add(X1,X2)) -> add(X1,X2) activate(n__s(X)) -> s(X) activate(n__dbl(X)) -> dbl(X) activate(n__first(X1,X2)) -> first(X1,X2) activate(X) -> X Proof: DP Processor: DPs: terms#(N) -> s#(N) terms#(N) -> sqr#(N) sqr#(s(X)) -> dbl#(activate(X)) sqr#(s(X)) -> activate#(X) sqr#(s(X)) -> sqr#(activate(X)) sqr#(s(X)) -> s#(n__add(sqr(activate(X)),dbl(activate(X)))) dbl#(s(X)) -> activate#(X) dbl#(s(X)) -> s#(n__s(n__dbl(activate(X)))) add#(s(X),Y) -> activate#(X) add#(s(X),Y) -> s#(n__add(activate(X),Y)) first#(s(X),cons(Y,Z)) -> activate#(Z) first#(s(X),cons(Y,Z)) -> activate#(X) activate#(n__terms(X)) -> terms#(X) activate#(n__add(X1,X2)) -> add#(X1,X2) activate#(n__s(X)) -> s#(X) activate#(n__dbl(X)) -> dbl#(X) activate#(n__first(X1,X2)) -> first#(X1,X2) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(n__add(sqr(activate(X)),dbl(activate(X)))) dbl(0()) -> 0() dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(activate(X),activate(Z))) terms(X) -> n__terms(X) add(X1,X2) -> n__add(X1,X2) s(X) -> n__s(X) dbl(X) -> n__dbl(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(X) activate(n__add(X1,X2)) -> add(X1,X2) activate(n__s(X)) -> s(X) activate(n__dbl(X)) -> dbl(X) activate(n__first(X1,X2)) -> first(X1,X2) activate(X) -> X TDG Processor: DPs: terms#(N) -> s#(N) terms#(N) -> sqr#(N) sqr#(s(X)) -> dbl#(activate(X)) sqr#(s(X)) -> activate#(X) sqr#(s(X)) -> sqr#(activate(X)) sqr#(s(X)) -> s#(n__add(sqr(activate(X)),dbl(activate(X)))) dbl#(s(X)) -> activate#(X) dbl#(s(X)) -> s#(n__s(n__dbl(activate(X)))) add#(s(X),Y) -> activate#(X) add#(s(X),Y) -> s#(n__add(activate(X),Y)) first#(s(X),cons(Y,Z)) -> activate#(Z) first#(s(X),cons(Y,Z)) -> activate#(X) activate#(n__terms(X)) -> terms#(X) activate#(n__add(X1,X2)) -> add#(X1,X2) activate#(n__s(X)) -> s#(X) activate#(n__dbl(X)) -> dbl#(X) activate#(n__first(X1,X2)) -> first#(X1,X2) TRS: terms(N) -> cons(recip(sqr(N)),n__terms(s(N))) sqr(0()) -> 0() sqr(s(X)) -> s(n__add(sqr(activate(X)),dbl(activate(X)))) dbl(0()) -> 0() dbl(s(X)) -> s(n__s(n__dbl(activate(X)))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) first(0(),X) -> nil() first(s(X),cons(Y,Z)) -> cons(Y,n__first(activate(X),activate(Z))) terms(X) -> n__terms(X) add(X1,X2) -> n__add(X1,X2) s(X) -> n__s(X) dbl(X) -> n__dbl(X) first(X1,X2) -> n__first(X1,X2) activate(n__terms(X)) -> terms(X) popout

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

job log

popout

actions

all output return to TRS Standard