details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.493937015533 seconds
cpu usage	0.439863564
max memory	6356992.0

stage attributes

key	value
output-size	41273
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR v_NonEmpty:S M:S N:S V1:S V2:S X:S X1:S X2:S) (RULES 0 -> n__0 U11(tt,N:S) -> activate(N:S) U21(tt,M:S,N:S) -> s(plus(activate(N:S),activate(M:S))) activate(n__0) -> 0 activate(n__isNat(X:S)) -> isNat(X:S) activate(n__plus(X1:S,X2:S)) -> plus(X1:S,X2:S) activate(n__s(X:S)) -> s(X:S) activate(X:S) -> X:S and(tt,X:S) -> activate(X:S) isNat(n__0) -> tt isNat(n__plus(V1:S,V2:S)) -> and(isNat(activate(V1:S)),n__isNat(activate(V2:S))) isNat(n__s(V1:S)) -> isNat(activate(V1:S)) isNat(X:S) -> n__isNat(X:S) plus(N:S,0) -> U11(isNat(N:S),N:S) plus(N:S,s(M:S)) -> U21(and(isNat(M:S),n__isNat(N:S)),M:S,N:S) plus(X1:S,X2:S) -> n__plus(X1:S,X2:S) s(X:S) -> n__s(X:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,N:S) -> ACTIVATE(N:S) U21#(tt,M:S,N:S) -> ACTIVATE(M:S) U21#(tt,M:S,N:S) -> ACTIVATE(N:S) U21#(tt,M:S,N:S) -> PLUS(activate(N:S),activate(M:S)) U21#(tt,M:S,N:S) -> S(plus(activate(N:S),activate(M:S))) ACTIVATE(n__0) -> 0# ACTIVATE(n__isNat(X:S)) -> ISNAT(X:S) ACTIVATE(n__plus(X1:S,X2:S)) -> PLUS(X1:S,X2:S) ACTIVATE(n__s(X:S)) -> S(X:S) AND(tt,X:S) -> ACTIVATE(X:S) ISNAT(n__plus(V1:S,V2:S)) -> ACTIVATE(V1:S) ISNAT(n__plus(V1:S,V2:S)) -> ACTIVATE(V2:S) ISNAT(n__plus(V1:S,V2:S)) -> AND(isNat(activate(V1:S)),n__isNat(activate(V2:S))) ISNAT(n__plus(V1:S,V2:S)) -> ISNAT(activate(V1:S)) ISNAT(n__s(V1:S)) -> ACTIVATE(V1:S) ISNAT(n__s(V1:S)) -> ISNAT(activate(V1:S)) PLUS(N:S,0) -> U11#(isNat(N:S),N:S) PLUS(N:S,0) -> ISNAT(N:S) PLUS(N:S,s(M:S)) -> U21#(and(isNat(M:S),n__isNat(N:S)),M:S,N:S) PLUS(N:S,s(M:S)) -> AND(isNat(M:S),n__isNat(N:S)) PLUS(N:S,s(M:S)) -> ISNAT(M:S) -> Rules: 0 -> n__0 U11(tt,N:S) -> activate(N:S) U21(tt,M:S,N:S) -> s(plus(activate(N:S),activate(M:S))) activate(n__0) -> 0 activate(n__isNat(X:S)) -> isNat(X:S) activate(n__plus(X1:S,X2:S)) -> plus(X1:S,X2:S) activate(n__s(X:S)) -> s(X:S) activate(X:S) -> X:S and(tt,X:S) -> activate(X:S) isNat(n__0) -> tt isNat(n__plus(V1:S,V2:S)) -> and(isNat(activate(V1:S)),n__isNat(activate(V2:S))) isNat(n__s(V1:S)) -> isNat(activate(V1:S)) isNat(X:S) -> n__isNat(X:S) plus(N:S,0) -> U11(isNat(N:S),N:S) plus(N:S,s(M:S)) -> U21(and(isNat(M:S),n__isNat(N:S)),M:S,N:S) plus(X1:S,X2:S) -> n__plus(X1:S,X2:S) s(X:S) -> n__s(X:S) Problem 1: SCC Processor: -> Pairs: U11#(tt,N:S) -> ACTIVATE(N:S) U21#(tt,M:S,N:S) -> ACTIVATE(M:S) U21#(tt,M:S,N:S) -> ACTIVATE(N:S) U21#(tt,M:S,N:S) -> PLUS(activate(N:S),activate(M:S)) U21#(tt,M:S,N:S) -> S(plus(activate(N:S),activate(M:S))) ACTIVATE(n__0) -> 0# ACTIVATE(n__isNat(X:S)) -> ISNAT(X:S) ACTIVATE(n__plus(X1:S,X2:S)) -> PLUS(X1:S,X2:S) ACTIVATE(n__s(X:S)) -> S(X:S) AND(tt,X:S) -> ACTIVATE(X:S) ISNAT(n__plus(V1:S,V2:S)) -> ACTIVATE(V1:S) ISNAT(n__plus(V1:S,V2:S)) -> ACTIVATE(V2:S) ISNAT(n__plus(V1:S,V2:S)) -> AND(isNat(activate(V1:S)),n__isNat(activate(V2:S))) ISNAT(n__plus(V1:S,V2:S)) -> ISNAT(activate(V1:S)) ISNAT(n__s(V1:S)) -> ACTIVATE(V1:S) ISNAT(n__s(V1:S)) -> ISNAT(activate(V1:S)) PLUS(N:S,0) -> U11#(isNat(N:S),N:S) PLUS(N:S,0) -> ISNAT(N:S) PLUS(N:S,s(M:S)) -> U21#(and(isNat(M:S),n__isNat(N:S)),M:S,N:S) PLUS(N:S,s(M:S)) -> AND(isNat(M:S),n__isNat(N:S)) PLUS(N:S,s(M:S)) -> ISNAT(M:S) popout

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

job log

popout

actions

all output return to TRS Standard