details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	4.53083 seconds
cpu usage	4.32839
user time	3.30543
system time	1.02296
max virtual memory	713712.0
max residence set size	13708.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S XS:S) (RULES active(head(cons(X:S,XS:S))) -> mark(X:S) active(incr(cons(X:S,XS:S))) -> mark(cons(s(X:S),incr(XS:S))) active(tail(cons(X:S,XS:S))) -> mark(XS:S) active(nats) -> mark(cons(0,incr(nats))) active(odds) -> mark(incr(pairs)) active(pairs) -> mark(cons(0,incr(odds))) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) head(active(X:S)) -> head(X:S) head(mark(X:S)) -> head(X:S) incr(active(X:S)) -> incr(X:S) incr(mark(X:S)) -> incr(X:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(head(X:S)) -> active(head(mark(X:S))) mark(incr(X:S)) -> active(incr(mark(X:S))) mark(s(X:S)) -> active(s(mark(X:S))) mark(tail(X:S)) -> active(tail(mark(X:S))) mark(0) -> active(0) mark(nats) -> active(nats) mark(odds) -> active(odds) mark(pairs) -> active(pairs) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) tail(active(X:S)) -> tail(X:S) tail(mark(X:S)) -> tail(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(head(cons(X:S,XS:S))) -> MARK(X:S) ACTIVE(incr(cons(X:S,XS:S))) -> CONS(s(X:S),incr(XS:S)) ACTIVE(incr(cons(X:S,XS:S))) -> INCR(XS:S) ACTIVE(incr(cons(X:S,XS:S))) -> MARK(cons(s(X:S),incr(XS:S))) ACTIVE(incr(cons(X:S,XS:S))) -> S(X:S) ACTIVE(tail(cons(X:S,XS:S))) -> MARK(XS:S) ACTIVE(nats) -> MARK(cons(0,incr(nats))) ACTIVE(odds) -> MARK(incr(pairs)) ACTIVE(pairs) -> MARK(cons(0,incr(odds))) CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) HEAD(active(X:S)) -> HEAD(X:S) HEAD(mark(X:S)) -> HEAD(X:S) INCR(active(X:S)) -> INCR(X:S) INCR(mark(X:S)) -> INCR(X:S) MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) MARK(cons(X1:S,X2:S)) -> CONS(mark(X1:S),X2:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(head(X:S)) -> ACTIVE(head(mark(X:S))) MARK(head(X:S)) -> HEAD(mark(X:S)) MARK(head(X:S)) -> MARK(X:S) MARK(incr(X:S)) -> ACTIVE(incr(mark(X:S))) MARK(incr(X:S)) -> INCR(mark(X:S)) MARK(incr(X:S)) -> MARK(X:S) MARK(s(X:S)) -> ACTIVE(s(mark(X:S))) MARK(s(X:S)) -> MARK(X:S) MARK(s(X:S)) -> S(mark(X:S)) MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) MARK(tail(X:S)) -> MARK(X:S) MARK(tail(X:S)) -> TAIL(mark(X:S)) MARK(nats) -> ACTIVE(nats) MARK(odds) -> ACTIVE(odds) MARK(pairs) -> ACTIVE(pairs) S(active(X:S)) -> S(X:S) S(mark(X:S)) -> S(X:S) TAIL(active(X:S)) -> TAIL(X:S) TAIL(mark(X:S)) -> TAIL(X:S) -> Rules: active(head(cons(X:S,XS:S))) -> mark(X:S) active(incr(cons(X:S,XS:S))) -> mark(cons(s(X:S),incr(XS:S))) active(tail(cons(X:S,XS:S))) -> mark(XS:S) active(nats) -> mark(cons(0,incr(nats))) active(odds) -> mark(incr(pairs)) active(pairs) -> mark(cons(0,incr(odds))) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) head(active(X:S)) -> head(X:S) head(mark(X:S)) -> head(X:S) incr(active(X:S)) -> incr(X:S) incr(mark(X:S)) -> incr(X:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(head(X:S)) -> active(head(mark(X:S))) mark(incr(X:S)) -> active(incr(mark(X:S))) mark(s(X:S)) -> active(s(mark(X:S))) mark(tail(X:S)) -> active(tail(mark(X:S))) mark(0) -> active(0) popout

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

job log

popout

actions

all output return to TRS Innermost