details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	3.41892910004 seconds
cpu usage	3.237476079
max memory	9256960.0

stage attributes

key	value
output-size	124334
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR L X X1 X2) (RULES active(adx(cons(X,L))) -> mark(incr(cons(X,adx(L)))) active(adx(nil)) -> mark(nil) active(head(cons(X,L))) -> mark(X) active(incr(cons(X,L))) -> mark(cons(s(X),incr(L))) active(incr(nil)) -> mark(nil) active(tail(cons(X,L))) -> mark(L) active(nats) -> mark(adx(zeros)) active(zeros) -> mark(cons(0,zeros)) adx(active(X)) -> adx(X) adx(mark(X)) -> adx(X) cons(active(X1),X2) -> cons(X1,X2) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) head(active(X)) -> head(X) head(mark(X)) -> head(X) incr(active(X)) -> incr(X) incr(mark(X)) -> incr(X) mark(adx(X)) -> active(adx(mark(X))) mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) mark(head(X)) -> active(head(mark(X))) mark(incr(X)) -> active(incr(mark(X))) mark(s(X)) -> active(s(mark(X))) mark(tail(X)) -> active(tail(mark(X))) mark(0) -> active(0) mark(nats) -> active(nats) mark(nil) -> active(nil) mark(zeros) -> active(zeros) s(active(X)) -> s(X) s(mark(X)) -> s(X) tail(active(X)) -> tail(X) tail(mark(X)) -> tail(X) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(adx(cons(X,L))) -> ADX(L) ACTIVE(adx(cons(X,L))) -> CONS(X,adx(L)) ACTIVE(adx(cons(X,L))) -> INCR(cons(X,adx(L))) ACTIVE(adx(cons(X,L))) -> MARK(incr(cons(X,adx(L)))) ACTIVE(adx(nil)) -> MARK(nil) ACTIVE(head(cons(X,L))) -> MARK(X) ACTIVE(incr(cons(X,L))) -> CONS(s(X),incr(L)) ACTIVE(incr(cons(X,L))) -> INCR(L) ACTIVE(incr(cons(X,L))) -> MARK(cons(s(X),incr(L))) ACTIVE(incr(cons(X,L))) -> S(X) ACTIVE(incr(nil)) -> MARK(nil) ACTIVE(tail(cons(X,L))) -> MARK(L) ACTIVE(nats) -> MARK(adx(zeros)) ACTIVE(zeros) -> MARK(cons(0,zeros)) ADX(active(X)) -> ADX(X) ADX(mark(X)) -> ADX(X) CONS(active(X1),X2) -> CONS(X1,X2) CONS(mark(X1),X2) -> CONS(X1,X2) CONS(X1,active(X2)) -> CONS(X1,X2) CONS(X1,mark(X2)) -> CONS(X1,X2) HEAD(active(X)) -> HEAD(X) HEAD(mark(X)) -> HEAD(X) INCR(active(X)) -> INCR(X) INCR(mark(X)) -> INCR(X) MARK(adx(X)) -> ACTIVE(adx(mark(X))) MARK(adx(X)) -> ADX(mark(X)) MARK(adx(X)) -> MARK(X) MARK(cons(X1,X2)) -> ACTIVE(cons(mark(X1),X2)) MARK(cons(X1,X2)) -> CONS(mark(X1),X2) MARK(cons(X1,X2)) -> MARK(X1) MARK(head(X)) -> ACTIVE(head(mark(X))) MARK(head(X)) -> HEAD(mark(X)) MARK(head(X)) -> MARK(X) MARK(incr(X)) -> ACTIVE(incr(mark(X))) MARK(incr(X)) -> INCR(mark(X)) MARK(incr(X)) -> MARK(X) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) MARK(s(X)) -> S(mark(X)) MARK(tail(X)) -> ACTIVE(tail(mark(X))) MARK(tail(X)) -> MARK(X) MARK(tail(X)) -> TAIL(mark(X)) MARK(nats) -> ACTIVE(nats) MARK(zeros) -> ACTIVE(zeros) S(active(X)) -> S(X) S(mark(X)) -> S(X) TAIL(active(X)) -> TAIL(X) TAIL(mark(X)) -> TAIL(X) -> Rules: popout

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

job log

popout

actions

all output return to TRS Inner 89993