details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.248854875565 seconds
cpu usage	0.249185397
max memory	7954432.0

stage attributes

key	value
output-size	94350
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR N X X1 X2 Y Z) (RULES active(add(s(X),Y)) -> mark(s(add(X,Y))) active(add(0,X)) -> mark(X) active(add(X1,X2)) -> add(active(X1),X2) active(add(X1,X2)) -> add(X1,active(X2)) active(cons(X1,X2)) -> cons(active(X1),X2) active(dbl(s(X))) -> mark(s(s(dbl(X)))) active(dbl(0)) -> mark(0) active(dbl(X)) -> dbl(active(X)) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(first(0,X)) -> mark(nil) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) active(recip(X)) -> recip(active(X)) active(sqr(s(X))) -> mark(s(add(sqr(X),dbl(X)))) active(sqr(0)) -> mark(0) active(sqr(X)) -> sqr(active(X)) active(terms(N)) -> mark(cons(recip(sqr(N)),terms(s(N)))) active(terms(X)) -> terms(active(X)) add(mark(X1),X2) -> mark(add(X1,X2)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) add(X1,mark(X2)) -> mark(add(X1,X2)) cons(mark(X1),X2) -> mark(cons(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) dbl(mark(X)) -> mark(dbl(X)) dbl(ok(X)) -> ok(dbl(X)) first(mark(X1),X2) -> mark(first(X1,X2)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(dbl(X)) -> dbl(proper(X)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(recip(X)) -> recip(proper(X)) proper(s(X)) -> s(proper(X)) proper(sqr(X)) -> sqr(proper(X)) proper(terms(X)) -> terms(proper(X)) proper(0) -> ok(0) proper(nil) -> ok(nil) recip(mark(X)) -> mark(recip(X)) recip(ok(X)) -> ok(recip(X)) s(ok(X)) -> ok(s(X)) sqr(mark(X)) -> mark(sqr(X)) sqr(ok(X)) -> ok(sqr(X)) terms(mark(X)) -> mark(terms(X)) terms(ok(X)) -> ok(terms(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(add(s(X),Y)) -> ADD(X,Y) ACTIVE(add(s(X),Y)) -> S(add(X,Y)) ACTIVE(add(X1,X2)) -> ACTIVE(X1) ACTIVE(add(X1,X2)) -> ACTIVE(X2) ACTIVE(add(X1,X2)) -> ADD(active(X1),X2) ACTIVE(add(X1,X2)) -> ADD(X1,active(X2)) ACTIVE(cons(X1,X2)) -> ACTIVE(X1) ACTIVE(cons(X1,X2)) -> CONS(active(X1),X2) ACTIVE(dbl(s(X))) -> DBL(X) ACTIVE(dbl(s(X))) -> S(dbl(X)) ACTIVE(dbl(s(X))) -> S(s(dbl(X))) ACTIVE(dbl(X)) -> ACTIVE(X) ACTIVE(dbl(X)) -> DBL(active(X)) ACTIVE(first(s(X),cons(Y,Z))) -> CONS(Y,first(X,Z)) ACTIVE(first(s(X),cons(Y,Z))) -> FIRST(X,Z) ACTIVE(first(X1,X2)) -> ACTIVE(X1) ACTIVE(first(X1,X2)) -> ACTIVE(X2) ACTIVE(first(X1,X2)) -> FIRST(active(X1),X2) ACTIVE(first(X1,X2)) -> FIRST(X1,active(X2)) ACTIVE(recip(X)) -> ACTIVE(X) ACTIVE(recip(X)) -> RECIP(active(X)) ACTIVE(sqr(s(X))) -> ADD(sqr(X),dbl(X)) ACTIVE(sqr(s(X))) -> DBL(X) ACTIVE(sqr(s(X))) -> S(add(sqr(X),dbl(X))) ACTIVE(sqr(s(X))) -> SQR(X) ACTIVE(sqr(X)) -> ACTIVE(X) ACTIVE(sqr(X)) -> SQR(active(X)) ACTIVE(terms(N)) -> CONS(recip(sqr(N)),terms(s(N))) ACTIVE(terms(N)) -> RECIP(sqr(N)) ACTIVE(terms(N)) -> S(N) ACTIVE(terms(N)) -> SQR(N) ACTIVE(terms(N)) -> TERMS(s(N)) ACTIVE(terms(X)) -> ACTIVE(X) ACTIVE(terms(X)) -> TERMS(active(X)) popout

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

job log

popout

actions

all output return to TRS Inner 89993