Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

and#( not( not( x ) ) , y , not( z ) ) → and#( y , band( x , z ) , x )

1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals
[and# (x1, x2, x3) ] = x1 + x2
[and (x1, x2, x3) ] = x1 + 2 x2
[band (x1, x2) ] = 1
[not (x1) ] = 2
[f(x1, ..., xn)] = x1 + ... + xn + 1 for all other symbols f of arity n

one remains with the following pair(s).

none

1.1.1: P is empty

All dependency pairs have been removed.