details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.171095 seconds
cpu usage	0.160882
user time	0.120184
system time	0.040698
max virtual memory	113188.0
max residence set size	9944.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S M:S N:S X:S X1:S X2:S) (RULES active(and(tt,X:S)) -> mark(X:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) and(active(X1:S),X2:S) -> and(X1:S,X2:S) and(mark(X1:S),X2:S) -> and(X1:S,X2:S) and(X1:S,active(X2:S)) -> and(X1:S,X2:S) and(X1:S,mark(X2:S)) -> and(X1:S,X2:S) mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S)) mark(plus(X1:S,X2:S)) -> active(plus(mark(X1:S),mark(X2:S))) mark(s(X:S)) -> active(s(mark(X:S))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1:S),X2:S) -> plus(X1:S,X2:S) plus(mark(X1:S),X2:S) -> plus(X1:S,X2:S) plus(X1:S,active(X2:S)) -> plus(X1:S,X2:S) plus(X1:S,mark(X2:S)) -> plus(X1:S,X2:S) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(and(tt,X:S)) -> MARK(X:S) ACTIVE(plus(N:S,s(M:S))) -> MARK(s(plus(N:S,M:S))) ACTIVE(plus(N:S,s(M:S))) -> PLUS(N:S,M:S) ACTIVE(plus(N:S,s(M:S))) -> S(plus(N:S,M:S)) ACTIVE(plus(N:S,0)) -> MARK(N:S) AND(active(X1:S),X2:S) -> AND(X1:S,X2:S) AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S) AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S) MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S)) MARK(and(X1:S,X2:S)) -> AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> ACTIVE(plus(mark(X1:S),mark(X2:S))) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(plus(X1:S,X2:S)) -> PLUS(mark(X1:S),mark(X2: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)) PLUS(active(X1:S),X2:S) -> PLUS(X1:S,X2:S) PLUS(mark(X1:S),X2:S) -> PLUS(X1:S,X2:S) PLUS(X1:S,active(X2:S)) -> PLUS(X1:S,X2:S) PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) S(active(X:S)) -> S(X:S) S(mark(X:S)) -> S(X:S) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) and(active(X1:S),X2:S) -> and(X1:S,X2:S) and(mark(X1:S),X2:S) -> and(X1:S,X2:S) and(X1:S,active(X2:S)) -> and(X1:S,X2:S) and(X1:S,mark(X2:S)) -> and(X1:S,X2:S) mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S)) mark(plus(X1:S,X2:S)) -> active(plus(mark(X1:S),mark(X2:S))) mark(s(X:S)) -> active(s(mark(X:S))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1:S),X2:S) -> plus(X1:S,X2:S) plus(mark(X1:S),X2:S) -> plus(X1:S,X2:S) plus(X1:S,active(X2:S)) -> plus(X1:S,X2:S) plus(X1:S,mark(X2:S)) -> plus(X1:S,X2:S) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) Problem 1: SCC Processor: -> Pairs: ACTIVE(and(tt,X:S)) -> MARK(X:S) ACTIVE(plus(N:S,s(M:S))) -> MARK(s(plus(N:S,M:S))) ACTIVE(plus(N:S,s(M:S))) -> PLUS(N:S,M:S) ACTIVE(plus(N:S,s(M:S))) -> S(plus(N:S,M:S)) ACTIVE(plus(N:S,0)) -> MARK(N:S) AND(active(X1:S),X2:S) -> AND(X1:S,X2:S) AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) AND(X1:S,active(X2:S)) -> AND(X1:S,X2:S) AND(X1:S,mark(X2:S)) -> AND(X1:S,X2:S) MARK(and(X1:S,X2:S)) -> ACTIVE(and(mark(X1:S),X2:S)) MARK(and(X1:S,X2:S)) -> AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> ACTIVE(plus(mark(X1:S),mark(X2:S))) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(plus(X1:S,X2:S)) -> PLUS(mark(X1:S),mark(X2: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)) PLUS(active(X1:S),X2:S) -> PLUS(X1:S,X2:S) popout

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

job log

popout

actions

all output return to TRS Innermost