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	n039.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	3.32782793045 seconds
cpu usage	3.139583473
max memory	9347072.0

stage attributes

key	value
output-size	88998
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR N X X1 X2 XS Y YS) (RULES a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__incr(X) -> incr(X) a__oddNs -> a__incr(a__pairNs) a__oddNs -> oddNs a__pairNs -> cons(0,incr(oddNs)) a__pairNs -> pairNs a__repItems(cons(X,XS)) -> cons(mark(X),cons(X,repItems(XS))) a__repItems(nil) -> nil a__repItems(X) -> repItems(X) a__tail(cons(X,XS)) -> mark(XS) a__tail(X) -> tail(X) a__take(0,XS) -> nil a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) a__take(X1,X2) -> take(X1,X2) a__zip(cons(X,XS),cons(Y,YS)) -> cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__zip(nil,XS) -> nil a__zip(X,nil) -> nil a__zip(X1,X2) -> zip(X1,X2) mark(0) -> 0 mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(incr(X)) -> a__incr(mark(X)) mark(nil) -> nil mark(oddNs) -> a__oddNs mark(pair(X1,X2)) -> pair(mark(X1),mark(X2)) mark(pairNs) -> a__pairNs mark(repItems(X)) -> a__repItems(mark(X)) mark(s(X)) -> s(mark(X)) mark(tail(X)) -> a__tail(mark(X)) mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) mark(zip(X1,X2)) -> a__zip(mark(X1),mark(X2)) ) Problem 1: Dependency Pairs Processor: -> Pairs: A__INCR(cons(X,XS)) -> MARK(X) A__ODDNS -> A__INCR(a__pairNs) A__ODDNS -> A__PAIRNS A__REPITEMS(cons(X,XS)) -> MARK(X) A__TAIL(cons(X,XS)) -> MARK(XS) A__TAKE(s(N),cons(X,XS)) -> MARK(X) A__ZIP(cons(X,XS),cons(Y,YS)) -> MARK(X) A__ZIP(cons(X,XS),cons(Y,YS)) -> MARK(Y) MARK(cons(X1,X2)) -> MARK(X1) MARK(incr(X)) -> A__INCR(mark(X)) MARK(incr(X)) -> MARK(X) MARK(oddNs) -> A__ODDNS MARK(pair(X1,X2)) -> MARK(X1) MARK(pair(X1,X2)) -> MARK(X2) MARK(pairNs) -> A__PAIRNS MARK(repItems(X)) -> A__REPITEMS(mark(X)) MARK(repItems(X)) -> MARK(X) MARK(s(X)) -> MARK(X) MARK(tail(X)) -> A__TAIL(mark(X)) MARK(tail(X)) -> MARK(X) MARK(take(X1,X2)) -> A__TAKE(mark(X1),mark(X2)) MARK(take(X1,X2)) -> MARK(X1) MARK(take(X1,X2)) -> MARK(X2) MARK(zip(X1,X2)) -> A__ZIP(mark(X1),mark(X2)) MARK(zip(X1,X2)) -> MARK(X1) MARK(zip(X1,X2)) -> MARK(X2) -> Rules: a__incr(cons(X,XS)) -> cons(s(mark(X)),incr(XS)) a__incr(X) -> incr(X) a__oddNs -> a__incr(a__pairNs) a__oddNs -> oddNs a__pairNs -> cons(0,incr(oddNs)) a__pairNs -> pairNs a__repItems(cons(X,XS)) -> cons(mark(X),cons(X,repItems(XS))) a__repItems(nil) -> nil a__repItems(X) -> repItems(X) a__tail(cons(X,XS)) -> mark(XS) a__tail(X) -> tail(X) a__take(0,XS) -> nil a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) a__take(X1,X2) -> take(X1,X2) a__zip(cons(X,XS),cons(Y,YS)) -> cons(pair(mark(X),mark(Y)),zip(XS,YS)) a__zip(nil,XS) -> nil a__zip(X,nil) -> nil a__zip(X1,X2) -> zip(X1,X2) mark(0) -> 0 mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(incr(X)) -> a__incr(mark(X)) mark(nil) -> nil mark(oddNs) -> a__oddNs mark(pair(X1,X2)) -> pair(mark(X1),mark(X2)) mark(pairNs) -> a__pairNs popout

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

job log

popout

actions

all output return to TRS Stand 20472