
I was able to solve this game in 3:23 using the setup above and a hypothetical for question 5.
I used ORW as a base because the only alternative is S/U/X (sliced, unsliced, not selected). I think you could do well with either, but I never tried with the latter.
On most games, there will be only a single question (the initial assignment question) which allows you to find the answer based on single rule violations alone.
What's atypical about this game as someone mentioned above is that, with the exception of Q5, every question is solvable from the initial rules, without need for application (hypothetical). Typically on a game there are multiple conditional questions, whereas this only features one (#5).
For question 3, (C) violates the initial diagram (rule 4) so it cannot be true.
For question 4, (D) must be true because there cannot be five (or six) sliced oatmeal loaves. There must be exactly six loaves selected, and rule 1 states that there must be at least two kinds of loaves. If there were five sliced loaves, combined with the one unsliced loaf (rule 4), then there could only be one kind (oatmeal).
Typically, when you get a global question (which of the following could/must/cannot be true?) you can potentially solve it in two ways: you can start constructing hypothetical diagrams, or you can check to see if one of the answer choices is in clear violation of an initial rule. In this game, the latter approach is able to knock out four of the five questions.