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


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


YES

Problem 1: 

(VAR x)
(RULES
f(f(x)) -> f(c(f(x)))
f(f(x)) -> f(d(f(x)))
g(c(0)) -> g(d(1))
g(c(1)) -> g(d(0))
g(c(x)) -> x
g(d(x)) -> x
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(f(x)) -> F(c(f(x)))
 F(f(x)) -> F(d(f(x)))
 G(c(0)) -> G(d(1))
 G(c(1)) -> G(d(0))
-> Rules:
 f(f(x)) -> f(c(f(x)))
 f(f(x)) -> f(d(f(x)))
 g(c(0)) -> g(d(1))
 g(c(1)) -> g(d(0))
 g(c(x)) -> x
 g(d(x)) -> x

Problem 1: 

SCC Processor:
-> Pairs:
 F(f(x)) -> F(c(f(x)))
 F(f(x)) -> F(d(f(x)))
 G(c(0)) -> G(d(1))
 G(c(1)) -> G(d(0))
-> Rules:
 f(f(x)) -> f(c(f(x)))
 f(f(x)) -> f(d(f(x)))
 g(c(0)) -> g(d(1))
 g(c(1)) -> g(d(0))
 g(c(x)) -> x
 g(d(x)) -> x
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.