Binary Logic in CAT DILR: A 4 Step Assumption Ladder

DILR

Five people, each either always truthful or always lying, and five statements about each other. You read it twice, decide it is a logic puzzle rather than a data set, and skip it. Twenty minutes later you come back with eight minutes left and the same feeling of not knowing where to start.

Binary logic sets have a reputation for being unstructured, and they are the opposite. Every speaker has exactly two possible states, which is the smallest search space in the whole section. Among CAT reasoning questions these are the ones where a mechanical method genuinely closes the set, and most aspirants never learn it.

Why Binary Logic Sets Look Impossible

The intimidation comes from the reading, not the logic. A set gives you five statements, each of which refers to other statements, and there is no obvious place to write anything down. Arrangement sets give you a grid to fill. These give you a paragraph of assertions.

So aspirants try to reason forward from the statements themselves, asking whether each one is plausible. That never works, because a statement's truth is not a property of the statement. It is a property of the speaker, and the speaker's type is exactly what you do not yet know.

• You read statement one and try to judge whether it is true. It cannot be judged in isolation.
• You look for the statement that seems most likely, which imports an assumption the set never made.
• You write the statements down as facts rather than as conditionals.
• You abandon a branch as soon as it feels wrong rather than when it produces a contradiction.

Each of those is the same error in different clothes: treating a statement as data. The fix is to treat the speaker as the variable and the statement as a consequence, which turns a paragraph of assertions into a two branch search.

The Three Set Types Hiding Under One Label

Binary logic is a label covering three different structures, and the opening move differs for each. Read the rules paragraph carefully enough to tell them apart, because using the wrong opening costs you the set.

Type	The rule	Opening move
Fixed types	Each person always tells the truth or always lies	Assume one person's type and propagate
Alternators	Each person alternates between true and false statements	Assume the first statement's value, then alternate down the list
Conditional	Truthfulness depends on a condition, such as the day or the subject	Split on the condition first, then treat each branch as fixed types

The rules paragraph is where all three are distinguished, and it is the paragraph aspirants skim because it looks like boilerplate. Read it twice and underline any sentence containing a number, since a stated count of liars is the constraint that most often kills a branch.

Fixed types is the most common and the one this method is built around. Alternators need the same method with a different bookkeeping column, and conditional sets simply add one branch before the method starts.

The Assumption Ladder: 4 Steps

Four steps, run in order, with no judgement calls anywhere in them. That is the point: the method removes the reasoning that was making the set feel hard.

• Every step is mechanical, so nothing in the method depends on spotting anything clever.

Why the Ladder Cannot Fail

With two states per speaker, assuming one type either survives or contradicts. If it contradicts, the other branch is proved without any further work. If it survives, you confirm it. There is no third outcome, which is why this method closes sets that intuition leaves open.

Step 1: Pick the Most Constrained Speaker

Any speaker works, but the wrong choice makes the propagation long. Count how often each person is mentioned in other people's statements and start with whoever appears most, because their type forces the most consequences immediately.

The second criterion is directness. A statement like B is a liar is worth far more than a statement like at least one of us is truthful, because the first forces a single value and the second forces almost nothing until other values are known.

• Prefer the speaker who is the subject of the most statements.
• Prefer direct assertions about a single person over statements about groups.
• Deprioritise anyone who only speaks about themselves.
• If two speakers tie, pick the one whose statement contradicts another statement, since that pair resolves fastest.

Step 2: Propagate, Do Not Evaluate

Once you have assumed a type, every statement by that person becomes a fact or its negation, and each of those forces something about someone else. Write those forced values down immediately and keep going until nothing new is forced.

The discipline is to suspend judgement completely. You are not asking whether the emerging picture is plausible. You are asking only what follows, and a branch that looks absurd halfway through is often the correct one, because the contradiction test is what decides, not your sense of it.

A Notation That Keeps Branches Separate

• Write the assumption at the top of a column, so a discarded branch can be crossed out whole.
• Use T and L for truthful and liar, and mark forced values with an arrow from the statement that forced them.
• Keep unused statements in a separate list, since those are what the confirmation step tests.
• Never erase a branch, because the second question in the set sometimes asks what happens under it.

Steps 3 and 4: Contradict, Then Confirm

The last two steps are a pair. Hunting finds the branch that dies, confirming proves the one that lived, and skipping the second is how aspirants answer a set correctly on three questions and wrongly on the fourth.

Hunt the Contradiction

A contradiction is one of exactly three things, and knowing the list stops you hunting vaguely. Check for these after every few forced values rather than only at the end.

1. A person forced to be both types. The clearest and most common contradiction.
2. A statement that comes out false from a truthful speaker, or true from a liar.
3. A count violation, where the set stated how many liars there are and your branch produces a different number.

The third one is the one aspirants miss. A stem saying exactly two of them always lie is a hard constraint, and it frequently kills a branch that is otherwise internally consistent. Read the rules paragraph for counts before you assume anything.

• Check after every two or three forced values, not only at the end of the branch.
• Reread the rules paragraph for a stated count before you assume anything at all.
• Treat a group statement, such as at least one of us lies, as a count constraint rather than an assertion.
• If a branch runs out of forced values without contradicting, stop propagating and move to confirmation.

Step 4: Confirm the Survivor

A branch with no contradiction is a candidate, not an answer. Take the surviving assignment and read every statement again, including the ones that never got used, checking each against the speaker's type.

This matters because a self referential statement often sits unused. Someone saying I always tell the truth forces nothing during propagation, so it is easy to leave it out and then find it was consistent with both branches anyway. Confirmation is where you notice that, and where you catch a second surviving branch if the set genuinely has one.

A Worked Set, Assumption by Assumption

Three people. Each always tells the truth or always lies. A says B always lies. B says A and C are of the same type. C says A always tells the truth. Determine each person's type.

1. Pick. A is mentioned twice, so start with A.
2. Branch one, assume A is truthful. Then B always lies, so B's statement is false, so A and C differ, so C always lies. But C said A is truthful, which is true, and a liar cannot say something true. Contradiction.
3. Branch two, assume A always lies. Then A's statement is false, so B is truthful. B's statement is therefore true, so A and C are the same type, so C always lies.
4. Confirm. C said A is truthful. A lies, so C's statement is false, which is what a liar must say. Consistent.
5. Answer. A lies, B is truthful, C lies. Branch one died on a contradiction, so this is unique.

Total working time is under ninety seconds and no step required insight. That is the whole argument for the ladder: it converts a set that feels like a puzzle into a set that feels like a checklist, which is the same conversion a good selection based DILR set rewards.

Building the Ladder Into Your CAT Preparation

These sets are trainable in about three weeks because the method is fixed and the variation is narrow. The training that works is deliberately slow at first, since speed here comes from confidence in the method rather than from hurrying it.

1. Week one. Five sets, untimed, writing both branches in full even when the first one works.
2. Week two. Five sets, timed at twelve minutes, still writing both branches.
3. Week three. Five sets at eight minutes, stopping the losing branch as soon as it contradicts.

Then take it into real papers, where the rules paragraph is denser and the count constraints are buried. Topic-wise CAT exam previous year questions are the honest test, and the free CAT DILR notes and cheatsheets hold the contradiction checklist if you would rather not rewrite it. If your DILR block keeps getting eaten, the AI study planner for CAT 2026 will protect one.