/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
0 -> n__0
activate(n__0) -> 0
activate(n__f(X)) -> f(activate(X))
activate(n__s(X)) -> s(activate(X))
activate(X) -> X
f(0) -> cons(0,n__f(n__s(n__0)))
f(s(0)) -> f(p(s(0)))
f(X) -> n__f(X)
p(s(0)) -> 0
s(X) -> n__s(X)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__0) -> 0#
 ACTIVATE(n__f(X)) -> ACTIVATE(X)
 ACTIVATE(n__f(X)) -> F(activate(X))
 ACTIVATE(n__s(X)) -> ACTIVATE(X)
 ACTIVATE(n__s(X)) -> S(activate(X))
 F(s(0)) -> F(p(s(0)))
 F(s(0)) -> P(s(0))
-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__f(X)) -> f(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 f(0) -> cons(0,n__f(n__s(n__0)))
 f(s(0)) -> f(p(s(0)))
 f(X) -> n__f(X)
 p(s(0)) -> 0
 s(X) -> n__s(X)

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVATE(n__0) -> 0#
 ACTIVATE(n__f(X)) -> ACTIVATE(X)
 ACTIVATE(n__f(X)) -> F(activate(X))
 ACTIVATE(n__s(X)) -> ACTIVATE(X)
 ACTIVATE(n__s(X)) -> S(activate(X))
 F(s(0)) -> F(p(s(0)))
 F(s(0)) -> P(s(0))
-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__f(X)) -> f(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 f(0) -> cons(0,n__f(n__s(n__0)))
 f(s(0)) -> f(p(s(0)))
 f(X) -> n__f(X)
 p(s(0)) -> 0
 s(X) -> n__s(X)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(s(0)) -> F(p(s(0)))
->->-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__f(X)) -> f(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 f(0) -> cons(0,n__f(n__s(n__0)))
 f(s(0)) -> f(p(s(0)))
 f(X) -> n__f(X)
 p(s(0)) -> 0
 s(X) -> n__s(X)
->->Cycle:
->->-> Pairs:
 ACTIVATE(n__f(X)) -> ACTIVATE(X)
 ACTIVATE(n__s(X)) -> ACTIVATE(X)
->->-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__f(X)) -> f(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 f(0) -> cons(0,n__f(n__s(n__0)))
 f(s(0)) -> f(p(s(0)))
 f(X) -> n__f(X)
 p(s(0)) -> 0
 s(X) -> n__s(X)


The problem is decomposed in 2 subproblems.

Problem 1.1: 

Reduction Pair Processor:
-> Pairs:
 F(s(0)) -> F(p(s(0)))
-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__f(X)) -> f(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 f(0) -> cons(0,n__f(n__s(n__0)))
 f(s(0)) -> f(p(s(0)))
 f(X) -> n__f(X)
 p(s(0)) -> 0
 s(X) -> n__s(X)
-> Usable rules:
 0 -> n__0
 p(s(0)) -> 0
 s(X) -> n__s(X)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[0] = 2
[p](X) = 2
[s](X) = 2.X + 2
[n__0] = 2
[n__s](X) = 2.X + 2
[F](X) = 2.X

Problem 1.1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__f(X)) -> f(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 f(0) -> cons(0,n__f(n__s(n__0)))
 f(s(0)) -> f(p(s(0)))
 f(X) -> n__f(X)
 p(s(0)) -> 0
 s(X) -> n__s(X)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.

Problem 1.2: 

Subterm Processor:
-> Pairs:
 ACTIVATE(n__f(X)) -> ACTIVATE(X)
 ACTIVATE(n__s(X)) -> ACTIVATE(X)
-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__f(X)) -> f(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 f(0) -> cons(0,n__f(n__s(n__0)))
 f(s(0)) -> f(p(s(0)))
 f(X) -> n__f(X)
 p(s(0)) -> 0
 s(X) -> n__s(X)
->Projection:
 pi(ACTIVATE) = 1

Problem 1.2: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 0 -> n__0
 activate(n__0) -> 0
 activate(n__f(X)) -> f(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 f(0) -> cons(0,n__f(n__s(n__0)))
 f(s(0)) -> f(p(s(0)))
 f(X) -> n__f(X)
 p(s(0)) -> 0
 s(X) -> n__s(X)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.