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


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


NO

Problem 1: 

(VAR x)
(RULES
f(x) -> g(f(x))
g(f(x)) -> x
g(x) -> a
)

Problem 1: 

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

Problem 1: 

Infinite Processor:
-> Pairs:
 F(x) -> F(x)
 F(x) -> G(f(x))
-> Rules:
 f(x) -> g(f(x))
 g(f(x)) -> x
 g(x) -> a
-> Pairs in cycle:
 F(x) -> F(x)

The problem is infinite.