/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x y) (RULES app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(id,x) -> x app(plus,0) -> id ) Problem 1: Innermost Equivalent Processor: -> Rules: app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(id,x) -> x app(plus,0) -> id -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: APP(app(plus,app(s,x)),y) -> APP(app(plus,x),y) APP(app(plus,app(s,x)),y) -> APP(plus,x) APP(app(plus,app(s,x)),y) -> APP(s,app(app(plus,x),y)) -> Rules: app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(id,x) -> x app(plus,0) -> id Problem 1: SCC Processor: -> Pairs: APP(app(plus,app(s,x)),y) -> APP(app(plus,x),y) APP(app(plus,app(s,x)),y) -> APP(plus,x) APP(app(plus,app(s,x)),y) -> APP(s,app(app(plus,x),y)) -> Rules: app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(id,x) -> x app(plus,0) -> id ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: APP(app(plus,app(s,x)),y) -> APP(app(plus,x),y) ->->-> Rules: app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(id,x) -> x app(plus,0) -> id Problem 1: Reduction Pairs Processor: -> Pairs: APP(app(plus,app(s,x)),y) -> APP(app(plus,x),y) -> Rules: app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(id,x) -> x app(plus,0) -> id -> Usable rules: app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(id,x) -> x app(plus,0) -> id ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [app](X1,X2) = 2.X1 + X2 [0] = 0 [id] = 0 [plus] = 0 [s] = 2 [APP](X1,X2) = X1 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: app(app(plus,app(s,x)),y) -> app(s,app(app(plus,x),y)) app(id,x) -> x app(plus,0) -> id ->Strongly Connected Components: There is no strongly connected component The problem is finite.