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


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


NO

Problem 1: 

(VAR v_NonEmpty:S x:S)
(RULES
f(f(x:S)) -> b
f(g(a)) -> a
g(x:S) -> f(g(x:S))
)

Problem 1: 

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

Problem 1: 

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

The problem is infinite.