/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(f(x)) -> b
f(g(a)) -> f(s(g(b)))
g(x) -> f(g(x))
)

Problem 1: 

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

Problem 1: 

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

The problem is infinite.