X greater than 3 with at least 2 difference between X and Y I am trying to golf down some C++. Is it possible to make this condition shorter?

X &gt; 3 &amp; X - Y &gt; 1

(Apart from removing whitespace, of course.)

So, X is at least 4 but X &gt;= Y + 2.

X and Y are integers in the [0,5] interval.

I have tried to find some bitwise formula but failed.
After brute forcing every useful combination of symbols under 9 characters, I've found there to be no smaller solution than x&gt;3&amp;x-y&gt;1.

For fun here's some funky 9 character solutions the brute forcer found:

-x&lt;~y&gt;4&gt;x
~y+x&gt;2&gt;&gt;y
x*x-y*y&gt;9
~y&gt;x/~3*x
-3&gt;&gt;y&gt;y-x
~y+x&lt;&lt;y&gt;2




Brute forcing was done in Python, building top-down syntax trees where no child may have an operator with precedence lower than its parent according to C's rules. To cut down on possibilities I only allowed single digit literals, and no binary operator may have two constant children. I could not possibly think of any solution that would have a two digit literal, or one that builds a constant using a binary operator. Then each expression was evaluated for [0, 5] and if it matches it gets printed.