This is asking us what must always be the case. There are a few key deductions here, we know that only two of the three cities can be visited, and since p and s cannot be together, we know our two groups are 1:p/s 2:p/s
And since we know that HR are a block, our groups are
H R P/S
And
L P/s.
Let's see what we can do with this.
This means that the group of two can never go to V, since L is barred from V. However, the group of three could go to V with S instead of P, so d doesn't have to be true.
