details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.526422977448 seconds
cpu usage	0.534121455
max memory	9441280.0

stage attributes

key	value
output-size	118742
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(dbl(s(X))) -> mark(s(s(dbl(X)))) active(dbl(0)) -> mark(0) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(first(0,X)) -> mark(nil) active(sqr(s(X))) -> mark(s(add(sqr(X),dbl(X)))) active(sqr(0)) -> mark(0) active(terms(N)) -> mark(cons(recip(sqr(N)),terms(s(N)))) add(active(X1),X2) -> add(X1,X2) add(mark(X1),X2) -> add(X1,X2) add(X1,active(X2)) -> add(X1,X2) add(X1,mark(X2)) -> add(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) dbl(active(X)) -> dbl(X) dbl(mark(X)) -> dbl(X) first(active(X1),X2) -> first(X1,X2) first(mark(X1),X2) -> first(X1,X2) first(X1,active(X2)) -> first(X1,X2) first(X1,mark(X2)) -> first(X1,X2) mark(add(X1,X2)) -> active(add(mark(X1),mark(X2))) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(dbl(X)) -> active(dbl(mark(X))) mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) mark(recip(X)) -> active(recip(mark(X))) mark(s(X)) -> active(s(X)) mark(sqr(X)) -> active(sqr(mark(X))) mark(terms(X)) -> active(terms(mark(X))) mark(0) -> active(0) mark(nil) -> active(nil) recip(active(X)) -> recip(X) recip(mark(X)) -> recip(X) s(active(X)) -> s(X) s(mark(X)) -> s(X) sqr(active(X)) -> sqr(X) sqr(mark(X)) -> sqr(X) terms(active(X)) -> terms(X) terms(mark(X)) -> terms(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(add(s(X),Y)) -> ADD(X,Y) ACTIVE(add(s(X),Y)) -> MARK(s(add(X,Y))) ACTIVE(add(s(X),Y)) -> S(add(X,Y)) ACTIVE(add(0,X)) -> MARK(X) ACTIVE(dbl(s(X))) -> DBL(X) ACTIVE(dbl(s(X))) -> MARK(s(s(dbl(X)))) ACTIVE(dbl(s(X))) -> S(dbl(X)) ACTIVE(dbl(s(X))) -> S(s(dbl(X))) ACTIVE(dbl(0)) -> MARK(0) ACTIVE(first(s(X),cons(Y,Z))) -> CONS(Y,first(X,Z)) ACTIVE(first(s(X),cons(Y,Z))) -> FIRST(X,Z) ACTIVE(first(s(X),cons(Y,Z))) -> MARK(cons(Y,first(X,Z))) ACTIVE(first(0,X)) -> MARK(nil) ACTIVE(sqr(s(X))) -> ADD(sqr(X),dbl(X)) ACTIVE(sqr(s(X))) -> DBL(X) ACTIVE(sqr(s(X))) -> MARK(s(add(sqr(X),dbl(X)))) ACTIVE(sqr(s(X))) -> S(add(sqr(X),dbl(X))) ACTIVE(sqr(s(X))) -> SQR(X) ACTIVE(sqr(0)) -> MARK(0) ACTIVE(terms(N)) -> CONS(recip(sqr(N)),terms(s(N))) ACTIVE(terms(N)) -> MARK(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)) ADD(active(X1),X2) -> ADD(X1,X2) ADD(mark(X1),X2) -> ADD(X1,X2) ADD(X1,active(X2)) -> ADD(X1,X2) ADD(X1,mark(X2)) -> ADD(X1,X2) CONS(active(X1),X2) -> CONS(X1,X2) CONS(mark(X1),X2) -> CONS(X1,X2) CONS(X1,active(X2)) -> CONS(X1,X2) CONS(X1,mark(X2)) -> CONS(X1,X2) DBL(active(X)) -> DBL(X) DBL(mark(X)) -> DBL(X) FIRST(active(X1),X2) -> FIRST(X1,X2) FIRST(mark(X1),X2) -> FIRST(X1,X2) FIRST(X1,active(X2)) -> FIRST(X1,X2) FIRST(X1,mark(X2)) -> FIRST(X1,X2) MARK(add(X1,X2)) -> ACTIVE(add(mark(X1),mark(X2))) MARK(add(X1,X2)) -> ADD(mark(X1),mark(X2)) popout

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

job log

popout

actions

all output return to TRS Stand 20472