NO Termination w.r.t. Q proof of AProVE_07_thiemann26.ari

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

0 QTRS
↳1 DependencyPairsProof (⇔, 0 ms)
↳2 QDP
↳3 DependencyGraphProof (⇔, 0 ms)
↳4 AND
    ↳5 QDP
        ↳6 UsableRulesProof (⇔, 0 ms)
        ↳7 QDP
        ↳8 QDPSizeChangeProof (⇔, 0 ms)
        ↳9 YES
    ↳10 QDP
        ↳11 UsableRulesProof (⇔, 0 ms)
        ↳12 QDP
        ↳13 QDPSizeChangeProof (⇔, 0 ms)
        ↳14 YES
    ↳15 QDP
        ↳16 NonTerminationLoopProof (⇒, 9790 ms)
        ↳17 NO

(0) Obligation:

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

ge(x, 0) → true
ge(0, s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0) → x
minus(0, y) → 0
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0)
div(x, y, z) → if(ge(y, s(0)), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

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:

GE(s(x), s(y)) → GE(x, y)
MINUS(s(x), s(y)) → MINUS(x, y)
QUOT(x, y) → DIV(x, y, 0)
DIV(x, y, z) → IF(ge(y, s(0)), ge(x, y), x, y, z)
DIV(x, y, z) → GE(y, s(0))
DIV(x, y, z) → GE(x, y)
IF(true, true, x, y, z) → DIV(minus(x, y), y, id_inc(z))
IF(true, true, x, y, z) → MINUS(x, y)
IF(true, true, x, y, z) → ID_INC(z)

The TRS R consists of the following rules:

ge(x, 0) → true
ge(0, s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0) → x
minus(0, y) → 0
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0)
div(x, y, z) → if(ge(y, s(0)), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

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 5 less nodes.

(4) Complex Obligation (AND)

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

ge(x, 0) → true
ge(0, s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0) → x
minus(0, y) → 0
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0)
div(x, y, z) → if(ge(y, s(0)), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

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

(6) UsableRulesProof (EQUIVALENT transformation)

We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.

(7) Obligation:

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

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

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

(8) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

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

  • MINUS(s(x), s(y)) → MINUS(x, y)
    The graph contains the following edges 1 > 1, 2 > 2

(9) YES

(10) Obligation:

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

GE(s(x), s(y)) → GE(x, y)

The TRS R consists of the following rules:

ge(x, 0) → true
ge(0, s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0) → x
minus(0, y) → 0
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0)
div(x, y, z) → if(ge(y, s(0)), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

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

(11) UsableRulesProof (EQUIVALENT transformation)

We can use the usable rules and reduction pair processor [LPAR04] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its arguments. Then, we can delete all non-usable rules [FROCOS05] from R.

(12) Obligation:

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

GE(s(x), s(y)) → GE(x, y)

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

(13) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

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

  • GE(s(x), s(y)) → GE(x, y)
    The graph contains the following edges 1 > 1, 2 > 2

(14) YES

(15) Obligation:

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

DIV(x, y, z) → IF(ge(y, s(0)), ge(x, y), x, y, z)
IF(true, true, x, y, z) → DIV(minus(x, y), y, id_inc(z))

The TRS R consists of the following rules:

ge(x, 0) → true
ge(0, s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0) → x
minus(0, y) → 0
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0)
div(x, y, z) → if(ge(y, s(0)), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

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

(16) NonTerminationLoopProof (COMPLETE transformation)

We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

s = IF(ge(id_inc(x), s(0)), ge(x'', id_inc(0)), x', y', z') evaluates to t =IF(ge(y', s(0)), ge(minus(x', y'), y'), minus(x', y'), y', id_inc(z'))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
  • Matcher: [x / 0, x'' / minus(x', id_inc(0)), x' / minus(x', id_inc(0)), z' / id_inc(z')]
  • Semiunifier: [y' / id_inc(0)]



Rewriting sequence

IF(ge(id_inc(x), s(0)), ge(x'', id_inc(0)), x', id_inc(0), z') → IF(ge(id_inc(x), s(0)), ge(x'', 0), x', id_inc(0), z')
with rule id_inc(x1) → x1 at position [1,1] and matcher [x1 / 0]

IF(ge(id_inc(x), s(0)), ge(x'', 0), x', id_inc(0), z') → IF(ge(id_inc(x), s(0)), true, x', id_inc(0), z')
with rule ge(x''', 0) → true at position [1] and matcher [x''' / x'']

IF(ge(id_inc(x), s(0)), true, x', id_inc(0), z') → IF(ge(s(x), s(0)), true, x', id_inc(0), z')
with rule id_inc(x'') → s(x'') at position [0,0] and matcher [x'' / x]

IF(ge(s(x), s(0)), true, x', id_inc(0), z') → IF(ge(x, 0), true, x', id_inc(0), z')
with rule ge(s(x''), s(y)) → ge(x'', y) at position [0] and matcher [x'' / x, y / 0]

IF(ge(x, 0), true, x', id_inc(0), z') → IF(true, true, x', id_inc(0), z')
with rule ge(x'', 0) → true at position [0] and matcher [x'' / x]

IF(true, true, x', id_inc(0), z') → DIV(minus(x', id_inc(0)), id_inc(0), id_inc(z'))
with rule IF(true, true, x'', y', z'') → DIV(minus(x'', y'), y', id_inc(z'')) at position [] and matcher [x'' / x', y' / id_inc(0), z'' / z']

DIV(minus(x', id_inc(0)), id_inc(0), id_inc(z')) → IF(ge(id_inc(0), s(0)), ge(minus(x', id_inc(0)), id_inc(0)), minus(x', id_inc(0)), id_inc(0), id_inc(z'))
with rule DIV(x, y, z) → IF(ge(y, s(0)), ge(x, y), x, y, z)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence


All these steps are and every following step will be a correct step w.r.t to Q.



(17) NO