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


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


NO

Problem 1: 

(VAR x y)
(RULES
f(s(x),y) -> f(y,x)
f(x,y) -> f(x,x)
)

Problem 1: 

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

Problem 1: 

Infinite Processor:
-> Pairs:
 F(s(x),y) -> F(y,x)
 F(x,y) -> F(x,x)
-> Rules:
 f(s(x),y) -> f(y,x)
 f(x,y) -> f(x,x)
-> Pairs in cycle:
 F(x,y) -> F(x,x)

The problem is infinite.