details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	169.554353952 seconds
cpu usage	165.738651738
max memory	1.46833408E8

stage attributes

key	value
output-size	67240
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR N X X1 X2 Y Z) (RULES a__add(0,X) -> mark(X) a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) a__add(X1,X2) -> add(X1,X2) a__dbl(0) -> 0 a__dbl(s(X)) -> s(s(a__dbl(mark(X)))) a__dbl(X) -> dbl(X) a__first(0,X) -> nil a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__first(X1,X2) -> first(X1,X2) a__sqr(0) -> 0 a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)),a__dbl(mark(X)))) a__sqr(X) -> sqr(X) a__terms(N) -> cons(recip(a__sqr(mark(N))),terms(s(N))) a__terms(X) -> terms(X) mark(0) -> 0 mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(dbl(X)) -> a__dbl(mark(X)) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(nil) -> nil mark(recip(X)) -> recip(mark(X)) mark(s(X)) -> s(mark(X)) mark(sqr(X)) -> a__sqr(mark(X)) mark(terms(X)) -> a__terms(mark(X)) ) Problem 1: Dependency Pairs Processor: -> Pairs: A__ADD(0,X) -> MARK(X) A__ADD(s(X),Y) -> A__ADD(mark(X),mark(Y)) A__ADD(s(X),Y) -> MARK(X) A__ADD(s(X),Y) -> MARK(Y) A__DBL(s(X)) -> A__DBL(mark(X)) A__DBL(s(X)) -> MARK(X) A__FIRST(s(X),cons(Y,Z)) -> MARK(Y) A__SQR(s(X)) -> A__ADD(a__sqr(mark(X)),a__dbl(mark(X))) A__SQR(s(X)) -> A__DBL(mark(X)) A__SQR(s(X)) -> A__SQR(mark(X)) A__SQR(s(X)) -> MARK(X) A__TERMS(N) -> A__SQR(mark(N)) A__TERMS(N) -> MARK(N) MARK(add(X1,X2)) -> A__ADD(mark(X1),mark(X2)) MARK(add(X1,X2)) -> MARK(X1) MARK(add(X1,X2)) -> MARK(X2) MARK(cons(X1,X2)) -> MARK(X1) MARK(dbl(X)) -> A__DBL(mark(X)) MARK(dbl(X)) -> MARK(X) MARK(first(X1,X2)) -> A__FIRST(mark(X1),mark(X2)) MARK(first(X1,X2)) -> MARK(X1) MARK(first(X1,X2)) -> MARK(X2) MARK(recip(X)) -> MARK(X) MARK(s(X)) -> MARK(X) MARK(sqr(X)) -> A__SQR(mark(X)) MARK(sqr(X)) -> MARK(X) MARK(terms(X)) -> A__TERMS(mark(X)) MARK(terms(X)) -> MARK(X) -> Rules: a__add(0,X) -> mark(X) a__add(s(X),Y) -> s(a__add(mark(X),mark(Y))) a__add(X1,X2) -> add(X1,X2) a__dbl(0) -> 0 a__dbl(s(X)) -> s(s(a__dbl(mark(X)))) a__dbl(X) -> dbl(X) a__first(0,X) -> nil a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) a__first(X1,X2) -> first(X1,X2) a__sqr(0) -> 0 a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)),a__dbl(mark(X)))) a__sqr(X) -> sqr(X) a__terms(N) -> cons(recip(a__sqr(mark(N))),terms(s(N))) a__terms(X) -> terms(X) mark(0) -> 0 mark(add(X1,X2)) -> a__add(mark(X1),mark(X2)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(dbl(X)) -> a__dbl(mark(X)) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(nil) -> nil mark(recip(X)) -> recip(mark(X)) mark(s(X)) -> s(mark(X)) mark(sqr(X)) -> a__sqr(mark(X)) mark(terms(X)) -> a__terms(mark(X)) Problem 1: SCC Processor: -> Pairs: popout

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

job log

popout

actions

all output return to TRS Stand 20472