[eclipse-users] Newbie question about bb_min/3

Hi all,

I am a newbie to ECLiPSe and I have the following question:

How can I find *all* minimal solutions to a COP problem (with more than
one optimal solution with the same objective value) with the libary
branch_and_bound?

Here is an simple example:

?- bb_min(member(X,[1,2,1]), X, bb_options{strategy:continue}).

As one would expect, the outcome is:

Found a solution with cost 1
Found a solution with cost -1.0Inf .. 0

The outcome I am interested in:

Found a solution with cost 1
Found a solution with cost 1
Found a solution with cost -1.0Inf .. 0

Is there an bb_option to influence the report/goal-success/bounding? Did
 I get something completely wrong?

Thank you for your help!

Best regards,
Martin Berger