details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0980771 seconds
cpu usage	0.10359
user time	0.061576
system time	0.042014
max virtual memory	113188.0
max residence set size	9348.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(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(and(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(and(X1:S,X2:S)) -> AND(active(X1:S),X2: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(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(plus(X1:S,X2:S)) -> PLUS(active(X1:S),X2:S) ACTIVE(plus(X1:S,X2:S)) -> PLUS(X1:S,active(X2:S)) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) AND(ok(X1:S),ok(X2:S)) -> AND(X1:S,X2:S) PLUS(mark(X1:S),X2:S) -> PLUS(X1:S,X2:S) PLUS(ok(X1:S),ok(X2:S)) -> PLUS(X1:S,X2:S) PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) PROPER(and(X1:S,X2:S)) -> AND(proper(X1:S),proper(X2:S)) PROPER(and(X1:S,X2:S)) -> PROPER(X1:S) PROPER(and(X1:S,X2:S)) -> PROPER(X2:S) PROPER(plus(X1:S,X2:S)) -> PLUS(proper(X1:S),proper(X2:S)) PROPER(plus(X1:S,X2:S)) -> PROPER(X1:S) PROPER(plus(X1:S,X2:S)) -> PROPER(X2:S) PROPER(s(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> S(proper(X:S)) S(mark(X:S)) -> S(X:S) S(ok(X:S)) -> S(X:S) TOP(mark(X:S)) -> PROPER(X:S) TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> ACTIVE(X:S) TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) Problem 1: SCC Processor: -> Pairs: ACTIVE(and(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(and(X1:S,X2:S)) -> AND(active(X1:S),X2: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(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(plus(X1:S,X2:S)) -> PLUS(active(X1:S),X2:S) ACTIVE(plus(X1:S,X2:S)) -> PLUS(X1:S,active(X2:S)) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) popout

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

job log

popout

actions

all output return to TRS Standard