/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)
(RULES
f(s(X),X) -> f(X,a(X))
f(X,c(X)) -> f(s(X),X)
f(X,X) -> c(X)
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(s(X),X) -> f(X,a(X))
 f(X,c(X)) -> f(s(X),X)
 f(X,X) -> c(X)
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(s(X),X) -> F(X,a(X))
 F(X,c(X)) -> F(s(X),X)
-> Rules:
 f(s(X),X) -> f(X,a(X))
 f(X,c(X)) -> f(s(X),X)
 f(X,X) -> c(X)

Problem 1: 

SCC Processor:
-> Pairs:
 F(s(X),X) -> F(X,a(X))
 F(X,c(X)) -> F(s(X),X)
-> Rules:
 f(s(X),X) -> f(X,a(X))
 f(X,c(X)) -> f(s(X),X)
 f(X,X) -> c(X)
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.