details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0204448699951 seconds
cpu usage	0.017053732
max memory	1871872.0

stage attributes

key	value
output-size	8569
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 activate(n__first(X1,X2)) -> first(X1,X2) activate(n__terms(X)) -> terms(X) activate(X) -> X add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) dbl(0) -> 0 dbl(s(X)) -> s(s(dbl(X))) first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(X1,X2) -> n__first(X1,X2) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N)),n__terms(s(N))) terms(X) -> n__terms(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__first(X1,X2)) -> FIRST(X1,X2) ACTIVATE(n__terms(X)) -> TERMS(X) ADD(s(X),Y) -> ADD(X,Y) DBL(s(X)) -> DBL(X) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) SQR(s(X)) -> ADD(sqr(X),dbl(X)) SQR(s(X)) -> DBL(X) SQR(s(X)) -> SQR(X) TERMS(N) -> SQR(N) -> Rules: activate(n__first(X1,X2)) -> first(X1,X2) activate(n__terms(X)) -> terms(X) activate(X) -> X add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) dbl(0) -> 0 dbl(s(X)) -> s(s(dbl(X))) first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(X1,X2) -> n__first(X1,X2) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N)),n__terms(s(N))) terms(X) -> n__terms(X) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__first(X1,X2)) -> FIRST(X1,X2) ACTIVATE(n__terms(X)) -> TERMS(X) ADD(s(X),Y) -> ADD(X,Y) DBL(s(X)) -> DBL(X) FIRST(s(X),cons(Y,Z)) -> ACTIVATE(Z) SQR(s(X)) -> ADD(sqr(X),dbl(X)) SQR(s(X)) -> DBL(X) SQR(s(X)) -> SQR(X) TERMS(N) -> SQR(N) -> Rules: activate(n__first(X1,X2)) -> first(X1,X2) activate(n__terms(X)) -> terms(X) activate(X) -> X add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) dbl(0) -> 0 dbl(s(X)) -> s(s(dbl(X))) first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(X1,X2) -> n__first(X1,X2) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N)),n__terms(s(N))) terms(X) -> n__terms(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: DBL(s(X)) -> DBL(X) ->->-> Rules: activate(n__first(X1,X2)) -> first(X1,X2) activate(n__terms(X)) -> terms(X) activate(X) -> X add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) dbl(0) -> 0 dbl(s(X)) -> s(s(dbl(X))) first(0,X) -> nil first(s(X),cons(Y,Z)) -> cons(Y,n__first(X,activate(Z))) first(X1,X2) -> n__first(X1,X2) popout

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

job log

popout

actions

all output return to TRS Stand 20472