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


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


YES

Problem 1: 

(VAR X Y)
(RULES
f(0,1,X) -> f(X,X,X)
g(X,Y) -> X
g(X,Y) -> Y
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(0,1,X) -> F(X,X,X)
-> Rules:
 f(0,1,X) -> f(X,X,X)
 g(X,Y) -> X
 g(X,Y) -> Y

Problem 1: 

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

The problem is finite.