/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 y)
(RULES
f(0,y) -> 0
f(s(x),y) -> f(f(x,y),y)
)

Problem 1: 

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

Problem 1: 

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

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 F(s(x),y) -> F(f(x,y),y)
 F(s(x),y) -> F(x,y)
-> Rules:
 f(0,y) -> 0
 f(s(x),y) -> f(f(x,y),y)
-> Usable rules:
 f(0,y) -> 0
 f(s(x),y) -> f(f(x,y),y)
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[f](X1,X2) = 2.X1
[0] = 2
[s](X) = 2.X + 2
[F](X1,X2) = 2.X1

Problem 1: 

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

Problem 1: 

Subterm Processor:
-> Pairs:
 F(s(x),y) -> F(x,y)
-> Rules:
 f(0,y) -> 0
 f(s(x),y) -> f(f(x,y),y)
->Projection:
 pi(F) = 1

Problem 1: 

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

The problem is finite.