Termination w.r.t. Q of the given QTRS could not be shown:

(0) Obligation:

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

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

Q is empty.

(1) Overlay + Local Confluence (EQUIVALENT transformation)

The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.

(2) Obligation:

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

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

The set Q consists of the following terms:

min(x0, 0)
min(0, x0)
min(s(x0), s(x1))
max(x0, 0)
max(0, x0)
max(s(x0), s(x1))
-(x0, 0)
-(s(x0), s(x1))
gcd(s(x0), 0)
gcd(0, s(x0))
gcd(s(x0), s(x1))

(3) DependencyPairsProof (EQUIVALENT transformation)

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

(4) Obligation:

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

MIN(s(x), s(y)) → MIN(x, y)
MAX(s(x), s(y)) → MAX(x, y)
-¹(s(x), s(y)) → -¹(x, y)
GCD(s(x), s(y)) → GCD(-(max(x, y), min(x, y)), s(min(x, y)))
GCD(s(x), s(y)) → -¹(max(x, y), min(x, y))
GCD(s(x), s(y)) → MAX(x, y)
GCD(s(x), s(y)) → MIN(x, y)

The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

The set Q consists of the following terms:

min(x0, 0)
min(0, x0)
min(s(x0), s(x1))
max(x0, 0)
max(0, x0)
max(s(x0), s(x1))
-(x0, 0)
-(s(x0), s(x1))
gcd(s(x0), 0)
gcd(0, s(x0))
gcd(s(x0), s(x1))

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

(5) DependencyGraphProof (EQUIVALENT transformation)

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

(6) Complex Obligation (AND)

(7) Obligation:

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

-¹(s(x), s(y)) → -¹(x, y)

The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

The set Q consists of the following terms:

min(x0, 0)
min(0, x0)
min(s(x0), s(x1))
max(x0, 0)
max(0, x0)
max(s(x0), s(x1))
-(x0, 0)
-(s(x0), s(x1))
gcd(s(x0), 0)
gcd(0, s(x0))
gcd(s(x0), s(x1))

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

-¹(s(x), s(y)) → -¹(x, y)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
-¹(x1, x2)  =  -¹(x2)
s(x1)  =  s(x1)

Lexicographic Path Order [LPO].
Precedence:

s₁ > -^1₁

The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

The set Q consists of the following terms:

min(x0, 0)
min(0, x0)
min(s(x0), s(x1))
max(x0, 0)
max(0, x0)
max(s(x0), s(x1))
-(x0, 0)
-(s(x0), s(x1))
gcd(s(x0), 0)
gcd(0, s(x0))
gcd(s(x0), s(x1))

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

(10) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(11) TRUE

(12) Obligation:

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

MAX(s(x), s(y)) → MAX(x, y)

The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

The set Q consists of the following terms:

min(x0, 0)
min(0, x0)
min(s(x0), s(x1))
max(x0, 0)
max(0, x0)
max(s(x0), s(x1))
-(x0, 0)
-(s(x0), s(x1))
gcd(s(x0), 0)
gcd(0, s(x0))
gcd(s(x0), s(x1))

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

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MAX(s(x), s(y)) → MAX(x, y)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MAX(x1, x2)  =  MAX(x2)
s(x1)  =  s(x1)

Lexicographic Path Order [LPO].
Precedence:

s₁ > MAX₁

The following usable rules [FROCOS05] were oriented: none

(14) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

The set Q consists of the following terms:

min(x0, 0)
min(0, x0)
min(s(x0), s(x1))
max(x0, 0)
max(0, x0)
max(s(x0), s(x1))
-(x0, 0)
-(s(x0), s(x1))
gcd(s(x0), 0)
gcd(0, s(x0))
gcd(s(x0), s(x1))

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

(15) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(16) TRUE

(17) Obligation:

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

MIN(s(x), s(y)) → MIN(x, y)

The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

The set Q consists of the following terms:

min(x0, 0)
min(0, x0)
min(s(x0), s(x1))
max(x0, 0)
max(0, x0)
max(s(x0), s(x1))
-(x0, 0)
-(s(x0), s(x1))
gcd(s(x0), 0)
gcd(0, s(x0))
gcd(s(x0), s(x1))

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

(18) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MIN(s(x), s(y)) → MIN(x, y)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MIN(x1, x2)  =  MIN(x2)
s(x1)  =  s(x1)

Lexicographic Path Order [LPO].
Precedence:

s₁ > MIN₁

The following usable rules [FROCOS05] were oriented: none

(19) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

The set Q consists of the following terms:

min(x0, 0)
min(0, x0)
min(s(x0), s(x1))
max(x0, 0)
max(0, x0)
max(s(x0), s(x1))
-(x0, 0)
-(s(x0), s(x1))
gcd(s(x0), 0)
gcd(0, s(x0))
gcd(s(x0), s(x1))

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

(20) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(21) TRUE

(22) Obligation:

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

GCD(s(x), s(y)) → GCD(-(max(x, y), min(x, y)), s(min(x, y)))

The TRS R consists of the following rules:

min(x, 0) → 0
min(0, y) → 0
min(s(x), s(y)) → s(min(x, y))
max(x, 0) → x
max(0, y) → y
max(s(x), s(y)) → s(max(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
gcd(s(x), 0) → s(x)
gcd(0, s(x)) → s(x)
gcd(s(x), s(y)) → gcd(-(max(x, y), min(x, y)), s(min(x, y)))

The set Q consists of the following terms:

min(x0, 0)
min(0, x0)
min(s(x0), s(x1))
max(x0, 0)
max(0, x0)
max(s(x0), s(x1))
-(x0, 0)
-(s(x0), s(x1))
gcd(s(x0), 0)
gcd(0, s(x0))
gcd(s(x0), s(x1))

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