(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

minus(X, s(Y)) → pred(minus(X, Y))
minus(X, 0) → X
pred(s(X)) → X
le(s(X), s(Y)) → le(X, Y)
le(s(X), 0) → false
le(0, Y) → true
gcd(0, Y) → 0
gcd(s(X), 0) → s(X)
gcd(s(X), s(Y)) → if(le(Y, X), s(X), s(Y))
if(true, s(X), s(Y)) → gcd(minus(X, Y), s(Y))
if(false, s(X), s(Y)) → gcd(minus(Y, X), s(X))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MINUS(X, s(Y)) → PRED(minus(X, Y))
MINUS(X, s(Y)) → MINUS(X, Y)
LE(s(X), s(Y)) → LE(X, Y)
GCD(s(X), s(Y)) → IF(le(Y, X), s(X), s(Y))
GCD(s(X), s(Y)) → LE(Y, X)
IF(true, s(X), s(Y)) → GCD(minus(X, Y), s(Y))
IF(true, s(X), s(Y)) → MINUS(X, Y)
IF(false, s(X), s(Y)) → GCD(minus(Y, X), s(X))
IF(false, s(X), s(Y)) → MINUS(Y, X)

The TRS R consists of the following rules:

minus(X, s(Y)) → pred(minus(X, Y))
minus(X, 0) → X
pred(s(X)) → X
le(s(X), s(Y)) → le(X, Y)
le(s(X), 0) → false
le(0, Y) → true
gcd(0, Y) → 0
gcd(s(X), 0) → s(X)
gcd(s(X), s(Y)) → if(le(Y, X), s(X), s(Y))
if(true, s(X), s(Y)) → gcd(minus(X, Y), s(Y))
if(false, s(X), s(Y)) → gcd(minus(Y, X), s(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs with 4 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LE(s(X), s(Y)) → LE(X, Y)

The TRS R consists of the following rules:

minus(X, s(Y)) → pred(minus(X, Y))
minus(X, 0) → X
pred(s(X)) → X
le(s(X), s(Y)) → le(X, Y)
le(s(X), 0) → false
le(0, Y) → true
gcd(0, Y) → 0
gcd(s(X), 0) → s(X)
gcd(s(X), s(Y)) → if(le(Y, X), s(X), s(Y))
if(true, s(X), s(Y)) → gcd(minus(X, Y), s(Y))
if(false, s(X), s(Y)) → gcd(minus(Y, X), s(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(6) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order and afs together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Homeomorphic Embedding Order

AFS:
s(x1)  =  s(x1)

From the DPs we obtained the following set of size-change graphs:

  • LE(s(X), s(Y)) → LE(X, Y) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 1 > 1, 2 > 2

We oriented the following set of usable rules [AAECC05,FROCOS05]. none

(7) TRUE

(8) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MINUS(X, s(Y)) → MINUS(X, Y)

The TRS R consists of the following rules:

minus(X, s(Y)) → pred(minus(X, Y))
minus(X, 0) → X
pred(s(X)) → X
le(s(X), s(Y)) → le(X, Y)
le(s(X), 0) → false
le(0, Y) → true
gcd(0, Y) → 0
gcd(s(X), 0) → s(X)
gcd(s(X), s(Y)) → if(le(Y, X), s(X), s(Y))
if(true, s(X), s(Y)) → gcd(minus(X, Y), s(Y))
if(false, s(X), s(Y)) → gcd(minus(Y, X), s(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(9) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order and afs together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Homeomorphic Embedding Order

AFS:
s(x1)  =  s(x1)

From the DPs we obtained the following set of size-change graphs:

  • MINUS(X, s(Y)) → MINUS(X, Y) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 1 >= 1, 2 > 2

We oriented the following set of usable rules [AAECC05,FROCOS05]. none

(10) TRUE

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

IF(true, s(X), s(Y)) → GCD(minus(X, Y), s(Y))
GCD(s(X), s(Y)) → IF(le(Y, X), s(X), s(Y))
IF(false, s(X), s(Y)) → GCD(minus(Y, X), s(X))

The TRS R consists of the following rules:

minus(X, s(Y)) → pred(minus(X, Y))
minus(X, 0) → X
pred(s(X)) → X
le(s(X), s(Y)) → le(X, Y)
le(s(X), 0) → false
le(0, Y) → true
gcd(0, Y) → 0
gcd(s(X), 0) → s(X)
gcd(s(X), s(Y)) → if(le(Y, X), s(X), s(Y))
if(true, s(X), s(Y)) → gcd(minus(X, Y), s(Y))
if(false, s(X), s(Y)) → gcd(minus(Y, X), s(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(12) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order and afs together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Combined order from the following AFS and order.
minus(x1, x2)  =  x1
s(x1)  =  s(x1)
pred(x1)  =  x1
0  =  0
true  =  true
false  =  false

Recursive path order with status [RPO].
Quasi-Precedence:

trivial

Status:
s1: multiset
0: multiset
true: multiset
false: multiset

AFS:
minus(x1, x2)  =  x1
s(x1)  =  s(x1)
pred(x1)  =  x1
0  =  0
true  =  true
false  =  false

From the DPs we obtained the following set of size-change graphs:

  • GCD(s(X), s(Y)) → IF(le(Y, X), s(X), s(Y)) (allowed arguments on rhs = {2, 3})
    The graph contains the following edges 1 >= 2, 2 >= 3

  • IF(true, s(X), s(Y)) → GCD(minus(X, Y), s(Y)) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 2 > 1, 3 >= 2

  • IF(false, s(X), s(Y)) → GCD(minus(Y, X), s(X)) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 3 > 1, 2 >= 2

We oriented the following set of usable rules [AAECC05,FROCOS05].


minus(X, s(Y)) → pred(minus(X, Y))
minus(X, 0) → X
pred(s(X)) → X

(13) TRUE