details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0210161209106 seconds
cpu usage	0.018041473
max memory	1826816.0

stage attributes

key	value
output-size	6535
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 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) half(dbl(X)) -> X half(0) -> 0 half(s(0)) -> 0 half(s(s(X))) -> s(half(X)) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N))) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ADD(s(X),Y) -> ADD(X,Y) DBL(s(X)) -> DBL(X) HALF(s(s(X))) -> HALF(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) half(dbl(X)) -> X half(0) -> 0 half(s(0)) -> 0 half(s(s(X))) -> s(half(X)) 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) HALF(s(s(X))) -> HALF(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) half(dbl(X)) -> X half(0) -> 0 half(s(0)) -> 0 half(s(s(X))) -> s(half(X)) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: HALF(s(s(X))) -> HALF(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) half(dbl(X)) -> X half(0) -> 0 half(s(0)) -> 0 half(s(s(X))) -> s(half(X)) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N))) ->->Cycle: ->->-> Pairs: DBL(s(X)) -> DBL(X) popout

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

job log

popout

actions

all output return to TRS Inner 89993