ILOG CPLEX 11.0 User's Manual > Infeasibility and Unboundedness > Diagnosing Infeasibility by Refining Conflicts > Meet the Conflict Refiner in the Interactive Optimizer > Optimizing the Example

If you apply the optimize command to this example, you will see these results:

Row 'c8' infeasible, all entries at implied bounds.
Presolve time =    0.00 sec.  
MIP - Integer infeasible.
Current MIP best bound is infinite.
Solution time =    0.00 sec.  Iterations = 0  Nodes = 0