/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__d(X)) -> d(X)
activate(n__f(X)) -> f(X)
activate(X) -> X
c(X) -> d(activate(X))
d(X) -> n__d(X)
f(f(X)) -> c(n__f(g(n__f(X))))
f(X) -> n__f(X)
h(X) -> c(n__d(X))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__d(X)) -> D(X)
 ACTIVATE(n__f(X)) -> F(X)
 C(X) -> ACTIVATE(X)
 C(X) -> D(activate(X))
 F(f(X)) -> C(n__f(g(n__f(X))))
 H(X) -> C(n__d(X))
-> Rules:
 activate(n__d(X)) -> d(X)
 activate(n__f(X)) -> f(X)
 activate(X) -> X
 c(X) -> d(activate(X))
 d(X) -> n__d(X)
 f(f(X)) -> c(n__f(g(n__f(X))))
 f(X) -> n__f(X)
 h(X) -> c(n__d(X))

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVATE(n__d(X)) -> D(X)
 ACTIVATE(n__f(X)) -> F(X)
 C(X) -> ACTIVATE(X)
 C(X) -> D(activate(X))
 F(f(X)) -> C(n__f(g(n__f(X))))
 H(X) -> C(n__d(X))
-> Rules:
 activate(n__d(X)) -> d(X)
 activate(n__f(X)) -> f(X)
 activate(X) -> X
 c(X) -> d(activate(X))
 d(X) -> n__d(X)
 f(f(X)) -> c(n__f(g(n__f(X))))
 f(X) -> n__f(X)
 h(X) -> c(n__d(X))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ACTIVATE(n__f(X)) -> F(X)
 C(X) -> ACTIVATE(X)
 F(f(X)) -> C(n__f(g(n__f(X))))
->->-> Rules:
 activate(n__d(X)) -> d(X)
 activate(n__f(X)) -> f(X)
 activate(X) -> X
 c(X) -> d(activate(X))
 d(X) -> n__d(X)
 f(f(X)) -> c(n__f(g(n__f(X))))
 f(X) -> n__f(X)
 h(X) -> c(n__d(X))

Problem 1: 

Reduction Pair Processor:
-> Pairs:
 ACTIVATE(n__f(X)) -> F(X)
 C(X) -> ACTIVATE(X)
 F(f(X)) -> C(n__f(g(n__f(X))))
-> Rules:
 activate(n__d(X)) -> d(X)
 activate(n__f(X)) -> f(X)
 activate(X) -> X
 c(X) -> d(activate(X))
 d(X) -> n__d(X)
 f(f(X)) -> c(n__f(g(n__f(X))))
 f(X) -> n__f(X)
 h(X) -> c(n__d(X))
-> Usable rules:
 Empty
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[f](X) = 2.X + 2
[g](X) = 2.X + 1
[n__f](X) = X
[ACTIVATE](X) = 2.X + 1
[C](X) = 2.X + 2
[F](X) = 2.X

Problem 1: 

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

The problem is finite.