Example 3 Let p be defined as in example 2 and let X = {X A 1 , X A 2 , X A 3 }.
at each iteration, the algorithm performs a reduction by arbitrarily choosing a pair of adjacent endpoint sets from the agenda and by merging them.