2 independent variables · XOR + CNF · continuous search
True = +1; false = −1. The height is the sum of the two exact Fourier violation polynomials. At Boolean corners it counts violated constraints; inside the square it is their expected count under independent randomized rounding. Both variables are optimized independently. This computed teaching example uses projected gradient descent; local-search failure does not prove UNSAT. Paper ↗