/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(0) -> 0
g(0) -> 0
g(s(x)) -> f(g(x))
)

Problem 1: 

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

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 G(s(x)) -> F(g(x))
 G(s(x)) -> G(x)
-> Rules:
 f(0) -> 0
 g(0) -> 0
 g(s(x)) -> f(g(x))

Problem 1: 

SCC Processor:
-> Pairs:
 G(s(x)) -> F(g(x))
 G(s(x)) -> G(x)
-> Rules:
 f(0) -> 0
 g(0) -> 0
 g(s(x)) -> f(g(x))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 G(s(x)) -> G(x)
->->-> Rules:
 f(0) -> 0
 g(0) -> 0
 g(s(x)) -> f(g(x))

Problem 1: 

Subterm Processor:
-> Pairs:
 G(s(x)) -> G(x)
-> Rules:
 f(0) -> 0
 g(0) -> 0
 g(s(x)) -> f(g(x))
->Projection:
 pi(G) = 1

Problem 1: 

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

The problem is finite.