details

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

run statistics

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

stage attributes

key	value
output-size	1870
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR N X Y Z) (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,Z)) -> cons(Y,first(X,Z)) 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)),terms(s(N))) ) Problem 1: Dependency Pairs Processor: -> Pairs: ADD(s(X),Y) -> ADD(X,Y) DBL(s(X)) -> DBL(X) FIRST(s(X),cons(Y,Z)) -> FIRST(X,Z) 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) TERMS(N) -> TERMS(s(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,Z)) -> cons(Y,first(X,Z)) 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)),terms(s(N))) Problem 1: Infinite Processor: -> Pairs: ADD(s(X),Y) -> ADD(X,Y) DBL(s(X)) -> DBL(X) FIRST(s(X),cons(Y,Z)) -> FIRST(X,Z) 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) TERMS(N) -> TERMS(s(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,Z)) -> cons(Y,first(X,Z)) 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)),terms(s(N))) -> Pairs in cycle: TERMS(N) -> TERMS(s(N)) The problem is infinite. popout

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

job log

popout

actions

all output return to TRS Stand 20472