Boolean Difference of Collections in which not all Elements meet

Hi,

im working on a waffle script (Boring - I know) and run into trouble with the boolean difference of two sets of BREPs.

The trouble is that SolidDifference doesn't return anything if not all Breps of Set1 intersect with Set2

Below my examples files. I reduced the Definition to keep it slender and baked the previous output.

If I try to subtract all Blue Elements from the Orange Elements the Solid Difference doesn't return any results, since for example Element 1 and Element 2 don't meet.

There is probably a way to solve this problem with a C# component- However I was wondering if there is a GH - only way to solve it.

Thanks

Karl