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


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


NO

Problem 1: 

(VAR v_NonEmpty:S X:S)
(RULES
activate(n__h(X:S)) -> h(X:S)
activate(X:S) -> X:S
f(X:S) -> g(n__h(f(X:S)))
h(X:S) -> n__h(X:S)
)

Problem 1: 

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

Problem 1: 

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

The problem is infinite.