details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0431249141693 seconds
cpu usage	0.032619926
max memory	3035136.0

stage attributes

key	value
output-size	2352
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR m n r) (RULES p(m,0,0) -> m p(m,s(n),0) -> p(0,n,m) p(m,n,s(r)) -> p(m,r,n) ) Problem 1: Innermost Equivalent Processor: -> Rules: p(m,0,0) -> m p(m,s(n),0) -> p(0,n,m) p(m,n,s(r)) -> p(m,r,n) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: P(m,s(n),0) -> P(0,n,m) P(m,n,s(r)) -> P(m,r,n) -> Rules: p(m,0,0) -> m p(m,s(n),0) -> p(0,n,m) p(m,n,s(r)) -> p(m,r,n) Problem 1: SCC Processor: -> Pairs: P(m,s(n),0) -> P(0,n,m) P(m,n,s(r)) -> P(m,r,n) -> Rules: p(m,0,0) -> m p(m,s(n),0) -> p(0,n,m) p(m,n,s(r)) -> p(m,r,n) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(m,s(n),0) -> P(0,n,m) P(m,n,s(r)) -> P(m,r,n) ->->-> Rules: p(m,0,0) -> m p(m,s(n),0) -> p(0,n,m) p(m,n,s(r)) -> p(m,r,n) Problem 1: Reduction Pairs Processor: -> Pairs: P(m,s(n),0) -> P(0,n,m) P(m,n,s(r)) -> P(m,r,n) -> Rules: p(m,0,0) -> m p(m,s(n),0) -> p(0,n,m) p(m,n,s(r)) -> p(m,r,n) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [0] = 1 [s](X) = X + 1 [P](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 Problem 1: SCC Processor: -> Pairs: P(m,n,s(r)) -> P(m,r,n) -> Rules: p(m,0,0) -> m p(m,s(n),0) -> p(0,n,m) p(m,n,s(r)) -> p(m,r,n) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(m,n,s(r)) -> P(m,r,n) ->->-> Rules: p(m,0,0) -> m p(m,s(n),0) -> p(0,n,m) popout

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

job log

popout

actions

all output return to TRS Stand 20472