/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 Y)
(RULES
f(g(X),Y) -> f(X,f(g(X),Y))
)

Problem 1: 

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

Problem 1: 

Infinite Processor:
-> Pairs:
 F(g(X),Y) -> F(g(X),Y)
 F(g(X),Y) -> F(X,f(g(X),Y))
-> Rules:
 f(g(X),Y) -> f(X,f(g(X),Y))
-> Pairs in cycle:
 F(g(X),Y) -> F(g(X),Y)

The problem is infinite.