Recall the constraint-directed branching search of Figure.
At Node 6, what is the restricted problem Pk+1 (here k = 1)?
Exhibit a proof (a series of steps using the unit clause rule) that solves the inference dual of Pk+1 by proving infeasibility.
What is Tk+1, and what is the resulting no good? Do the same analysis at Node 7, where k = 2.
![781_Branching Tree.jpg](https://secure.tutorsglobe.com/CMSImages/781_Branching Tree.jpg)