details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	3.96388 seconds
cpu usage	3.75284
user time	2.90076
system time	0.85208
max virtual memory	707920.0
max residence set size	12840.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S N:S X:S X1:S X2:S XS:S Y:S YS:S) (RULES a__incr(cons(X:S,XS:S)) -> cons(s(mark(X:S)),incr(XS:S)) a__incr(X:S) -> incr(X:S) a__oddNs -> a__incr(a__pairNs) a__oddNs -> oddNs a__pairNs -> cons(0,incr(oddNs)) a__pairNs -> pairNs a__repItems(cons(X:S,XS:S)) -> cons(mark(X:S),cons(X:S,repItems(XS:S))) a__repItems(nil) -> nil a__repItems(X:S) -> repItems(X:S) a__tail(cons(X:S,XS:S)) -> mark(XS:S) a__tail(X:S) -> tail(X:S) a__take(0,XS:S) -> nil a__take(s(N:S),cons(X:S,XS:S)) -> cons(mark(X:S),take(N:S,XS:S)) a__take(X1:S,X2:S) -> take(X1:S,X2:S) a__zip(cons(X:S,XS:S),cons(Y:S,YS:S)) -> cons(pair(mark(X:S),mark(Y:S)),zip(XS:S,YS:S)) a__zip(nil,XS:S) -> nil a__zip(X:S,nil) -> nil a__zip(X1:S,X2:S) -> zip(X1:S,X2:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(incr(X:S)) -> a__incr(mark(X:S)) mark(nil) -> nil mark(oddNs) -> a__oddNs mark(pair(X1:S,X2:S)) -> pair(mark(X1:S),mark(X2:S)) mark(pairNs) -> a__pairNs mark(repItems(X:S)) -> a__repItems(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(take(X1:S,X2:S)) -> a__take(mark(X1:S),mark(X2:S)) mark(zip(X1:S,X2:S)) -> a__zip(mark(X1:S),mark(X2:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__INCR(cons(X:S,XS:S)) -> MARK(X:S) A__ODDNS -> A__INCR(a__pairNs) A__ODDNS -> A__PAIRNS A__REPITEMS(cons(X:S,XS:S)) -> MARK(X:S) A__TAIL(cons(X:S,XS:S)) -> MARK(XS:S) A__TAKE(s(N:S),cons(X:S,XS:S)) -> MARK(X:S) A__ZIP(cons(X:S,XS:S),cons(Y:S,YS:S)) -> MARK(X:S) A__ZIP(cons(X:S,XS:S),cons(Y:S,YS:S)) -> MARK(Y:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(incr(X:S)) -> A__INCR(mark(X:S)) MARK(incr(X:S)) -> MARK(X:S) MARK(oddNs) -> A__ODDNS MARK(pair(X1:S,X2:S)) -> MARK(X1:S) MARK(pair(X1:S,X2:S)) -> MARK(X2:S) MARK(pairNs) -> A__PAIRNS MARK(repItems(X:S)) -> A__REPITEMS(mark(X:S)) MARK(repItems(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) MARK(tail(X:S)) -> A__TAIL(mark(X:S)) MARK(tail(X:S)) -> MARK(X:S) MARK(take(X1:S,X2:S)) -> A__TAKE(mark(X1:S),mark(X2:S)) MARK(take(X1:S,X2:S)) -> MARK(X1:S) MARK(take(X1:S,X2:S)) -> MARK(X2:S) MARK(zip(X1:S,X2:S)) -> A__ZIP(mark(X1:S),mark(X2:S)) MARK(zip(X1:S,X2:S)) -> MARK(X1:S) MARK(zip(X1:S,X2:S)) -> MARK(X2:S) -> Rules: a__incr(cons(X:S,XS:S)) -> cons(s(mark(X:S)),incr(XS:S)) a__incr(X:S) -> incr(X:S) a__oddNs -> a__incr(a__pairNs) a__oddNs -> oddNs a__pairNs -> cons(0,incr(oddNs)) a__pairNs -> pairNs a__repItems(cons(X:S,XS:S)) -> cons(mark(X:S),cons(X:S,repItems(XS:S))) a__repItems(nil) -> nil a__repItems(X:S) -> repItems(X:S) a__tail(cons(X:S,XS:S)) -> mark(XS:S) a__tail(X:S) -> tail(X:S) a__take(0,XS:S) -> nil a__take(s(N:S),cons(X:S,XS:S)) -> cons(mark(X:S),take(N:S,XS:S)) a__take(X1:S,X2:S) -> take(X1:S,X2:S) a__zip(cons(X:S,XS:S),cons(Y:S,YS:S)) -> cons(pair(mark(X:S),mark(Y:S)),zip(XS:S,YS:S)) a__zip(nil,XS:S) -> nil a__zip(X:S,nil) -> nil a__zip(X1:S,X2:S) -> zip(X1:S,X2:S) mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(incr(X:S)) -> a__incr(mark(X:S)) mark(nil) -> nil mark(oddNs) -> a__oddNs mark(pair(X1:S,X2:S)) -> pair(mark(X1:S),mark(X2:S)) mark(pairNs) -> a__pairNs mark(repItems(X:S)) -> a__repItems(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(take(X1:S,X2:S)) -> a__take(mark(X1:S),mark(X2:S)) mark(zip(X1:S,X2:S)) -> a__zip(mark(X1:S),mark(X2:S)) popout

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

job log

popout

actions

all output return to TRS Innermost