details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	1.58824 seconds
cpu usage	1.4995
user time	1.21312
system time	0.286377
max virtual memory	691844.0
max residence set size	8836.0

stage attributes

key	value
starexec-result	YES

output

1.36/1.58 YES 1.36/1.58 1.36/1.58 Problem 1: 1.36/1.58 1.36/1.58 (VAR M N V1 V2 X) 1.36/1.58 (STRATEGY CONTEXTSENSITIVE 1.36/1.58 (U11 1) 1.36/1.58 (U21 1) 1.36/1.58 (U31 1) 1.36/1.58 (U41 1) 1.36/1.58 (and 1) 1.36/1.58 (isNat) 1.36/1.58 (plus 1 2) 1.36/1.58 (x 1 2) 1.36/1.58 (0) 1.36/1.58 (s 1) 1.36/1.58 (tt) 1.36/1.58 ) 1.36/1.58 (RULES 1.36/1.58 U11(tt,N) -> N 1.36/1.58 U21(tt,M,N) -> s(plus(N,M)) 1.36/1.58 U31(tt) -> 0 1.36/1.58 U41(tt,M,N) -> plus(x(N,M),N) 1.36/1.58 and(tt,X) -> X 1.36/1.58 isNat(plus(V1,V2)) -> and(isNat(V1),isNat(V2)) 1.36/1.58 isNat(x(V1,V2)) -> and(isNat(V1),isNat(V2)) 1.36/1.58 isNat(0) -> tt 1.36/1.58 isNat(s(V1)) -> isNat(V1) 1.36/1.58 plus(N,0) -> U11(isNat(N),N) 1.36/1.58 plus(N,s(M)) -> U21(and(isNat(M),isNat(N)),M,N) 1.36/1.58 x(N,0) -> U31(isNat(N)) 1.36/1.58 x(N,s(M)) -> U41(and(isNat(M),isNat(N)),M,N) 1.36/1.58 ) 1.36/1.58 1.36/1.58 Problem 1: 1.36/1.58 1.36/1.58 Dependency Pairs Processor: 1.36/1.58 -> Pairs: 1.36/1.58 U11#(tt,N) -> N 1.36/1.58 U21#(tt,M,N) -> PLUS(N,M) 1.36/1.58 U21#(tt,M,N) -> M 1.36/1.58 U21#(tt,M,N) -> N 1.36/1.58 U41#(tt,M,N) -> PLUS(x(N,M),N) 1.36/1.58 U41#(tt,M,N) -> X(N,M) 1.36/1.58 U41#(tt,M,N) -> M 1.36/1.58 U41#(tt,M,N) -> N 1.36/1.58 AND(tt,X) -> X 1.36/1.58 ISNAT(plus(V1,V2)) -> AND(isNat(V1),isNat(V2)) 1.36/1.58 ISNAT(plus(V1,V2)) -> ISNAT(V1) 1.36/1.58 ISNAT(x(V1,V2)) -> AND(isNat(V1),isNat(V2)) 1.36/1.58 ISNAT(x(V1,V2)) -> ISNAT(V1) 1.36/1.58 ISNAT(s(V1)) -> ISNAT(V1) 1.36/1.58 PLUS(N,0) -> U11#(isNat(N),N) 1.36/1.58 PLUS(N,0) -> ISNAT(N) 1.36/1.58 PLUS(N,s(M)) -> U21#(and(isNat(M),isNat(N)),M,N) 1.36/1.58 PLUS(N,s(M)) -> AND(isNat(M),isNat(N)) 1.36/1.58 PLUS(N,s(M)) -> ISNAT(M) 1.36/1.58 X(N,0) -> U31#(isNat(N)) 1.36/1.58 X(N,0) -> ISNAT(N) 1.36/1.58 X(N,s(M)) -> U41#(and(isNat(M),isNat(N)),M,N) 1.36/1.58 X(N,s(M)) -> AND(isNat(M),isNat(N)) 1.36/1.58 X(N,s(M)) -> ISNAT(M) 1.36/1.58 -> Rules: 1.36/1.58 U11(tt,N) -> N 1.36/1.58 U21(tt,M,N) -> s(plus(N,M)) 1.36/1.58 U31(tt) -> 0 1.36/1.58 U41(tt,M,N) -> plus(x(N,M),N) 1.36/1.58 and(tt,X) -> X 1.36/1.58 isNat(plus(V1,V2)) -> and(isNat(V1),isNat(V2)) 1.36/1.58 isNat(x(V1,V2)) -> and(isNat(V1),isNat(V2)) 1.36/1.58 isNat(0) -> tt 1.36/1.58 isNat(s(V1)) -> isNat(V1) 1.36/1.58 plus(N,0) -> U11(isNat(N),N) 1.36/1.58 plus(N,s(M)) -> U21(and(isNat(M),isNat(N)),M,N) 1.36/1.58 x(N,0) -> U31(isNat(N)) 1.36/1.58 x(N,s(M)) -> U41(and(isNat(M),isNat(N)),M,N) 1.36/1.58 -> Unhiding Rules: 1.36/1.58 isNat(N) -> ISNAT(N) 1.36/1.58 isNat(V2) -> ISNAT(V2) 1.36/1.58 1.36/1.58 Problem 1: 1.36/1.58 1.36/1.58 SCC Processor: 1.36/1.58 -> Pairs: 1.36/1.58 U11#(tt,N) -> N 1.36/1.58 U21#(tt,M,N) -> PLUS(N,M) 1.36/1.58 U21#(tt,M,N) -> M 1.36/1.58 U21#(tt,M,N) -> N 1.36/1.58 U41#(tt,M,N) -> PLUS(x(N,M),N) 1.36/1.58 U41#(tt,M,N) -> X(N,M) 1.36/1.58 U41#(tt,M,N) -> M 1.36/1.58 U41#(tt,M,N) -> N 1.36/1.58 AND(tt,X) -> X 1.36/1.58 ISNAT(plus(V1,V2)) -> AND(isNat(V1),isNat(V2)) 1.36/1.58 ISNAT(plus(V1,V2)) -> ISNAT(V1) 1.36/1.58 ISNAT(x(V1,V2)) -> AND(isNat(V1),isNat(V2)) 1.36/1.58 ISNAT(x(V1,V2)) -> ISNAT(V1) 1.36/1.58 ISNAT(s(V1)) -> ISNAT(V1) 1.36/1.58 PLUS(N,0) -> U11#(isNat(N),N) 1.36/1.58 PLUS(N,0) -> ISNAT(N) popout

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

job log

popout

actions

all output return to TRS_Contextsensitive 2019-03-21 05.07