details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0175081 seconds
cpu usage	0.018009
user time	0.006669
system time	0.01134
max virtual memory	113188.0
max residence set size	5116.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR N X Y Z) (STRATEGY CONTEXTSENSITIVE (add 1 2) (dbl 1) (first 1 2) (sqr 1) (terms 1) (0) (cons 1) (nil) (recip 1) (s 1) ) (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)) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N)),terms(s(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,Z)) -> cons(Y,first(X,Z)) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N)),terms(s(N))) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-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,Z)) -> cons(Y,first(X,Z)) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N)),terms(s(N))) -> Unhiding Rules: Empty 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,Z)) -> cons(Y,first(X,Z)) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X),dbl(X))) terms(N) -> cons(recip(sqr(N)),terms(s(N))) -> Unhiding rules: Empty ->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 popout

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

job log

popout

actions

all output return to TRS Contextsensitive