/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)
(RULES
f(g(x),x,y) -> f(y,y,g(y))
g(g(x)) -> g(x)
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(g(x),x,y) -> F(y,y,g(y))
 F(g(x),x,y) -> G(y)
-> Rules:
 f(g(x),x,y) -> f(y,y,g(y))
 g(g(x)) -> g(x)

Problem 1: 

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

The problem is finite.