/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)
(RULES
activate(n__h(X)) -> h(X)
activate(X) -> X
f(X) -> g(n__h(f(X)))
h(X) -> n__h(X)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__h(X)) -> H(X)
 F(X) -> F(X)
-> Rules:
 activate(n__h(X)) -> h(X)
 activate(X) -> X
 f(X) -> g(n__h(f(X)))
 h(X) -> n__h(X)

Problem 1: 

Infinite Processor:
-> Pairs:
 ACTIVATE(n__h(X)) -> H(X)
 F(X) -> F(X)
-> Rules:
 activate(n__h(X)) -> h(X)
 activate(X) -> X
 f(X) -> g(n__h(f(X)))
 h(X) -> n__h(X)
-> Pairs in cycle:
 F(X) -> F(X)

The problem is infinite.