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

Problem 1: 

Innermost Equivalent Processor:
-> Rules:
 gcd(0,y) -> y
 gcd(s(x),s(y)) -> if(<(x,y),gcd(s(x),-(y,x)),gcd(-(x,y),s(y)))
 gcd(x,0) -> x
-> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination.
 

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 Empty
-> Rules:
 gcd(0,y) -> y
 gcd(s(x),s(y)) -> if(<(x,y),gcd(s(x),-(y,x)),gcd(-(x,y),s(y)))
 gcd(x,0) -> x

Problem 1: 

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

The problem is finite.