details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.84681892395 seconds
cpu usage	0.57615947
max memory	9007104.0

stage attributes

key	value
output-size	4940
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 x y) (RULES f(0,1,x) -> f(h(x),h(x),x) h(0) -> 0 h(g(x,y)) -> y ) Problem 1: Innermost Equivalent Processor: -> Rules: f(0,1,x) -> f(h(x),h(x),x) h(0) -> 0 h(g(x,y)) -> y -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(0,1,x) -> F(h(x),h(x),x) F(0,1,x) -> H(x) -> Rules: f(0,1,x) -> f(h(x),h(x),x) h(0) -> 0 h(g(x,y)) -> y Problem 1: SCC Processor: -> Pairs: F(0,1,x) -> F(h(x),h(x),x) F(0,1,x) -> H(x) -> Rules: f(0,1,x) -> f(h(x),h(x),x) h(0) -> 0 h(g(x,y)) -> y ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(0,1,x) -> F(h(x),h(x),x) ->->-> Rules: f(0,1,x) -> f(h(x),h(x),x) h(0) -> 0 h(g(x,y)) -> y Problem 1: Narrowing Processor: -> Pairs: F(0,1,x) -> F(h(x),h(x),x) -> Rules: f(0,1,x) -> f(h(x),h(x),x) h(0) -> 0 h(g(x,y)) -> y ->Narrowed Pairs: ->->Original Pair: F(0,1,x) -> F(h(x),h(x),x) ->-> Narrowed pairs: F(0,1,0) -> F(h(0),0,0) F(0,1,0) -> F(0,h(0),0) F(0,1,g(x,y)) -> F(h(g(x,y)),y,g(x,y)) F(0,1,g(x,y)) -> F(y,h(g(x,y)),g(x,y)) Problem 1: SCC Processor: -> Pairs: F(0,1,0) -> F(h(0),0,0) F(0,1,0) -> F(0,h(0),0) F(0,1,g(x,y)) -> F(h(g(x,y)),y,g(x,y)) F(0,1,g(x,y)) -> F(y,h(g(x,y)),g(x,y)) -> Rules: f(0,1,x) -> f(h(x),h(x),x) h(0) -> 0 h(g(x,y)) -> y ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(0,1,g(x,y)) -> F(h(g(x,y)),y,g(x,y)) F(0,1,g(x,y)) -> F(y,h(g(x,y)),g(x,y)) ->->-> Rules: f(0,1,x) -> f(h(x),h(x),x) h(0) -> 0 h(g(x,y)) -> y ->->Cycle: ->->-> Pairs: F(0,1,0) -> F(0,h(0),0) ->->-> Rules: popout

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

job log

popout

actions

all output return to TRS Stand 20472