Standard ILP Formulation of Travelling salesman problem: Purpose of subtour elimination constraints?
Consider this example:



Every vertex has one incoming and one outgoing edge, so it is not prevented by the first two constraints. It is however prevented by the third constraint, as if you take any of the two connected components for $S$ it violates the inequality.