/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)
(STRATEGY CONTEXTSENSITIVE
(f 1)
(p 1)
(0)
(cons 1)
(s 1)
)
(RULES
f(0) -> cons(0,f(s(0)))
f(s(0)) -> f(p(s(0)))
p(s(X)) -> X
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(X)) -> X
-> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 F(s(0)) -> F(p(s(0)))
 F(s(0)) -> P(s(0))
-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(X)) -> X
-> Unhiding Rules:
 Empty

Problem 1: 

SCC Processor:
-> Pairs:
 F(s(0)) -> F(p(s(0)))
 F(s(0)) -> P(s(0))
-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(X)) -> X
-> Unhiding rules:
 Empty
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(s(0)) -> F(p(s(0)))
->->-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(X)) -> X
->->-> Unhiding rules:
 Empty

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 F(s(0)) -> F(p(s(0)))
-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(X)) -> X
-> Unhiding rules:
 Empty
-> Usable rules:
 p(s(X)) -> X
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[p](X) = 1/2.X + 1/2
[0] = 0
[s](X) = 2.X + 2
[F](X) = 1/2.X

Problem 1: 

Basic Processor:
-> Pairs:
 Empty
-> Rules:
 f(0) -> cons(0,f(s(0)))
 f(s(0)) -> f(p(s(0)))
 p(s(X)) -> X
-> Unhiding rules:
 Empty
-> Result:
 Set P is empty

The problem is finite.