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


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


YES

Problem 1: 

(VAR X X1 X2 Y Z)
(RULES
2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
activate(n__from(X)) -> from(activate(X))
activate(n__s(X)) -> s(activate(X))
activate(X) -> X
cons(X1,X2) -> n__cons(X1,X2)
from(X) -> cons(X,n__from(n__s(X)))
from(X) -> n__from(X)
s(X) -> n__s(X)
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 2ND(cons(X,n__cons(Y,Z))) -> ACTIVATE(Y)
 ACTIVATE(n__cons(X1,X2)) -> ACTIVATE(X1)
 ACTIVATE(n__cons(X1,X2)) -> CONS(activate(X1),X2)
 ACTIVATE(n__from(X)) -> ACTIVATE(X)
 ACTIVATE(n__from(X)) -> FROM(activate(X))
 ACTIVATE(n__s(X)) -> ACTIVATE(X)
 ACTIVATE(n__s(X)) -> S(activate(X))
 FROM(X) -> CONS(X,n__from(n__s(X)))
-> Rules:
 2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
 activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
 activate(n__from(X)) -> from(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 cons(X1,X2) -> n__cons(X1,X2)
 from(X) -> cons(X,n__from(n__s(X)))
 from(X) -> n__from(X)
 s(X) -> n__s(X)

Problem 1: 

SCC Processor:
-> Pairs:
 2ND(cons(X,n__cons(Y,Z))) -> ACTIVATE(Y)
 ACTIVATE(n__cons(X1,X2)) -> ACTIVATE(X1)
 ACTIVATE(n__cons(X1,X2)) -> CONS(activate(X1),X2)
 ACTIVATE(n__from(X)) -> ACTIVATE(X)
 ACTIVATE(n__from(X)) -> FROM(activate(X))
 ACTIVATE(n__s(X)) -> ACTIVATE(X)
 ACTIVATE(n__s(X)) -> S(activate(X))
 FROM(X) -> CONS(X,n__from(n__s(X)))
-> Rules:
 2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
 activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
 activate(n__from(X)) -> from(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 cons(X1,X2) -> n__cons(X1,X2)
 from(X) -> cons(X,n__from(n__s(X)))
 from(X) -> n__from(X)
 s(X) -> n__s(X)
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 ACTIVATE(n__cons(X1,X2)) -> ACTIVATE(X1)
 ACTIVATE(n__from(X)) -> ACTIVATE(X)
 ACTIVATE(n__s(X)) -> ACTIVATE(X)
->->-> Rules:
 2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
 activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
 activate(n__from(X)) -> from(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 cons(X1,X2) -> n__cons(X1,X2)
 from(X) -> cons(X,n__from(n__s(X)))
 from(X) -> n__from(X)
 s(X) -> n__s(X)

Problem 1: 

Subterm Processor:
-> Pairs:
 ACTIVATE(n__cons(X1,X2)) -> ACTIVATE(X1)
 ACTIVATE(n__from(X)) -> ACTIVATE(X)
 ACTIVATE(n__s(X)) -> ACTIVATE(X)
-> Rules:
 2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
 activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
 activate(n__from(X)) -> from(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 cons(X1,X2) -> n__cons(X1,X2)
 from(X) -> cons(X,n__from(n__s(X)))
 from(X) -> n__from(X)
 s(X) -> n__s(X)
->Projection:
 pi(ACTIVATE) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 2nd(cons(X,n__cons(Y,Z))) -> activate(Y)
 activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
 activate(n__from(X)) -> from(activate(X))
 activate(n__s(X)) -> s(activate(X))
 activate(X) -> X
 cons(X1,X2) -> n__cons(X1,X2)
 from(X) -> cons(X,n__from(n__s(X)))
 from(X) -> n__from(X)
 s(X) -> n__s(X)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.