details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0184491 seconds
cpu usage	0.018941
user time	0.009227
system time	0.009714
max virtual memory	113188.0
max residence set size	6240.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR N X XS Y YS) (STRATEGY CONTEXTSENSITIVE (incr 1) (oddNs) (pairNs) (repItems 1) (tail 1) (take 1 2) (zip 1 2) (0) (cons 1) (nil) (pair 1 2) (s 1) ) (RULES incr(cons(X,XS)) -> cons(s(X),incr(XS)) oddNs -> incr(pairNs) pairNs -> cons(0,incr(oddNs)) repItems(cons(X,XS)) -> cons(X,cons(X,repItems(XS))) repItems(nil) -> nil tail(cons(X,XS)) -> XS take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),zip(XS,YS)) zip(nil,XS) -> nil zip(X,nil) -> nil ) Problem 1: Dependency Pairs Processor: -> Pairs: ODDNS -> INCR(pairNs) ODDNS -> PAIRNS TAIL(cons(X,XS)) -> XS -> Rules: incr(cons(X,XS)) -> cons(s(X),incr(XS)) oddNs -> incr(pairNs) pairNs -> cons(0,incr(oddNs)) repItems(cons(X,XS)) -> cons(X,cons(X,repItems(XS))) repItems(nil) -> nil tail(cons(X,XS)) -> XS take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),zip(XS,YS)) zip(nil,XS) -> nil zip(X,nil) -> nil -> Unhiding Rules: incr(oddNs) -> INCR(oddNs) incr(oddNs) -> ODDNS incr(XS) -> INCR(XS) incr(x5) -> x5 take(N,XS) -> TAKE(N,XS) take(N,x5) -> x5 zip(XS,YS) -> ZIP(XS,YS) zip(XS,x5) -> x5 zip(x5,YS) -> x5 Problem 1: SCC Processor: -> Pairs: ODDNS -> INCR(pairNs) ODDNS -> PAIRNS TAIL(cons(X,XS)) -> XS -> Rules: incr(cons(X,XS)) -> cons(s(X),incr(XS)) oddNs -> incr(pairNs) pairNs -> cons(0,incr(oddNs)) repItems(cons(X,XS)) -> cons(X,cons(X,repItems(XS))) repItems(nil) -> nil tail(cons(X,XS)) -> XS take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) zip(cons(X,XS),cons(Y,YS)) -> cons(pair(X,Y),zip(XS,YS)) zip(nil,XS) -> nil zip(X,nil) -> nil -> Unhiding rules: incr(oddNs) -> INCR(oddNs) incr(oddNs) -> ODDNS incr(XS) -> INCR(XS) incr(x5) -> x5 take(N,XS) -> TAKE(N,XS) take(N,x5) -> x5 zip(XS,YS) -> ZIP(XS,YS) zip(XS,x5) -> x5 zip(x5,YS) -> x5 ->Strongly Connected Components: There is no strongly connected component The problem is finite. popout

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

job log

popout

actions

all output return to TRS Contextsensitive