details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	141.176831961 seconds
cpu usage	140.973328874
max memory	1.191936E7

stage attributes

key	value
output-size	1824
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 v_NonEmpty:S N:S X:S Y:S Z:S) (RULES add(0,X:S) -> X:S add(s(X:S),Y:S) -> s(add(X:S,Y:S)) dbl(0) -> 0 dbl(s(X:S)) -> s(s(dbl(X:S))) first(0,X:S) -> nil first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,first(X:S,Z:S)) sqr(0) -> 0 sqr(s(X:S)) -> s(add(sqr(X:S),dbl(X:S))) terms(N:S) -> cons(recip(sqr(N:S)),terms(s(N:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: ADD(s(X:S),Y:S) -> ADD(X:S,Y:S) DBL(s(X:S)) -> DBL(X:S) FIRST(s(X:S),cons(Y:S,Z:S)) -> FIRST(X:S,Z:S) SQR(s(X:S)) -> ADD(sqr(X:S),dbl(X:S)) SQR(s(X:S)) -> DBL(X:S) SQR(s(X:S)) -> SQR(X:S) TERMS(N:S) -> SQR(N:S) TERMS(N:S) -> TERMS(s(N:S)) -> Rules: add(0,X:S) -> X:S add(s(X:S),Y:S) -> s(add(X:S,Y:S)) dbl(0) -> 0 dbl(s(X:S)) -> s(s(dbl(X:S))) first(0,X:S) -> nil first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,first(X:S,Z:S)) sqr(0) -> 0 sqr(s(X:S)) -> s(add(sqr(X:S),dbl(X:S))) terms(N:S) -> cons(recip(sqr(N:S)),terms(s(N:S))) Problem 1: Infinite Processor: -> Pairs: ADD(s(X:S),Y:S) -> ADD(X:S,Y:S) DBL(s(X:S)) -> DBL(X:S) FIRST(s(X:S),cons(Y:S,Z:S)) -> FIRST(X:S,Z:S) SQR(s(X:S)) -> ADD(sqr(X:S),dbl(X:S)) SQR(s(X:S)) -> DBL(X:S) SQR(s(X:S)) -> SQR(X:S) TERMS(N:S) -> SQR(N:S) TERMS(N:S) -> TERMS(s(N:S)) -> Rules: add(0,X:S) -> X:S add(s(X:S),Y:S) -> s(add(X:S,Y:S)) dbl(0) -> 0 dbl(s(X:S)) -> s(s(dbl(X:S))) first(0,X:S) -> nil first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,first(X:S,Z:S)) sqr(0) -> 0 sqr(s(X:S)) -> s(add(sqr(X:S),dbl(X:S))) terms(N:S) -> cons(recip(sqr(N:S)),terms(s(N:S))) -> Pairs in cycle: TERMS(N:S) -> TERMS(s(N:S)) The problem is infinite. popout

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

job log

popout

actions

all output return to TRS Standard