details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0814688205719 seconds
cpu usage	0.031365918
max memory	2752512.0

stage attributes

key	value
output-size	1599
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) (STRATEGY CONTEXTSENSITIVE (c) (g) (h) (d) ) (RULES c -> d g(X) -> h(X) h(d) -> g(c) ) Problem 1: Innermost Equivalent Processor: -> Rules: c -> d g(X) -> h(X) h(d) -> g(c) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: G(X) -> H(X) H(d) -> G(c) -> Rules: c -> d g(X) -> h(X) h(d) -> g(c) -> Unhiding Rules: Empty Problem 1: SCC Processor: -> Pairs: G(X) -> H(X) H(d) -> G(c) -> Rules: c -> d g(X) -> h(X) h(d) -> g(c) -> Unhiding rules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(X) -> H(X) H(d) -> G(c) ->->-> Rules: c -> d g(X) -> h(X) h(d) -> g(c) ->->-> Unhiding rules: Empty Problem 1: Reduction Pairs Processor: -> Pairs: G(X) -> H(X) H(d) -> G(c) -> Rules: c -> d g(X) -> h(X) h(d) -> g(c) -> Unhiding rules: Empty -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [c] = 0 [d] = 2 [G](X) = 2.X + 2 [H](X) = 2.X + 1 Problem 1: popout

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

job log

popout

actions

all output return to TRS Context Sensitive