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
         ↳Remaining Obligation(s)




The following remains to be proven:
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



Innermost Termination of R could not be shown.
Duration:
0:00 minutes