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	n095.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.107787847519 seconds
cpu usage	0.041255583
max memory	3624960.0

stage attributes

key	value
output-size	3607
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 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 popout

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

job log

popout

actions

all output return to TRS Standard