This transformation applies De Morgan's laws to propagate the not
operator.
Find the prefix not
node with conjunction/disjunction inner binary expression. Propagate the not
using the De Morgan's
laws. Repeat the process with the left and right binary expression operands.
Before:
not (x and (y or z))
After:
(not x or (not y and not z))