/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 y z)
(RULES
f(x,y,z) -> g(x,y,z)
g(0,1,x) -> f(x,x,x)
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(x,y,z) -> g(x,y,z)
 g(0,1,x) -> f(x,x,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(x,y,z) -> G(x,y,z)
 G(0,1,x) -> F(x,x,x)
-> Rules:
 f(x,y,z) -> g(x,y,z)
 g(0,1,x) -> f(x,x,x)

Problem 1: 

SCC Processor:
-> Pairs:
 F(x,y,z) -> G(x,y,z)
 G(0,1,x) -> F(x,x,x)
-> Rules:
 f(x,y,z) -> g(x,y,z)
 g(0,1,x) -> f(x,x,x)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(x,y,z) -> G(x,y,z)
 G(0,1,x) -> F(x,x,x)
->->-> Rules:
 f(x,y,z) -> g(x,y,z)
 g(0,1,x) -> f(x,x,x)

Problem 1: 

Instantiation Processor:
-> Pairs:
 F(x,y,z) -> G(x,y,z)
 G(0,1,x) -> F(x,x,x)
-> Rules:
 f(x,y,z) -> g(x,y,z)
 g(0,1,x) -> f(x,x,x)
->Instantiated Pairs:
->->Original Pair:
 F(x,y,z) -> G(x,y,z)
->-> Instantiated pairs:
 F(z,z,z) -> G(z,z,z)

Problem 1: 

SCC Processor:
-> Pairs:
 F(z,z,z) -> G(z,z,z)
 G(0,1,x) -> F(x,x,x)
-> Rules:
 f(x,y,z) -> g(x,y,z)
 g(0,1,x) -> f(x,x,x)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.