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


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


YES

Problem 1: 

(RULES
b -> f(a,a)
f(a,a) -> g(d)
g(a) -> g(b)
)

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

Problem 1: 

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

The problem is finite.