The Contradiction Method in CAT DILR

There are two ways to open a locked door with a bunch of keys. Try each key until one turns. Or look at the lock, rule out every key that obviously cannot fit, and try what remains.

Most aspirants solve DILR the first way. They look for the arrangement that works, testing candidates hopefully, and every failure feels like wasted time. The contradiction method treats each failure as the product rather than the cost, because a candidate you have proved impossible is permanently gone, and permanently gone is worth more than temporarily promising.

On a set where four arrangements survive the clues, proving three impossible is usually faster than constructing the fourth, and it comes with something construction never gives you: certainty that you have the right one.

Why Proving Impossibility Is Often Faster

Construction and elimination are not symmetric, and the asymmetry runs in your favour more often than people expect.

To construct the right arrangement you have to satisfy every constraint at once, which means carrying all of them simultaneously. To destroy a wrong one you only have to find a single constraint it violates. One is a search through a large space; the other is a search for one broken rule, and broken rules are usually near the surface.

The practical difference shows up in a few ways:

• Construction needs all clues. Elimination needs one. You can kill a candidate with the first constraint it fails.
• Construction is fragile. One wrong entry and the whole arrangement is wrong without telling you where.
• Elimination is permanent. A candidate proved impossible never has to be reconsidered.
• Elimination self-terminates. When one survives, you are finished and you know it.

The Elimination Proof: Three Moves

The method is old and reliable: assume the thing you doubt, follow it until something breaks, and treat the break as proof.

Assume and break is the move aspirants already make accidentally, and the change is entirely in how the outcome is treated:

• Pick the candidate that looks most likely, not least. If it dies, the rest die faster.
• Push it hard and quickly. You are not trying to make it work, so you can be careless in a way construction never permits.
• When it breaks, write down what broke it. That constraint will usually kill other candidates too.

Killing classes is where the real speed lives, and it is the step almost nobody takes deliberately:

• Instead of showing one seating fails, show nobody from group A can sit at the ends. That eliminates dozens.
• Parity arguments kill half the space at once and cost one line.
• An extremity argument, such as who must hold the maximum, often removes every arrangement but two.

Counting survivors is what turns elimination from a mood into a method:

• Write the candidate count at the top of your sheet and update it as you kill.
• If the count is not falling, your eliminations are hitting instances rather than classes.
• When it reaches one, stop. Constructing it to check is optional and usually unnecessary.

What Makes a Good Candidate to Attack

Not every candidate is worth attacking. The ones that repay the effort share a shape, and picking well is most of the technique.

That last row is the discipline in miniature. Whenever two candidates differ trivially, you are looking at a class, and attacking the class costs the same as attacking one member while removing both.

How to Tell a Real Contradiction From a Mistake

The method rests entirely on the contradiction being genuine. A false one eliminates the correct answer, which is unrecoverable. Before accepting a break, run four checks:

• Name the clue that was violated. A contradiction with no clue behind it is an arithmetic slip.
• Check it came from the assumption, not from something you carried in from a previous branch.
• Re-derive the last two steps. Most false contradictions appear within two steps of the break.
• Verify against an invariant. If the total or the parity also fails, the contradiction is almost certainly real.
• Write down what died and why. An unrecorded elimination gets re-tested later.

That discipline is the same one that keeps case branches recoverable, which matters here because an elimination proof is a case branch you intend to lose.

Common Mistakes With the Contradiction Method

Related errors:

• Attacking the weakest candidate. Killing an implausible arrangement teaches you almost nothing about the field.
• Eliminating instances. Working through arrangements one at a time when a property would have taken out a dozen.
• Accepting a slip as a contradiction. Eliminating the right answer through an arithmetic error, which cannot be recovered from.
• Not counting survivors. Losing track of how many candidates remain, so you cannot tell when you are finished.
• Constructing anyway. Building the last survivor to confirm it, when the elimination already proved it.

A Practice Drill for Solving Backwards

The drill forces elimination by removing construction as an option.

1. Take eight DILR sets. For each, list every arrangement consistent with the first two clues.
2. Now solve only by elimination. You may not construct anything; you may only prove candidates impossible.
3. After each kill, write the property that caused it and check whether it removes any other candidates.
4. Record how many candidates each single property removed. That number is your class-kill rate.

What the drill usually shows:

• Early kills remove one candidate each; by the fourth set they remove three or four.
• Parity and extremity arguments account for most of the high-yield kills.
• Sets that felt like guesswork resolve with certainty, because elimination ends in proof rather than in a plausible construction.
• The habit of recording the killing constraint transfers immediately to normal solving.

The Bottom Line

DILR is usually taught as a search for the arrangement that works. It is at least as productive to treat it as a demolition job. Every candidate you destroy stays destroyed, and when the field is empty except for one, you have not guessed the answer, you have proved it.

The Elimination Proof, Recap

• Assume and break: attack the most plausible candidate, and treat the contradiction as the result.
• Kill classes, not instances: eliminate a property and remove many candidates at once.
• Count survivors: when one remains, the set is solved.

Build the Habit on Timed CAT DILR

Elimination feels counter-intuitive under pressure, so it has to be rehearsed there. Work through CAT previous year questions in timed blocks, or sit full CAT mock tests and past papers so backwards solving survives real fatigue. More DILR method sits in the CAT DILR blog archive, and if sets keep ending in guesses it is worth having your approach reviewed honestly.

The Optima Learn Editorial Team builds CAT preparation content from exam-pattern analysis and Optima Learn's adaptive practice data. This guide is part of our CAT DILR preparation series.