details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.72844 seconds
cpu usage	1.6276
user time	1.27194
system time	0.355654
max virtual memory	707852.0
max residence set size	20448.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S M:S N:S V1:S V2:S X:S X1:S X2:S X3:S) (RULES U11(active(X1:S),X2:S) -> U11(X1:S,X2:S) U11(mark(X1:S),X2:S) -> U11(X1:S,X2:S) U11(X1:S,active(X2:S)) -> U11(X1:S,X2:S) U11(X1:S,mark(X2:S)) -> U11(X1:S,X2:S) U21(active(X1:S),X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) U21(mark(X1:S),X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) U21(X1:S,active(X2:S),X3:S) -> U21(X1:S,X2:S,X3:S) U21(X1:S,mark(X2:S),X3:S) -> U21(X1:S,X2:S,X3:S) U21(X1:S,X2:S,active(X3:S)) -> U21(X1:S,X2:S,X3:S) U21(X1:S,X2:S,mark(X3:S)) -> U21(X1:S,X2:S,X3:S) active(U11(tt,N:S)) -> mark(N:S) active(U21(tt,M:S,N:S)) -> mark(s(plus(N:S,M:S))) active(and(tt,X:S)) -> mark(X:S) active(isNat(plus(V1:S,V2:S))) -> mark(and(isNat(V1:S),isNat(V2:S))) active(isNat(s(V1:S))) -> mark(isNat(V1:S)) active(isNat(0)) -> mark(tt) active(plus(N:S,s(M:S))) -> mark(U21(and(isNat(M:S),isNat(N:S)),M:S,N:S)) active(plus(N:S,0)) -> mark(U11(isNat(N:S),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) isNat(active(X:S)) -> isNat(X:S) isNat(mark(X:S)) -> isNat(X:S) mark(U11(X1:S,X2:S)) -> active(U11(mark(X1:S),X2:S)) mark(U21(X1:S,X2:S,X3:S)) -> active(U21(mark(X1:S),X2:S,X3:S)) mark(and(X1:S,X2:S)) -> active(and(mark(X1:S),X2:S)) mark(isNat(X:S)) -> active(isNat(X: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: Dependency Pairs Processor: -> Pairs: U11#(active(X1:S),X2:S) -> U11#(X1:S,X2:S) U11#(mark(X1:S),X2:S) -> U11#(X1:S,X2:S) U11#(X1:S,active(X2:S)) -> U11#(X1:S,X2:S) U11#(X1:S,mark(X2:S)) -> U11#(X1:S,X2:S) U21#(active(X1:S),X2:S,X3:S) -> U21#(X1:S,X2:S,X3:S) U21#(mark(X1:S),X2:S,X3:S) -> U21#(X1:S,X2:S,X3:S) U21#(X1:S,active(X2:S),X3:S) -> U21#(X1:S,X2:S,X3:S) U21#(X1:S,mark(X2:S),X3:S) -> U21#(X1:S,X2:S,X3:S) U21#(X1:S,X2:S,active(X3:S)) -> U21#(X1:S,X2:S,X3:S) U21#(X1:S,X2:S,mark(X3:S)) -> U21#(X1:S,X2:S,X3:S) ACTIVE(U11(tt,N:S)) -> MARK(N:S) ACTIVE(U21(tt,M:S,N:S)) -> MARK(s(plus(N:S,M:S))) ACTIVE(U21(tt,M:S,N:S)) -> PLUS(N:S,M:S) ACTIVE(U21(tt,M:S,N:S)) -> S(plus(N:S,M:S)) ACTIVE(and(tt,X:S)) -> MARK(X:S) ACTIVE(isNat(plus(V1:S,V2:S))) -> AND(isNat(V1:S),isNat(V2:S)) ACTIVE(isNat(plus(V1:S,V2:S))) -> ISNAT(V1:S) ACTIVE(isNat(plus(V1:S,V2:S))) -> ISNAT(V2:S) ACTIVE(isNat(plus(V1:S,V2:S))) -> MARK(and(isNat(V1:S),isNat(V2:S))) ACTIVE(isNat(s(V1:S))) -> ISNAT(V1:S) ACTIVE(isNat(s(V1:S))) -> MARK(isNat(V1:S)) ACTIVE(isNat(0)) -> MARK(tt) ACTIVE(plus(N:S,s(M:S))) -> U21#(and(isNat(M:S),isNat(N:S)),M:S,N:S) ACTIVE(plus(N:S,s(M:S))) -> AND(isNat(M:S),isNat(N:S)) ACTIVE(plus(N:S,s(M:S))) -> ISNAT(M:S) ACTIVE(plus(N:S,s(M:S))) -> ISNAT(N:S) ACTIVE(plus(N:S,s(M:S))) -> MARK(U21(and(isNat(M:S),isNat(N:S)),M:S,N:S)) ACTIVE(plus(N:S,0)) -> U11#(isNat(N:S),N:S) ACTIVE(plus(N:S,0)) -> ISNAT(N:S) ACTIVE(plus(N:S,0)) -> MARK(U11(isNat(N:S),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) ISNAT(active(X:S)) -> ISNAT(X:S) ISNAT(mark(X:S)) -> ISNAT(X:S) MARK(U11(X1:S,X2:S)) -> U11#(mark(X1:S),X2:S) MARK(U11(X1:S,X2:S)) -> ACTIVE(U11(mark(X1:S),X2:S)) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> U21#(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> ACTIVE(U21(mark(X1:S),X2:S,X3:S)) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1: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(isNat(X:S)) -> ACTIVE(isNat(X: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)) popout

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

job log

popout

actions

all output return to TRS Standard