/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 xs)
(STRATEGY CONTEXTSENSITIVE
(cons_1)
(from_1)
(from_2)
(from_3)
(cons_0 1 2)
(overflow_0)
(s_0 1)
)
(RULES
cons_1(s_0(x),xs) -> overflow_0
from_1(x) -> cons_0(x,from_3(s_0(x)))
from_2(x) -> cons_0(x,from_3(s_0(x)))
from_3(x) -> cons_1(x,from_3(s_0(x)))
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 cons_1(s_0(x),xs) -> overflow_0
 from_1(x) -> cons_0(x,from_3(s_0(x)))
 from_2(x) -> cons_0(x,from_3(s_0(x)))
 from_3(x) -> cons_1(x,from_3(s_0(x)))
-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 FROM_1(x) -> FROM_3(s_0(x))
 FROM_1(x) -> x
 FROM_2(x) -> FROM_3(s_0(x))
 FROM_2(x) -> x
 FROM_3(x) -> CONS_1(x,from_3(s_0(x)))
-> Rules:
 cons_1(s_0(x),xs) -> overflow_0
 from_1(x) -> cons_0(x,from_3(s_0(x)))
 from_2(x) -> cons_0(x,from_3(s_0(x)))
 from_3(x) -> cons_1(x,from_3(s_0(x)))
-> Unhiding Rules:
 from_3(s_0(x)) -> FROM_3(s_0(x))

Problem 1: 

SCC Processor:
-> Pairs:
 FROM_1(x) -> FROM_3(s_0(x))
 FROM_1(x) -> x
 FROM_2(x) -> FROM_3(s_0(x))
 FROM_2(x) -> x
 FROM_3(x) -> CONS_1(x,from_3(s_0(x)))
-> Rules:
 cons_1(s_0(x),xs) -> overflow_0
 from_1(x) -> cons_0(x,from_3(s_0(x)))
 from_2(x) -> cons_0(x,from_3(s_0(x)))
 from_3(x) -> cons_1(x,from_3(s_0(x)))
-> Unhiding rules:
 from_3(s_0(x)) -> FROM_3(s_0(x))
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.