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:

minus(x, x) → 0
minus(0, x) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0

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:

minus(x, x) → 0
minus(0, x) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0

The set Q consists of the following terms:

minus(x0, x0)
minus(0, x0)
minus(x0, 0)
minus(s(x0), s(x1))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
quot(x0, x1)
if_quot(x0, x1, true, x2)
if_quot(x0, x1, false, true)
if_quot(x0, x1, false, false)

(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:

MINUS(s(x), s(y)) → MINUS(x, y)
LE(s(x), s(y)) → LE(x, y)
QUOT(x, y) → IF_QUOT(minus(x, y), y, le(y, 0), le(y, x))
QUOT(x, y) → MINUS(x, y)
QUOT(x, y) → LE(y, 0)
QUOT(x, y) → LE(y, x)
IF_QUOT(x, y, false, true) → QUOT(x, y)

The TRS R consists of the following rules:

minus(x, x) → 0
minus(0, x) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0

The set Q consists of the following terms:

minus(x0, x0)
minus(0, x0)
minus(x0, 0)
minus(s(x0), s(x1))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
quot(x0, x1)
if_quot(x0, x1, true, x2)
if_quot(x0, x1, false, true)
if_quot(x0, x1, false, false)

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

(5) DependencyGraphProof (EQUIVALENT transformation)

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

(6) Complex Obligation (AND)

(7) 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, x) → 0
minus(0, x) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0

The set Q consists of the following terms:

minus(x0, x0)
minus(0, x0)
minus(x0, 0)
minus(s(x0), s(x1))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
quot(x0, x1)
if_quot(x0, x1, true, x2)
if_quot(x0, x1, false, true)
if_quot(x0, x1, false, false)

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.

LE(s(x), s(y)) → LE(x, y)

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

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

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

minus(x, x) → 0
minus(0, x) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0

The set Q consists of the following terms:

minus(x0, x0)
minus(0, x0)
minus(x0, 0)
minus(s(x0), s(x1))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
quot(x0, x1)
if_quot(x0, x1, true, x2)
if_quot(x0, x1, false, true)
if_quot(x0, x1, false, false)

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:

MINUS(s(x), s(y)) → MINUS(x, y)

The TRS R consists of the following rules:

minus(x, x) → 0
minus(0, x) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0

The set Q consists of the following terms:

minus(x0, x0)
minus(0, x0)
minus(x0, 0)
minus(s(x0), s(x1))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
quot(x0, x1)
if_quot(x0, x1, true, x2)
if_quot(x0, x1, false, true)
if_quot(x0, x1, false, false)

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.

MINUS(s(x), s(y)) → MINUS(x, y)

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

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

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(14) Obligation:

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

minus(x, x) → 0
minus(0, x) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0

The set Q consists of the following terms:

minus(x0, x0)
minus(0, x0)
minus(x0, 0)
minus(s(x0), s(x1))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
quot(x0, x1)
if_quot(x0, x1, true, x2)
if_quot(x0, x1, false, true)
if_quot(x0, x1, false, false)

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:

QUOT(x, y) → IF_QUOT(minus(x, y), y, le(y, 0), le(y, x))
IF_QUOT(x, y, false, true) → QUOT(x, y)

The TRS R consists of the following rules:

minus(x, x) → 0
minus(0, x) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0

The set Q consists of the following terms:

minus(x0, x0)
minus(0, x0)
minus(x0, 0)
minus(s(x0), s(x1))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
quot(x0, x1)
if_quot(x0, x1, true, x2)
if_quot(x0, x1, false, true)
if_quot(x0, x1, false, false)

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