/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)
(RULES
f(X,g(X)) -> f(1,g(X))
g(1) -> g(0)
) 
(STRATEGY INNERMOST)

Problem 1: 

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

Problem 1: 

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

The problem is finite.