IBM Ponder This #240 · April 2018

There are nine balloons in nine different colors. Each balloon has a different lifting capability, from one through nine grams (1, 2, 3...9) respectively. Alice knows the lifting capacities of each balloon, and she wants to use the smallest possible combinations of balloons to prove to Bob the identity of the 1-gram balloon. She can tie together any subset of balloons to a 9.5-gram weight that will stay put if and only if the total lifting power of the balloons is less than 9.5 grams. Otherwise the weight will lift off and fly away.
How does Alice prove to Bob the color of the 1-gram balloon by doing as few "experiments" as possible?
Each demonstration should use a subset of the balloons that does not lift the weight. Supply your answer as a list of weights per experiment.

For example, here is a (non-optimal) solution for a similar problem with only six balloons with 1-6 gram lifting capacities and a 6.5-gram weight:
1,2
1,3
1,4
1,5

In each one of the four experiments, Alice uses a subset of the balloons that does not lift the weight and that has a total lift capacity of six grams or less. Therefore, Bob can conclude that the balloon that is common to all the experiments must be the one with the 1-gram lift capacity.
Two wrong answers for the six-balloon example include the following:

1. A single experiment: "1,2,3" - this is the only combination of three balloons that won't lift the weight, but Bob can't know from this experiment alone which of the three balloons has the 1-gram lifting capacity.
2. Three experiments: "1,2" "1,3" and "1,5" - Bob can't distinguish between that and "2,1" "2,3" and "2,4". Both sets of experiments look exactly the same to him, so he can't be sure if the repeated balloon has a 1-gram or 2-gram lifting capacity.

Solution

Best opened after a real attempt

To be added.