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

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 first(0,X) -> nil
 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
 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:
 Empty
-> Rules:
 first(0,X) -> nil
 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
 from(X) -> cons(X,from(s(X)))
-> Unhiding Rules:
 Empty

Problem 1: 

Basic Processor:
-> Pairs:
 Empty
-> Rules:
 first(0,X) -> nil
 first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z))
 from(X) -> cons(X,from(s(X)))
-> Unhiding rules:
 Empty
-> Result:
 Set P is empty

The problem is finite.