details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.532726 seconds
cpu usage	0.541764
user time	0.452894
system time	0.08887
max virtual memory	113188.0
max residence set size	13380.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S M:S N:S X:S X1:S X2:S X3:S Y:S) (RULES active(filter(cons(X:S,Y:S),s(N:S),M:S)) -> mark(cons(X:S,filter(Y:S,N:S,M:S))) active(filter(cons(X:S,Y:S),0,M:S)) -> mark(cons(0,filter(Y:S,M:S,M:S))) active(nats(N:S)) -> mark(cons(N:S,nats(s(N:S)))) active(sieve(cons(s(N:S),Y:S))) -> mark(cons(s(N:S),sieve(filter(Y:S,N:S,N:S)))) active(sieve(cons(0,Y:S))) -> mark(cons(0,sieve(Y:S))) active(zprimes) -> mark(sieve(nats(s(s(0))))) 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) filter(active(X1:S),X2:S,X3:S) -> filter(X1:S,X2:S,X3:S) filter(mark(X1:S),X2:S,X3:S) -> filter(X1:S,X2:S,X3:S) filter(X1:S,active(X2:S),X3:S) -> filter(X1:S,X2:S,X3:S) filter(X1:S,mark(X2:S),X3:S) -> filter(X1:S,X2:S,X3:S) filter(X1:S,X2:S,active(X3:S)) -> filter(X1:S,X2:S,X3:S) filter(X1:S,X2:S,mark(X3:S)) -> filter(X1:S,X2:S,X3:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(filter(X1:S,X2:S,X3:S)) -> active(filter(mark(X1:S),mark(X2:S),mark(X3:S))) mark(nats(X:S)) -> active(nats(mark(X:S))) mark(s(X:S)) -> active(s(mark(X:S))) mark(sieve(X:S)) -> active(sieve(mark(X:S))) mark(0) -> active(0) mark(zprimes) -> active(zprimes) nats(active(X:S)) -> nats(X:S) nats(mark(X:S)) -> nats(X:S) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) sieve(active(X:S)) -> sieve(X:S) sieve(mark(X:S)) -> sieve(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(filter(cons(X:S,Y:S),s(N:S),M:S)) -> CONS(X:S,filter(Y:S,N:S,M:S)) ACTIVE(filter(cons(X:S,Y:S),s(N:S),M:S)) -> FILTER(Y:S,N:S,M:S) ACTIVE(filter(cons(X:S,Y:S),s(N:S),M:S)) -> MARK(cons(X:S,filter(Y:S,N:S,M:S))) ACTIVE(filter(cons(X:S,Y:S),0,M:S)) -> CONS(0,filter(Y:S,M:S,M:S)) ACTIVE(filter(cons(X:S,Y:S),0,M:S)) -> FILTER(Y:S,M:S,M:S) ACTIVE(filter(cons(X:S,Y:S),0,M:S)) -> MARK(cons(0,filter(Y:S,M:S,M:S))) ACTIVE(nats(N:S)) -> CONS(N:S,nats(s(N:S))) ACTIVE(nats(N:S)) -> MARK(cons(N:S,nats(s(N:S)))) ACTIVE(nats(N:S)) -> NATS(s(N:S)) ACTIVE(nats(N:S)) -> S(N:S) ACTIVE(sieve(cons(s(N:S),Y:S))) -> CONS(s(N:S),sieve(filter(Y:S,N:S,N:S))) ACTIVE(sieve(cons(s(N:S),Y:S))) -> FILTER(Y:S,N:S,N:S) ACTIVE(sieve(cons(s(N:S),Y:S))) -> MARK(cons(s(N:S),sieve(filter(Y:S,N:S,N:S)))) ACTIVE(sieve(cons(s(N:S),Y:S))) -> SIEVE(filter(Y:S,N:S,N:S)) ACTIVE(sieve(cons(0,Y:S))) -> CONS(0,sieve(Y:S)) ACTIVE(sieve(cons(0,Y:S))) -> MARK(cons(0,sieve(Y:S))) ACTIVE(sieve(cons(0,Y:S))) -> SIEVE(Y:S) ACTIVE(zprimes) -> MARK(sieve(nats(s(s(0))))) 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) FILTER(active(X1:S),X2:S,X3:S) -> FILTER(X1:S,X2:S,X3:S) FILTER(mark(X1:S),X2:S,X3:S) -> FILTER(X1:S,X2:S,X3:S) FILTER(X1:S,active(X2:S),X3:S) -> FILTER(X1:S,X2:S,X3:S) FILTER(X1:S,mark(X2:S),X3:S) -> FILTER(X1:S,X2:S,X3:S) FILTER(X1:S,X2:S,active(X3:S)) -> FILTER(X1:S,X2:S,X3:S) FILTER(X1:S,X2:S,mark(X3:S)) -> FILTER(X1:S,X2:S,X3: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) MARK(filter(X1:S,X2:S,X3:S)) -> ACTIVE(filter(mark(X1:S),mark(X2:S),mark(X3:S))) MARK(filter(X1:S,X2:S,X3:S)) -> FILTER(mark(X1:S),mark(X2:S),mark(X3:S)) MARK(filter(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(filter(X1:S,X2:S,X3:S)) -> MARK(X2:S) MARK(filter(X1:S,X2:S,X3:S)) -> MARK(X3:S) MARK(nats(X:S)) -> ACTIVE(nats(mark(X:S))) MARK(nats(X:S)) -> MARK(X:S) MARK(nats(X:S)) -> NATS(mark(X:S)) MARK(s(X:S)) -> ACTIVE(s(mark(X:S))) MARK(s(X:S)) -> MARK(X:S) MARK(s(X:S)) -> S(mark(X:S)) MARK(sieve(X:S)) -> ACTIVE(sieve(mark(X:S))) MARK(sieve(X:S)) -> MARK(X:S) MARK(sieve(X:S)) -> SIEVE(mark(X:S)) MARK(zprimes) -> ACTIVE(zprimes) NATS(active(X:S)) -> NATS(X:S) NATS(mark(X:S)) -> NATS(X:S) S(active(X:S)) -> S(X:S) S(mark(X:S)) -> S(X:S) SIEVE(active(X:S)) -> SIEVE(X:S) SIEVE(mark(X:S)) -> SIEVE(X:S) -> Rules: active(filter(cons(X:S,Y:S),s(N:S),M:S)) -> mark(cons(X:S,filter(Y:S,N:S,M:S))) active(filter(cons(X:S,Y:S),0,M:S)) -> mark(cons(0,filter(Y:S,M:S,M:S))) active(nats(N:S)) -> mark(cons(N:S,nats(s(N:S)))) active(sieve(cons(s(N:S),Y:S))) -> mark(cons(s(N:S),sieve(filter(Y:S,N:S,N:S)))) active(sieve(cons(0,Y:S))) -> mark(cons(0,sieve(Y:S))) popout

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

job log

popout

actions

all output return to TRS Innermost