/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: 

SCC Processor:
-> Pairs:
 H(d) -> G(c)
-> Rules:
 c -> d
 g(X) -> h(X)
 h(d) -> g(c)
-> Unhiding rules:
 Empty
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.