details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0562931 seconds
cpu usage	0.04211
user time	0.014256
system time	0.027854
max virtual memory	113188.0
max residence set size	5436.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S M:S N:S X:S) (RULES U11(tt,M:S,N:S) -> U12(tt,activate(M:S),activate(N:S)) U12(tt,M:S,N:S) -> s(plus(activate(N:S),activate(M:S))) activate(X:S) -> X:S plus(N:S,0) -> N:S plus(N:S,s(M:S)) -> U11(tt,M:S,N:S) ) Problem 1: Innermost Equivalent Processor: -> Rules: U11(tt,M:S,N:S) -> U12(tt,activate(M:S),activate(N:S)) U12(tt,M:S,N:S) -> s(plus(activate(N:S),activate(M:S))) activate(X:S) -> X:S plus(N:S,0) -> N:S plus(N:S,s(M:S)) -> U11(tt,M:S,N:S) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,M:S,N:S) -> U12#(tt,activate(M:S),activate(N:S)) U11#(tt,M:S,N:S) -> ACTIVATE(M:S) U11#(tt,M:S,N:S) -> ACTIVATE(N:S) U12#(tt,M:S,N:S) -> ACTIVATE(M:S) U12#(tt,M:S,N:S) -> ACTIVATE(N:S) U12#(tt,M:S,N:S) -> PLUS(activate(N:S),activate(M:S)) PLUS(N:S,s(M:S)) -> U11#(tt,M:S,N:S) -> Rules: U11(tt,M:S,N:S) -> U12(tt,activate(M:S),activate(N:S)) U12(tt,M:S,N:S) -> s(plus(activate(N:S),activate(M:S))) activate(X:S) -> X:S plus(N:S,0) -> N:S plus(N:S,s(M:S)) -> U11(tt,M:S,N:S) Problem 1: SCC Processor: -> Pairs: U11#(tt,M:S,N:S) -> U12#(tt,activate(M:S),activate(N:S)) U11#(tt,M:S,N:S) -> ACTIVATE(M:S) U11#(tt,M:S,N:S) -> ACTIVATE(N:S) U12#(tt,M:S,N:S) -> ACTIVATE(M:S) U12#(tt,M:S,N:S) -> ACTIVATE(N:S) U12#(tt,M:S,N:S) -> PLUS(activate(N:S),activate(M:S)) PLUS(N:S,s(M:S)) -> U11#(tt,M:S,N:S) -> Rules: U11(tt,M:S,N:S) -> U12(tt,activate(M:S),activate(N:S)) U12(tt,M:S,N:S) -> s(plus(activate(N:S),activate(M:S))) activate(X:S) -> X:S plus(N:S,0) -> N:S plus(N:S,s(M:S)) -> U11(tt,M:S,N:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: U11#(tt,M:S,N:S) -> U12#(tt,activate(M:S),activate(N:S)) U12#(tt,M:S,N:S) -> PLUS(activate(N:S),activate(M:S)) PLUS(N:S,s(M:S)) -> U11#(tt,M:S,N:S) ->->-> Rules: U11(tt,M:S,N:S) -> U12(tt,activate(M:S),activate(N:S)) U12(tt,M:S,N:S) -> s(plus(activate(N:S),activate(M:S))) activate(X:S) -> X:S plus(N:S,0) -> N:S plus(N:S,s(M:S)) -> U11(tt,M:S,N:S) Problem 1: Reduction Pairs Processor: -> Pairs: U11#(tt,M:S,N:S) -> U12#(tt,activate(M:S),activate(N:S)) U12#(tt,M:S,N:S) -> PLUS(activate(N:S),activate(M:S)) PLUS(N:S,s(M:S)) -> U11#(tt,M:S,N:S) -> Rules: U11(tt,M:S,N:S) -> U12(tt,activate(M:S),activate(N:S)) U12(tt,M:S,N:S) -> s(plus(activate(N:S),activate(M:S))) activate(X:S) -> X:S plus(N:S,0) -> N:S plus(N:S,s(M:S)) -> U11(tt,M:S,N:S) -> Usable rules: activate(X:S) -> X:S ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2,X3) = 0 [U12](X1,X2,X3) = 0 popout

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

job log

popout

actions

all output return to TRS Standard