Term Rewriting System R:
[x, y, z]
and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

AND(not(not(x)), y, not(z)) -> AND(y, band(x, z), x)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Instantiation Transformation


Dependency Pair:

AND(not(not(x)), y, not(z)) -> AND(y, band(x, z), x)


Rule:


and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)


Strategy:

innermost




On this DP problem, an Instantiation SCC transformation can be performed.
As a result of transforming the rule

AND(not(not(x)), y, not(z)) -> AND(y, band(x, z), x)
one new Dependency Pair is created:

AND(not(not(x'')), band(not(z''), z'''), not(z'')) -> AND(band(not(z''), z'''), band(x'', z''), x'')

The transformation is resulting in no new DP problems.


Innermost Termination of R successfully shown.
Duration:
0:00 minutes