/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(0) -> 0
f(s(x)) -> s(s(f(p(s(x)))))
p(s(x)) -> x
)

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 f(0) -> 0
 f(s(x)) -> s(s(f(p(s(x)))))
 p(s(x)) -> 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)) -> F(p(s(x)))
 F(s(x)) -> P(s(x))
-> Rules:
 f(0) -> 0
 f(s(x)) -> s(s(f(p(s(x)))))
 p(s(x)) -> x

Problem 1: 

SCC Processor:
-> Pairs:
 F(s(x)) -> F(p(s(x)))
 F(s(x)) -> P(s(x))
-> Rules:
 f(0) -> 0
 f(s(x)) -> s(s(f(p(s(x)))))
 p(s(x)) -> x
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 F(s(x)) -> F(p(s(x)))
->->-> Rules:
 f(0) -> 0
 f(s(x)) -> s(s(f(p(s(x)))))
 p(s(x)) -> x

Problem 1: 

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

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 f(0) -> 0
 f(s(x)) -> s(s(f(p(s(x)))))
 p(s(x)) -> x
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.