/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem 1: 

(VAR v_NonEmpty:S y:S)
(RULES
f(a,y:S) -> f(y:S,g(y:S))
g(a) -> b
g(b) -> b
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(a,y:S) -> f(y:S,g(y:S))
 g(a) -> b
 g(b) -> b
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(a,y:S) -> F(y:S,g(y:S))
 F(a,y:S) -> G(y:S)
-> Rules:
 f(a,y:S) -> f(y:S,g(y:S))
 g(a) -> b
 g(b) -> b

Problem 1: 

SCC Processor:
-> Pairs:
 F(a,y:S) -> F(y:S,g(y:S))
 F(a,y:S) -> G(y:S)
-> Rules:
 f(a,y:S) -> f(y:S,g(y:S))
 g(a) -> b
 g(b) -> b
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(a,y:S) -> F(y:S,g(y:S))
->->-> Rules:
 f(a,y:S) -> f(y:S,g(y:S))
 g(a) -> b
 g(b) -> b

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 F(a,y:S) -> F(y:S,g(y:S))
-> Rules:
 f(a,y:S) -> f(y:S,g(y:S))
 g(a) -> b
 g(b) -> b
-> Usable rules:
 g(a) -> b
 g(b) -> b
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[f](X1,X2) = 0
[g](X) = 0
[a] = 1
[b] = 0
[fSNonEmpty] = 0
[F](X1,X2) = 2.X1 + 2.X2
[G](X) = 0

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f(a,y:S) -> f(y:S,g(y:S))
 g(a) -> b
 g(b) -> b
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.