/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(g(X)) -> f(X)
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(g(X)) -> f(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(g(X)) -> F(X)
-> Rules:
 f(g(X)) -> f(X)

Problem 1: 

SCC Processor:
-> Pairs:
 F(g(X)) -> F(X)
-> Rules:
 f(g(X)) -> f(X)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(g(X)) -> F(X)
->->-> Rules:
 f(g(X)) -> f(X)

Problem 1: 

Subterm Processor:
-> Pairs:
 F(g(X)) -> F(X)
-> Rules:
 f(g(X)) -> f(X)
->Projection:
 pi(F) = 1

Problem 1: 

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

The problem is finite.