/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
activate(n__f(X)) -> f(X)
activate(X) -> X
f(f(a)) -> c(n__f(g(f(a))))
f(X) -> n__f(X)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__f(X)) -> F(X)
-> Rules:
 activate(n__f(X)) -> f(X)
 activate(X) -> X
 f(f(a)) -> c(n__f(g(f(a))))
 f(X) -> n__f(X)

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVATE(n__f(X)) -> F(X)
-> Rules:
 activate(n__f(X)) -> f(X)
 activate(X) -> X
 f(f(a)) -> c(n__f(g(f(a))))
 f(X) -> n__f(X)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.