/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 Y Z)
(RULES
activate(n__from(X)) -> from(X)
activate(X) -> X
from(X) -> cons(X,n__from(s(X)))
from(X) -> n__from(X)
sel(0,cons(X,Y)) -> X
sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 ACTIVATE(n__from(X)) -> FROM(X)
 SEL(s(X),cons(Y,Z)) -> ACTIVATE(Z)
 SEL(s(X),cons(Y,Z)) -> SEL(X,activate(Z))
-> Rules:
 activate(n__from(X)) -> from(X)
 activate(X) -> X
 from(X) -> cons(X,n__from(s(X)))
 from(X) -> n__from(X)
 sel(0,cons(X,Y)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))

Problem 1: 

SCC Processor:
-> Pairs:
 ACTIVATE(n__from(X)) -> FROM(X)
 SEL(s(X),cons(Y,Z)) -> ACTIVATE(Z)
 SEL(s(X),cons(Y,Z)) -> SEL(X,activate(Z))
-> Rules:
 activate(n__from(X)) -> from(X)
 activate(X) -> X
 from(X) -> cons(X,n__from(s(X)))
 from(X) -> n__from(X)
 sel(0,cons(X,Y)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 SEL(s(X),cons(Y,Z)) -> SEL(X,activate(Z))
->->-> Rules:
 activate(n__from(X)) -> from(X)
 activate(X) -> X
 from(X) -> cons(X,n__from(s(X)))
 from(X) -> n__from(X)
 sel(0,cons(X,Y)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))

Problem 1: 

Subterm Processor:
-> Pairs:
 SEL(s(X),cons(Y,Z)) -> SEL(X,activate(Z))
-> Rules:
 activate(n__from(X)) -> from(X)
 activate(X) -> X
 from(X) -> cons(X,n__from(s(X)))
 from(X) -> n__from(X)
 sel(0,cons(X,Y)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
->Projection:
 pi(SEL) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 activate(n__from(X)) -> from(X)
 activate(X) -> X
 from(X) -> cons(X,n__from(s(X)))
 from(X) -> n__from(X)
 sel(0,cons(X,Y)) -> X
 sel(s(X),cons(Y,Z)) -> sel(X,activate(Z))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.