details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0199148654938 seconds
cpu usage	0.016542904
max memory	1736704.0

stage attributes

key	value
output-size	4716
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 Y) (RULES 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)) -> cons(Y) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N))) ) Problem 1: Innermost Equivalent Processor: -> Rules: 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)) -> cons(Y) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: ADD(s(X),Y) -> ADD(X,Y) DBL(s(X)) -> DBL(X) SQR(s(X)) -> ADD(sqr(X),dbl(X)) SQR(s(X)) -> DBL(X) SQR(s(X)) -> SQR(X) TERMS(N) -> SQR(N) -> Rules: 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)) -> cons(Y) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N))) Problem 1: SCC Processor: -> Pairs: ADD(s(X),Y) -> ADD(X,Y) DBL(s(X)) -> DBL(X) SQR(s(X)) -> ADD(sqr(X),dbl(X)) SQR(s(X)) -> DBL(X) SQR(s(X)) -> SQR(X) TERMS(N) -> SQR(N) -> Rules: 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)) -> cons(Y) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: DBL(s(X)) -> DBL(X) ->->-> Rules: 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)) -> cons(Y) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N))) ->->Cycle: ->->-> Pairs: ADD(s(X),Y) -> ADD(X,Y) ->->-> Rules: add(0,X) -> X add(s(X),Y) -> s(add(X,Y)) popout

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

job log

popout

actions

all output return to TRS Stand 20472