/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)
(STRATEGY CONTEXTSENSITIVE
(c)
(f 1)
(h 1)
(d)
(g)
)
(RULES
c(X) -> d(X)
f(f(X)) -> c(f(g(f(X))))
h(X) -> c(d(X))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(f(X)) -> C(f(g(f(X))))
 H(X) -> C(d(X))
-> Rules:
 c(X) -> d(X)
 f(f(X)) -> c(f(g(f(X))))
 h(X) -> c(d(X))
-> Unhiding Rules:
 Empty

Problem 1: 

SCC Processor:
-> Pairs:
 F(f(X)) -> C(f(g(f(X))))
 H(X) -> C(d(X))
-> Rules:
 c(X) -> d(X)
 f(f(X)) -> c(f(g(f(X))))
 h(X) -> c(d(X))
-> Unhiding rules:
 Empty
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.