details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.11456203461 seconds
cpu usage	0.997791624
max memory	6967296.0

stage attributes

key	value
output-size	44079
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 v_NonEmpty:S L:S X:S X1:S X2:S) (RULES a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S))) a__adx(nil) -> nil a__adx(X:S) -> adx(X:S) a__head(cons(X:S,L:S)) -> mark(X:S) a__head(X:S) -> head(X:S) a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S)) a__incr(nil) -> nil a__incr(X:S) -> incr(X:S) a__nats -> a__adx(a__zeros) a__nats -> nats a__tail(cons(X:S,L:S)) -> mark(L:S) a__tail(X:S) -> tail(X:S) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(adx(X:S)) -> a__adx(mark(X:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(head(X:S)) -> a__head(mark(X:S)) mark(incr(X:S)) -> a__incr(mark(X:S)) mark(nats) -> a__nats mark(nil) -> nil mark(s(X:S)) -> s(mark(X:S)) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(zeros) -> a__zeros ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__ADX(cons(X:S,L:S)) -> A__INCR(cons(mark(X:S),adx(L:S))) A__ADX(cons(X:S,L:S)) -> MARK(X:S) A__HEAD(cons(X:S,L:S)) -> MARK(X:S) A__INCR(cons(X:S,L:S)) -> MARK(X:S) A__NATS -> A__ADX(a__zeros) A__NATS -> A__ZEROS A__TAIL(cons(X:S,L:S)) -> MARK(L:S) MARK(adx(X:S)) -> A__ADX(mark(X:S)) MARK(adx(X:S)) -> MARK(X:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(head(X:S)) -> A__HEAD(mark(X:S)) MARK(head(X:S)) -> MARK(X:S) MARK(incr(X:S)) -> A__INCR(mark(X:S)) MARK(incr(X:S)) -> MARK(X:S) MARK(nats) -> A__NATS MARK(s(X:S)) -> MARK(X:S) MARK(tail(X:S)) -> A__TAIL(mark(X:S)) MARK(tail(X:S)) -> MARK(X:S) MARK(zeros) -> A__ZEROS -> Rules: a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S))) a__adx(nil) -> nil a__adx(X:S) -> adx(X:S) a__head(cons(X:S,L:S)) -> mark(X:S) a__head(X:S) -> head(X:S) a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S)) a__incr(nil) -> nil a__incr(X:S) -> incr(X:S) a__nats -> a__adx(a__zeros) a__nats -> nats a__tail(cons(X:S,L:S)) -> mark(L:S) a__tail(X:S) -> tail(X:S) a__zeros -> cons(0,zeros) a__zeros -> zeros mark(0) -> 0 mark(adx(X:S)) -> a__adx(mark(X:S)) mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(head(X:S)) -> a__head(mark(X:S)) mark(incr(X:S)) -> a__incr(mark(X:S)) mark(nats) -> a__nats mark(nil) -> nil mark(s(X:S)) -> s(mark(X:S)) mark(tail(X:S)) -> a__tail(mark(X:S)) mark(zeros) -> a__zeros Problem 1: SCC Processor: -> Pairs: A__ADX(cons(X:S,L:S)) -> A__INCR(cons(mark(X:S),adx(L:S))) A__ADX(cons(X:S,L:S)) -> MARK(X:S) A__HEAD(cons(X:S,L:S)) -> MARK(X:S) A__INCR(cons(X:S,L:S)) -> MARK(X:S) A__NATS -> A__ADX(a__zeros) A__NATS -> A__ZEROS A__TAIL(cons(X:S,L:S)) -> MARK(L:S) MARK(adx(X:S)) -> A__ADX(mark(X:S)) popout

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

job log

popout

actions

all output return to TRS Innermost