/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)
(STRATEGY CONTEXTSENSITIVE
(2nd 1)
(from 1)
(cons 1)
(s 1)
)
(RULES
2nd(cons(X,cons(Y,Z))) -> Y
from(X) -> cons(X,from(s(X)))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 2nd(cons(X,cons(Y,Z))) -> Y
 from(X) -> cons(X,from(s(X)))
-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 2ND(cons(X,cons(Y,Z))) -> Y
-> Rules:
 2nd(cons(X,cons(Y,Z))) -> Y
 from(X) -> cons(X,from(s(X)))
-> Unhiding Rules:
 from(s(X)) -> FROM(s(X))

Problem 1: 

SCC Processor:
-> Pairs:
 2ND(cons(X,cons(Y,Z))) -> Y
-> Rules:
 2nd(cons(X,cons(Y,Z))) -> Y
 from(X) -> cons(X,from(s(X)))
-> Unhiding rules:
 from(s(X)) -> FROM(s(X))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.