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(s(x), s(y)) → minus(x, y)
minus(0, x) → 0
minus(x, 0) → x
div(s(x), s(y)) → s(div(minus(x, y), s(y)))
div(0, s(y)) → 0
f(x, 0, b) → x
f(x, s(y), b) → div(f(x, minus(s(y), s(0)), b), b)

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(s(x), s(y)) → minus(x, y)
minus(0, x) → 0
minus(x, 0) → x
div(s(x), s(y)) → s(div(minus(x, y), s(y)))
div(0, s(y)) → 0
f(x, 0, b) → x
f(x, s(y), b) → div(f(x, minus(s(y), s(0)), b), b)

The set Q consists of the following terms:

minus(x0, x0)
minus(s(x0), s(x1))
minus(0, x0)
minus(x0, 0)
div(s(x0), s(x1))
div(0, s(x0))
f(x0, 0, x1)
f(x0, s(x1), x2)

(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)
DIV(s(x), s(y)) → DIV(minus(x, y), s(y))
DIV(s(x), s(y)) → MINUS(x, y)
F(x, s(y), b) → DIV(f(x, minus(s(y), s(0)), b), b)
F(x, s(y), b) → F(x, minus(s(y), s(0)), b)
F(x, s(y), b) → MINUS(s(y), s(0))

The TRS R consists of the following rules:

minus(x, x) → 0
minus(s(x), s(y)) → minus(x, y)
minus(0, x) → 0
minus(x, 0) → x
div(s(x), s(y)) → s(div(minus(x, y), s(y)))
div(0, s(y)) → 0
f(x, 0, b) → x
f(x, s(y), b) → div(f(x, minus(s(y), s(0)), b), b)

The set Q consists of the following terms:

minus(x0, x0)
minus(s(x0), s(x1))
minus(0, x0)
minus(x0, 0)
div(s(x0), s(x1))
div(0, s(x0))
f(x0, 0, x1)
f(x0, s(x1), x2)

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:

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

The TRS R consists of the following rules:

minus(x, x) → 0
minus(s(x), s(y)) → minus(x, y)
minus(0, x) → 0
minus(x, 0) → x
div(s(x), s(y)) → s(div(minus(x, y), s(y)))
div(0, s(y)) → 0
f(x, 0, b) → x
f(x, s(y), b) → div(f(x, minus(s(y), s(0)), b), b)

The set Q consists of the following terms:

minus(x0, x0)
minus(s(x0), s(x1))
minus(0, x0)
minus(x0, 0)
div(s(x0), s(x1))
div(0, s(x0))
f(x0, 0, x1)
f(x0, s(x1), x2)

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.

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)

Lexicographic Path Order [LPO].
Precedence:

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(s(x), s(y)) → minus(x, y)
minus(0, x) → 0
minus(x, 0) → x
div(s(x), s(y)) → s(div(minus(x, y), s(y)))
div(0, s(y)) → 0
f(x, 0, b) → x
f(x, s(y), b) → div(f(x, minus(s(y), s(0)), b), b)

The set Q consists of the following terms:

minus(x0, x0)
minus(s(x0), s(x1))
minus(0, x0)
minus(x0, 0)
div(s(x0), s(x1))
div(0, s(x0))
f(x0, 0, x1)
f(x0, s(x1), x2)

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:

DIV(s(x), s(y)) → DIV(minus(x, y), s(y))

The TRS R consists of the following rules:

minus(x, x) → 0
minus(s(x), s(y)) → minus(x, y)
minus(0, x) → 0
minus(x, 0) → x
div(s(x), s(y)) → s(div(minus(x, y), s(y)))
div(0, s(y)) → 0
f(x, 0, b) → x
f(x, s(y), b) → div(f(x, minus(s(y), s(0)), b), b)

The set Q consists of the following terms:

minus(x0, x0)
minus(s(x0), s(x1))
minus(0, x0)
minus(x0, 0)
div(s(x0), s(x1))
div(0, s(x0))
f(x0, 0, x1)
f(x0, s(x1), x2)

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.

DIV(s(x), s(y)) → DIV(minus(x, y), s(y))

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

Lexicographic Path Order [LPO].
Precedence:

s₁ > minus₁ > 0

The following usable rules [FROCOS05] were oriented:

minus(0, x) → 0
minus(x, 0) → x
minus(x, x) → 0
minus(s(x), s(y)) → minus(x, y)

(14) Obligation:

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

minus(x, x) → 0
minus(s(x), s(y)) → minus(x, y)
minus(0, x) → 0
minus(x, 0) → x
div(s(x), s(y)) → s(div(minus(x, y), s(y)))
div(0, s(y)) → 0
f(x, 0, b) → x
f(x, s(y), b) → div(f(x, minus(s(y), s(0)), b), b)

The set Q consists of the following terms:

minus(x0, x0)
minus(s(x0), s(x1))
minus(0, x0)
minus(x0, 0)
div(s(x0), s(x1))
div(0, s(x0))
f(x0, 0, x1)
f(x0, s(x1), x2)

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:

F(x, s(y), b) → F(x, minus(s(y), s(0)), b)

The TRS R consists of the following rules:

minus(x, x) → 0
minus(s(x), s(y)) → minus(x, y)
minus(0, x) → 0
minus(x, 0) → x
div(s(x), s(y)) → s(div(minus(x, y), s(y)))
div(0, s(y)) → 0
f(x, 0, b) → x
f(x, s(y), b) → div(f(x, minus(s(y), s(0)), b), b)

The set Q consists of the following terms:

minus(x0, x0)
minus(s(x0), s(x1))
minus(0, x0)
minus(x0, 0)
div(s(x0), s(x1))
div(0, s(x0))
f(x0, 0, x1)
f(x0, s(x1), x2)

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