details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	22.4794 seconds
cpu usage	70.1012
user time	67.1696
system time	2.9316
max virtual memory	7095280.0
max residence set size	446868.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: active(terms(N)) -> mark(cons(recip(sqr(N)),terms(s(N)))) active(sqr(0())) -> mark(0()) active(sqr(s(X))) -> mark(s(add(sqr(X),dbl(X)))) active(dbl(0())) -> mark(0()) active(dbl(s(X))) -> mark(s(s(dbl(X)))) 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(half(0())) -> mark(0()) active(half(s(0()))) -> mark(0()) active(half(s(s(X)))) -> mark(s(half(X))) active(half(dbl(X))) -> mark(X) active(terms(X)) -> terms(active(X)) active(cons(X1,X2)) -> cons(active(X1),X2) active(recip(X)) -> recip(active(X)) active(sqr(X)) -> sqr(active(X)) active(s(X)) -> s(active(X)) active(add(X1,X2)) -> add(active(X1),X2) active(add(X1,X2)) -> add(X1,active(X2)) active(dbl(X)) -> dbl(active(X)) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) active(half(X)) -> half(active(X)) terms(mark(X)) -> mark(terms(X)) cons(mark(X1),X2) -> mark(cons(X1,X2)) recip(mark(X)) -> mark(recip(X)) sqr(mark(X)) -> mark(sqr(X)) s(mark(X)) -> mark(s(X)) add(mark(X1),X2) -> mark(add(X1,X2)) add(X1,mark(X2)) -> mark(add(X1,X2)) dbl(mark(X)) -> mark(dbl(X)) first(mark(X1),X2) -> mark(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) half(mark(X)) -> mark(half(X)) proper(terms(X)) -> terms(proper(X)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(recip(X)) -> recip(proper(X)) proper(sqr(X)) -> sqr(proper(X)) proper(s(X)) -> s(proper(X)) proper(0()) -> ok(0()) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(dbl(X)) -> dbl(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(half(X)) -> half(proper(X)) terms(ok(X)) -> ok(terms(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) recip(ok(X)) -> ok(recip(X)) sqr(ok(X)) -> ok(sqr(X)) s(ok(X)) -> ok(s(X)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) dbl(ok(X)) -> ok(dbl(X)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) half(ok(X)) -> ok(half(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Proof: DP Processor: DPs: active#(terms(N)) -> s#(N) active#(terms(N)) -> terms#(s(N)) active#(terms(N)) -> sqr#(N) active#(terms(N)) -> recip#(sqr(N)) active#(terms(N)) -> cons#(recip(sqr(N)),terms(s(N))) active#(sqr(s(X))) -> dbl#(X) active#(sqr(s(X))) -> sqr#(X) active#(sqr(s(X))) -> add#(sqr(X),dbl(X)) active#(sqr(s(X))) -> s#(add(sqr(X),dbl(X))) active#(dbl(s(X))) -> dbl#(X) active#(dbl(s(X))) -> s#(dbl(X)) active#(dbl(s(X))) -> s#(s(dbl(X))) active#(add(s(X),Y)) -> add#(X,Y) active#(add(s(X),Y)) -> s#(add(X,Y)) active#(first(s(X),cons(Y,Z))) -> first#(X,Z) active#(first(s(X),cons(Y,Z))) -> cons#(Y,first(X,Z)) active#(half(s(s(X)))) -> half#(X) active#(half(s(s(X)))) -> s#(half(X)) active#(terms(X)) -> active#(X) active#(terms(X)) -> terms#(active(X)) active#(cons(X1,X2)) -> active#(X1) active#(cons(X1,X2)) -> cons#(active(X1),X2) active#(recip(X)) -> active#(X) active#(recip(X)) -> recip#(active(X)) active#(sqr(X)) -> active#(X) active#(sqr(X)) -> sqr#(active(X)) active#(s(X)) -> active#(X) active#(s(X)) -> s#(active(X)) active#(add(X1,X2)) -> active#(X1) active#(add(X1,X2)) -> add#(active(X1),X2) active#(add(X1,X2)) -> active#(X2) active#(add(X1,X2)) -> add#(X1,active(X2)) active#(dbl(X)) -> active#(X) active#(dbl(X)) -> dbl#(active(X)) active#(first(X1,X2)) -> active#(X1) active#(first(X1,X2)) -> first#(active(X1),X2) popout

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

job log

popout

actions

all output return to TRS Standard