Yikes, just as I feared, this one broke the solver!
As a background, the solver works by, step by step, compiling all the possible states of the game in one (growing) list. So, at step 0 it has one state (the starting state). At step 1 it has 3 states (the starting state and the two possible moves you could make). At step 2 it has more... and so on. Normally it works fine, but memory is the upper limit. The list can only grow so long before my computer starts to hang.
This made it to Step 22... where, with 24 million states in the queue, it froze. Moral of the story: this is a tough level.
Now I suppose I *could* replace a bunch of the irrelevant antineutrinos with crates, so as to cut down on the possible moves... but even then, I can't imagine the solver could handle the level. The number of states tends to grow pretty exponentially... and we're only halfway to our expected win-state (around 40, perhaps?). Looks like we're going to have to do this one by hand...