details

property	value
status	complete
benchmark	Ex26_Luc03b_iGM.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	Transformed_CSR_innermost_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.721224 seconds
cpu usage	0.728717
user time	0.632482
system time	0.096235
max virtual memory	583412.0
max residence set size	14908.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S N:S X:S X1:S X2:S Y:S Z:S) (RULES active(add(s(X:S),Y:S)) -> mark(s(add(X:S,Y:S))) active(add(0,X:S)) -> mark(X:S) active(dbl(s(X:S))) -> mark(s(s(dbl(X:S)))) active(dbl(0)) -> mark(0) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(sqr(s(X:S))) -> mark(s(add(sqr(X:S),dbl(X:S)))) active(sqr(0)) -> mark(0) active(terms(N:S)) -> mark(cons(recip(sqr(N:S)),terms(s(N:S)))) add(active(X1:S),X2:S) -> add(X1:S,X2:S) add(mark(X1:S),X2:S) -> add(X1:S,X2:S) add(X1:S,active(X2:S)) -> add(X1:S,X2:S) add(X1:S,mark(X2:S)) -> add(X1:S,X2:S) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) dbl(active(X:S)) -> dbl(X:S) dbl(mark(X:S)) -> dbl(X:S) first(active(X1:S),X2:S) -> first(X1:S,X2:S) first(mark(X1:S),X2:S) -> first(X1:S,X2:S) first(X1:S,active(X2:S)) -> first(X1:S,X2:S) first(X1:S,mark(X2:S)) -> first(X1:S,X2:S) mark(add(X1:S,X2:S)) -> active(add(mark(X1:S),mark(X2:S))) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(dbl(X:S)) -> active(dbl(mark(X:S))) mark(first(X1:S,X2:S)) -> active(first(mark(X1:S),mark(X2:S))) mark(recip(X:S)) -> active(recip(mark(X:S))) mark(s(X:S)) -> active(s(X:S)) mark(sqr(X:S)) -> active(sqr(mark(X:S))) mark(terms(X:S)) -> active(terms(mark(X:S))) mark(0) -> active(0) mark(nil) -> active(nil) recip(active(X:S)) -> recip(X:S) recip(mark(X:S)) -> recip(X:S) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) sqr(active(X:S)) -> sqr(X:S) sqr(mark(X:S)) -> sqr(X:S) terms(active(X:S)) -> terms(X:S) terms(mark(X:S)) -> terms(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(add(s(X:S),Y:S)) -> ADD(X:S,Y:S) ACTIVE(add(s(X:S),Y:S)) -> MARK(s(add(X:S,Y:S))) ACTIVE(add(s(X:S),Y:S)) -> S(add(X:S,Y:S)) ACTIVE(add(0,X:S)) -> MARK(X:S) ACTIVE(dbl(s(X:S))) -> DBL(X:S) ACTIVE(dbl(s(X:S))) -> MARK(s(s(dbl(X:S)))) ACTIVE(dbl(s(X:S))) -> S(dbl(X:S)) ACTIVE(dbl(s(X:S))) -> S(s(dbl(X:S))) ACTIVE(dbl(0)) -> MARK(0) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> CONS(Y:S,first(X:S,Z:S)) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> FIRST(X:S,Z:S) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> MARK(cons(Y:S,first(X:S,Z:S))) ACTIVE(first(0,X:S)) -> MARK(nil) ACTIVE(sqr(s(X:S))) -> ADD(sqr(X:S),dbl(X:S)) ACTIVE(sqr(s(X:S))) -> DBL(X:S) ACTIVE(sqr(s(X:S))) -> MARK(s(add(sqr(X:S),dbl(X:S)))) ACTIVE(sqr(s(X:S))) -> S(add(sqr(X:S),dbl(X:S))) ACTIVE(sqr(s(X:S))) -> SQR(X:S) ACTIVE(sqr(0)) -> MARK(0) ACTIVE(terms(N:S)) -> CONS(recip(sqr(N:S)),terms(s(N:S))) ACTIVE(terms(N:S)) -> MARK(cons(recip(sqr(N:S)),terms(s(N:S)))) ACTIVE(terms(N:S)) -> RECIP(sqr(N:S)) ACTIVE(terms(N:S)) -> S(N:S) ACTIVE(terms(N:S)) -> SQR(N:S) ACTIVE(terms(N:S)) -> TERMS(s(N:S)) ADD(active(X1:S),X2:S) -> ADD(X1:S,X2:S) ADD(mark(X1:S),X2:S) -> ADD(X1:S,X2:S) ADD(X1:S,active(X2:S)) -> ADD(X1:S,X2:S) ADD(X1:S,mark(X2:S)) -> ADD(X1:S,X2:S) CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) DBL(active(X:S)) -> DBL(X:S) DBL(mark(X:S)) -> DBL(X:S) FIRST(active(X1:S),X2:S) -> FIRST(X1:S,X2:S) FIRST(mark(X1:S),X2:S) -> FIRST(X1:S,X2:S) FIRST(X1:S,active(X2:S)) -> FIRST(X1:S,X2:S) FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) MARK(add(X1:S,X2:S)) -> ACTIVE(add(mark(X1:S),mark(X2:S))) MARK(add(X1:S,X2:S)) -> ADD(mark(X1:S),mark(X2:S)) MARK(add(X1:S,X2:S)) -> MARK(X1:S) MARK(add(X1:S,X2:S)) -> MARK(X2:S) MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) MARK(cons(X1:S,X2:S)) -> CONS(mark(X1:S),X2:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) popout

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

job log

popout

actions

all output return to TRS Innermost