details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.125771045685 seconds
cpu usage	0.084295861
max memory	3530752.0

stage attributes

key	value
output-size	1339
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) (RULES f(x,x) -> f(g(x),x) g(x) -> s(x) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(x,x) -> f(g(x),x) g(x) -> s(x) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(x,x) -> F(g(x),x) F(x,x) -> G(x) -> Rules: f(x,x) -> f(g(x),x) g(x) -> s(x) Problem 1: SCC Processor: -> Pairs: F(x,x) -> F(g(x),x) F(x,x) -> G(x) -> Rules: f(x,x) -> f(g(x),x) g(x) -> s(x) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(x,x) -> F(g(x),x) ->->-> Rules: f(x,x) -> f(g(x),x) g(x) -> s(x) Problem 1: Narrowing Processor: -> Pairs: F(x,x) -> F(g(x),x) -> Rules: f(x,x) -> f(g(x),x) g(x) -> s(x) ->Narrowed Pairs: ->->Original Pair: F(x,x) -> F(g(x),x) ->-> Narrowed pairs: F(x,x) -> F(s(x),x) Problem 1: SCC Processor: -> Pairs: F(x,x) -> F(s(x),x) -> Rules: f(x,x) -> f(g(x),x) g(x) -> s(x) ->Strongly Connected Components: There is no strongly connected component The problem is finite. popout

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

job log

popout

actions

all output return to TRS Stand 20472