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

0 QTRS
↳1 Overlay + Local Confluence (⇔)
↳2 QTRS
↳3 DependencyPairsProof (⇔)
↳4 QDP
↳5 DependencyGraphProof (⇔)
↳6 AND
  ↳7 QDP
    ↳8 QDPOrderProof (⇔)
    ↳9 QDP
    ↳10 PisEmptyProof (⇔)
    ↳11 TRUE
  ↳12 QDP
    ↳13 QDPOrderProof (⇔)
    ↳14 QDP
    ↳15 DependencyGraphProof (⇔)
    ↳16 TRUE
  ↳17 QDP
    ↳18 QDPOrderProof (⇔)
    ↳19 QDP
    ↳20 PisEmptyProof (⇔)
    ↳21 TRUE

(0) Obligation:

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

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(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:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

The set Q consists of the following terms:

le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
minus(0, x0)
minus(s(x0), x1)
ifMinus(true, s(x0), x1)
ifMinus(false, s(x0), x1)
quot(0, s(x0))
quot(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:

LE(s(X), s(Y)) → LE(X, Y)
MINUS(s(X), Y) → IFMINUS(le(s(X), Y), s(X), Y)
MINUS(s(X), Y) → LE(s(X), Y)
IFMINUS(false, s(X), Y) → MINUS(X, Y)
QUOT(s(X), s(Y)) → QUOT(minus(X, Y), s(Y))
QUOT(s(X), s(Y)) → MINUS(X, Y)

The TRS R consists of the following rules:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

The set Q consists of the following terms:

le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
minus(0, x0)
minus(s(x0), x1)
ifMinus(true, s(x0), x1)
ifMinus(false, s(x0), x1)
quot(0, s(x0))
quot(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 3 SCCs with 2 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:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

The set Q consists of the following terms:

le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
minus(0, x0)
minus(s(x0), x1)
ifMinus(true, s(x0), x1)
ifMinus(false, s(x0), x1)
quot(0, s(x0))
quot(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.


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)  =  x1
s(x1)  =  s(x1)
le(x1, x2)  =  le
0  =  0
true  =  true
false  =  false
minus(x1, x2)  =  x1
ifMinus(x1, x2, x3)  =  x2
quot(x1, x2)  =  quot(x1)

Lexicographic path order with status [LPO].
Quasi-Precedence:
[le, false] > [s1, quot1] > [0, true]

Status:
s1: [1]
le: []
0: []
true: []
false: []
quot1: [1]


The following usable rules [FROCOS05] were oriented:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

(9) Obligation:

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

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

The set Q consists of the following terms:

le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
minus(0, x0)
minus(s(x0), x1)
ifMinus(true, s(x0), x1)
ifMinus(false, s(x0), x1)
quot(0, s(x0))
quot(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:

MINUS(s(X), Y) → IFMINUS(le(s(X), Y), s(X), Y)
IFMINUS(false, s(X), Y) → MINUS(X, Y)

The TRS R consists of the following rules:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

The set Q consists of the following terms:

le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
minus(0, x0)
minus(s(x0), x1)
ifMinus(true, s(x0), x1)
ifMinus(false, s(x0), x1)
quot(0, s(x0))
quot(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.


IFMINUS(false, s(X), 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)  =  MINUS(x1, x2)
s(x1)  =  s(x1)
IFMINUS(x1, x2, x3)  =  IFMINUS(x2, x3)
le(x1, x2)  =  le
false  =  false
0  =  0
true  =  true
minus(x1, x2)  =  x1
ifMinus(x1, x2, x3)  =  x2
quot(x1, x2)  =  quot(x1, x2)

Lexicographic path order with status [LPO].
Quasi-Precedence:
[MINUS2, IFMINUS2] > [s1, 0, true]
le > false > [s1, 0, true]
quot2 > [s1, 0, true]

Status:
MINUS2: [2,1]
s1: [1]
IFMINUS2: [2,1]
le: []
false: []
0: []
true: []
quot2: [2,1]


The following usable rules [FROCOS05] were oriented:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

(14) Obligation:

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

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

The TRS R consists of the following rules:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

The set Q consists of the following terms:

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

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

(15) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(16) TRUE

(17) Obligation:

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

QUOT(s(X), s(Y)) → QUOT(minus(X, Y), s(Y))

The TRS R consists of the following rules:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

The set Q consists of the following terms:

le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
minus(0, x0)
minus(s(x0), x1)
ifMinus(true, s(x0), x1)
ifMinus(false, s(x0), x1)
quot(0, s(x0))
quot(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.


QUOT(s(X), s(Y)) → QUOT(minus(X, Y), s(Y))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
QUOT(x1, x2)  =  x1
s(x1)  =  s(x1)
minus(x1, x2)  =  x1
le(x1, x2)  =  le
0  =  0
true  =  true
false  =  false
ifMinus(x1, x2, x3)  =  x2
quot(x1, x2)  =  quot(x1)

Lexicographic path order with status [LPO].
Quasi-Precedence:
[le, false] > [s1, 0, quot1] > true

Status:
s1: [1]
le: []
0: []
true: []
false: []
quot1: [1]


The following usable rules [FROCOS05] were oriented:

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

(19) Obligation:

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

le(0, Y) → true
le(s(X), 0) → false
le(s(X), s(Y)) → le(X, Y)
minus(0, Y) → 0
minus(s(X), Y) → ifMinus(le(s(X), Y), s(X), Y)
ifMinus(true, s(X), Y) → 0
ifMinus(false, s(X), Y) → s(minus(X, Y))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(minus(X, Y), s(Y)))

The set Q consists of the following terms:

le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
minus(0, x0)
minus(s(x0), x1)
ifMinus(true, s(x0), x1)
ifMinus(false, s(x0), x1)
quot(0, s(x0))
quot(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