Multi-Step Conditional Reasoning

This is a set-difference question: you need to find the pets Alex has that neither Ben nor Carlos has. The fastest method is to go through Alex’s list one by one and cross out any pet that appears on Ben’s OR Carlos’s list. What survives is the answer.

Set-difference membership questions (find what belongs to one person but not the others) appear regularly in OC TS and are reliable easy marks once you use a systematic check rather than trying to reason about all three lists at once in your head.

The examiner checks whether students can carefully compare three overlapping lists and correctly identify the items that are exclusive to one list — without missing an overlap or incorrectly excluding an item.

Three people each have a list of items (pets, hobbies, foods). You are asked which items on one person’s list do not appear on either of the other two lists. The answer always contains exactly two items.

Preference Intersection questions are among the most approachable in this unit — the challenge isn't complex logical reasoning but systematic, methodical elimination. Your job is to find the one option that passes through every person's acceptance filter simultaneously, which becomes trivial once you stop trying to track everyone in your head at once.

These questions appear in the easy-to-medium band of OC TS and are near-certain marks for students who use a grid. The trap for unprepared students is trying to reason about all four people simultaneously — they miss one person's constraint and pick a cuisine that two of them actually can't eat.

The examiner wants to confirm that you can build a systematic compatibility check — listing each person's valid options — and then find the single choice that gets a tick from every person. Speed is not the challenge; discipline and completeness are.

Four or five people each have preferences or restrictions (e.g. "only likes X and Y", "will eat anything except Z"). A list of options is given. You must find the single option that every person agrees on. Exactly one option always satisfies all constraints simultaneously.

"Must have 20 hours to have a chance" means 20 hours is NECESSARY. The contrapositive is: less than 20 hours → zero chance (cannot pass). Option B states exactly this. Option A wrongly treats 20 hours as SUFFICIENT (a guarantee), which the rule never says.

"Necessary condition — draw the correct conclusion" questions appear regularly in the medium-to-difficult band of OC TS. The options always include one option that correctly applies the contrapositive (correct) and one that mistakenly treats the condition as sufficient (the classic trap).

The examiner checks whether students can correctly derive what MUST follow from a necessary condition statement — and resist the tempting but invalid inference that having the required condition GUARANTEES the outcome.

A rule states that X is necessary for Y ("you must have X to even have a chance of Y"). Students must identify which of four statements correctly follows from this rule — including options that reverse the logic or treat the condition as sufficient.

Two people look at the same information and each draw a different conclusion. Your job is to decide which of them — if either — is reasoning correctly. This question introduces one of the most important logical ideas in OC TS: the difference between what an alarm going off TELLS you and what an alarm staying SILENT tells you. These are two very different things.

"Whose reasoning is correct?" questions with two named speakers appear regularly in OC TS at the medium difficulty level. Students who evaluate each speaker separately, against the exact words of the given rules, score reliably. Students who go on intuition and only check one speaker are caught by the "both" or "neither" answer options.

The examiner is checking two skills at once: (1) contrapositive reasoning — can you correctly flip a conditional rule to apply in a new direction? and (2) necessary vs sufficient conditions — does the absence of a signal prove the absence of the thing it signals? Evaluate each speaker independently and completely.

A rule is given in a box (a conditional statement: "if X then Y" or "X always happens at time T"). Two speakers each make a deduction from that rule. You must check each deduction independently against the rule — not against common sense — and identify which conclusions genuinely follow from the stated information.

Two conditional rules, one given fact, and a chain of two deductions. This question is the cleanest example of multi-step conditional reasoning in OC TS: the first step requires using the CONTRAPOSITIVE of a rule (flipping and negating it), and the second step simply applies the second rule directly. Get those two moves in order and the answer is immediate.

Two-rule conditional chains appear regularly in OC TS at the medium difficulty level. The most common error is using Rule 1 forwards instead of backwards (not applying the contrapositive). Students who know "if NOT B → NOT A becomes if A → B when flipped" earn this mark reliably; those who try to reason intuitively often pick "Arthur only" and miss Conor.

The examiner is testing whether you can apply the contrapositive — the logical flip of a conditional rule — to draw the first conclusion, and then cascade that conclusion through the second rule to find the complete answer. Each rule is used exactly once; no rule is ignored.

Four people are subject to two if-then rules set by an authority figure (coach, teacher, manager). The question gives you the status of one person (e.g. "X does not play") and asks you to determine the status of the others. The first deduction always requires the contrapositive; the second follows directly from applying the remaining rule to the result.

Two students, Wei and Dylan, both hear the same two rules about their teacher. Dylan uses the rules forwards and gets it right. Wei uses them backwards and gets it wrong. The important lesson here is that a conditional rule ("if A then B") only tells you what happens when A occurs — it never tells you that A is the only thing that can cause B. This mistake — reasoning backwards and assuming the cause — is one of the most common errors in OC TS.

"Whose reasoning is correct?" questions with a box of information appear regularly in OC TS at the medium level. The paired-speaker format (one correct, one incorrect) is especially common. The incorrect speaker almost always makes the same type of error: reversing a rule. The correct speaker always uses the rule in the direction it was given.

The examiner is testing two things: (1) can you correctly chain two conditional rules in sequence (loss → bad mood → homework), and (2) can you identify when someone is incorrectly using a rule backwards (homework → bad mood → loss). Only the forward direction is guaranteed by the given rules.

A box states two chained if-then rules. Two students each draw a conclusion — one reasons forwards (using the rules as given), one reasons backwards (reversing the rules). The question asks whose reasoning is correct. The correct answer is "second speaker only" or "first speaker only" depending on who used the rules forwards.

Three pool balls in a line — but we only know the colours of Ball 1 and Ball 3. Ball 2's colour is a mystery. The question asks which statement MUST be true. The trick is that you can't know which statement is true in one scenario only — you need to find something that holds up no matter what colour Ball 2 turns out to be. This is the "must be true under all valid arrangements" skill.

"Which must be true?" questions with an unknown middle value appear in OC TS at the medium difficulty level. They are distinguished from "which could be true?" questions — here you need certainty across all scenarios, not just possibility in one. Students who only check one scenario often pick A or D, which are true in one arrangement but not the other.

The examiner is testing whether you can enumerate all valid scenarios (here, two: Ball 2 is red or yellow), check each answer option against every scenario, and select the only option that survives all of them. Options that are true in only one arrangement are deliberate distractors.

A sequence of events is described with one or more unknowns (usually one item with unspecified properties). You must identify which conclusion is guaranteed regardless of how the unknown is resolved. The correct answer is always true in every valid scenario; the wrong answers are each true in at most one.

Here is a pure rule-application challenge: two simple rules about shape sequences, and four possible sequences to test. The correct approach is methodical — go through each sequence position by position, trigger each rule whenever a square or triangle appears, and check whether the next required shape is actually there.

Shape sequence rule-checking questions appear occasionally in OC TS and reward systematic students. The most common mistake is forgetting to check Rule 2 for every triangle, especially when other shapes appear between the triangle and the required square two positions later.

The examiner is checking whether you can hold two conditional rules in your head simultaneously and apply them accurately to a 7-shape sequence. The trap is Option D, which satisfies Rule 1 perfectly at every position — all squares are followed by circles — but breaks Rule 2 because the triangle's required square appears one position too late.

A game or procedure has two or more "if X then Y" rules. Four possible sequences are given and you must find the one that violates at least one rule. The violating sequence is usually constructed to satisfy the more obvious rule while hiding a violation of the less obvious one.

A secret agent sends you a coded message: YFCPBKFVFGWCTPKXG. The cipher is simple — each letter is shifted by 2 forwards or backwards — but you need to check every letter of a 17-letter message against four possible answers. This question rewards students who stay methodical and eliminate options the moment they find a letter that cannot be decoded.

Cipher and coding questions appear 1–2 times per OC TS exam. They are popular because the rule is always stated clearly in the stem, and the challenge is purely about applying that rule accurately letter by letter. The most common mistake is forgetting that each coded letter can go in either direction (±2), so students sometimes eliminate the correct option too early.

The examiner is testing whether students can apply a single rule (shift ±2) consistently across a long sequence, and whether they can eliminate wrong options quickly by finding the first letter that does not decode cleanly. Only one option will have every letter decodable by a ±2 shift; the others will fail at specific positions.

A code or cipher is described with a simple rule (e.g. shift by N letters, substitute letters with symbols, reverse pairs). You are given a coded string and four possible decoded messages. You must find the one option where every character satisfies the rule. The coded string and all options have the same number of characters (spaces are removed).

The Crown Jewels have been stolen! Four animals each make a statement. Exactly one of them is telling the truth — and from that single constraint, you can figure out who stole the jewels. This is the classic "one truth-teller" logic puzzle. The method is always the same: try each suspect, check all four statements, count the truth-tellers. The one that gives exactly one is the answer.

"One truth-teller" and "one liar" logic puzzles appear regularly in OC TS and are considered reliable marks for students who know the method. They always have a unique solution because the "exactly one" constraint is tight enough to eliminate every wrong option. Students who try to reason without testing all cases often get stuck or make a lucky guess.

The examiner is testing whether students can apply a systematic truth-checking method to a multi-statement logic puzzle. The trap is the tiger's statement ("the rabbit is lying") — evaluating it correctly requires students to first check whether the rabbit's statement is true or false in each case, which depends on who actually stole the jewels.

Several characters each make a statement about who committed an act (theft, prank, etc.). A constraint is given: exactly one (or exactly N) of them is telling the truth. You must try each possible guilty party, evaluate every statement as true/false under that assumption, count the truth-tellers, and find the option that satisfies the constraint.

A class rule: the only children NOT going to the observatory are those playing in the soccer match. Maliyan says: Mei doesn't play soccer, so she must be going. Robyn says: Kirra isn't going, so she must be playing soccer. Both sound sensible — and for once, both ARE correct. This question is the positive counterpart to the 'necessary vs sufficient' confusion questions: sometimes BOTH people get the logic right, and the answer really is 'both'.

"Whose reasoning is correct?" questions with a biconditional rule (where NOT going ↔ playing soccer) have both directions valid, so both characters can be right. This answer ("both") catches students who always assume only one person is right. Recognising a biconditional rule (signalled by "the ONLY ones who … are the ones who …") is a high-value exam skill.

The examiner is testing whether students can identify a biconditional rule ("the only X are the Y" establishes X ↔ Y) and correctly apply both directions. Maliyan applies the contrapositive direction (NOT soccer → going). Robyn applies the direct direction (NOT going → soccer). Both are valid. Students who default to "only one can be right" or who confuse direction will pick A or B instead of C.

A rule is given as "the only [group A] are [group B]" — this establishes a biconditional: A ↔ B (and equivalently NOT A ↔ NOT B). Two characters each apply one direction of the rule. One applies the direct direction; the other applies the contrapositive direction. Both are valid, so the answer is "both". The trap is assuming the rule only goes one way.

Grant Valley scored zero goals all season. The rule is: to win, you must score more goals than the other team. Which of the four options MUST be true? The key is that 0 can never be greater than any non-negative number — so Grant Valley can never win. But they CAN draw 0-0, which means options A and B aren't guaranteed, and option C fails because another team might also have zero wins.

"Which must also be true?" questions that apply a strict definition (here: winning requires more goals) to an extreme case (zero goals scored) appear regularly in OC TS. They test whether students understand the difference between must-be-true and could-be-true. The trap option C ("won fewer than any other team") catches students who don't notice that another team could also have zero wins.

The examiner is testing whether students can apply the definition of winning (more goals than opponent) rigorously to a specific case (0 goals). They also test whether students can eliminate near-misses: option C sounds true (Grant Valley has 0 wins) but isn't necessarily true because 'fewer than ANY' requires no other team to also have 0 wins. Option D is the only iron-clad deduction.

A rule defines an outcome (to WIN = more goals; to earn points = win or draw). A specific scenario applies an extreme value (scored 0 goals). Four options make claims about what else must be true. One option is always guaranteed by the logic. The others either (1) need additional unknown information to be true, or (2) are close but fail under a specific counter-example.

Darren and Monaro have each won 3 matches and are about to play each other. Alyssa says at least one will qualify (need 4 wins from 5). Emily says they can't both qualify. Only one of them is right — and the key is tracing what happens after their match, then checking whether the loser can still reach 4 wins.

'Evaluate two claims' questions using qualification rules appear regularly in OC TS Unit 12. The most common mistake is assuming that the loser of a key match is eliminated — students forget the loser still has matches left. Always count remaining matches before ruling someone out.

The examiner tests whether students can correctly evaluate a 'must be true' claim (Alyssa's 'at least one') versus a 'cannot be true' claim (Emily's 'can't both'). The winner of the D vs M match is guaranteed to qualify (Alyssa is right), but the loser still has one match left and can reach 4 wins by winning it (so Emily is wrong). The trap is C (both correct) — students who correctly verify Alyssa but fail to check whether Emily's claim is truly impossible.

A competition has a qualification rule (e.g. must win at least 4 of 5 matches). Two players with equal records are about to play each other. Two people make claims about who can/must qualify. One claim is necessarily true, one is possibly false. The question asks which claimant is correct.

Now for the hardest and most intellectually rich type in this unit: a question where three logical statements chain together, and you must determine which conclusion absolutely MUST follow — not which one feels likely, and not which one sounds reasonable. The central challenge is that your brain will confidently construct connections the rules never actually guaranteed.

Multi-step conditional reasoning with "all" and "some" quantifiers is one of the most frequently tested difficult question types in OC TS. The same logical trap — connecting two groups that are both inside a third group but may not overlap with each other — recurs in almost every version. Students who recognise the trap find it easy; those who don't get pulled toward the most intuitive wrong answer every time.

The examiner is specifically testing whether you can resist the tempting leap from "group A is inside group B, and group B overlaps with group C" to "therefore group A overlaps with group C". That leap is NOT guaranteed by the rules, and the wrong answers are all built on exactly this kind of unjustified shortcut.

Three statements are given that describe set relationships — typically one "all A are B", one "some B are C", and one "all C are D". You are asked which of four conclusions MUST be true. The wrong answers always involve a claim about A and C that feels obvious but requires an extra assumption the rules never made.

Darren has a 15-card deck with 5 red, 5 blue, and 5 yellow cards numbered 1–5. Lily says drawing 11 cards guarantees all three colours; Tom says drawing 7 cards guarantees three different numbers. Are they right? This question introduces one of the most powerful reasoning patterns in OC TS: worst-case thinking. Instead of asking "what might happen?", you ask "what is the worst that can happen, and when does even that worst case guarantee the result?"

"Guarantee" or "certain to have" questions appear at least once in every OC TS exam. They require students to think about the most adversarial possible shuffle or arrangement, not the typical or average case. Students who think about average luck (e.g. "you'd probably get a yellow card in the first few draws") consistently get these questions wrong.

The examiner is testing two things simultaneously: (1) whether students understand that "certain" means worst case, not average case, and (2) whether students can verify two independent claims and choose "both correct" rather than assuming only one person is right. The "both correct" option is a common trap — many students assume it must be Lily only or Tom only.

A set of items has two attributes (e.g. colour and number). Two characters each make a claim about how many items must be drawn to guarantee a target for their respective attribute. You must verify each claim independently using worst-case reasoning: for each claim, find the maximum number of items you can draw WITHOUT satisfying the target, then add 1.

Three ways to cross the Korra River — two bridges on alternating days, and a ferry that always runs on Sundays but can also substitute when a bridge is damaged. Robbie thinks the ferry running two days in a row proves both bridges are broken. Declan thinks Archer Bridge is the only option on Fridays. Both are wrong. This question rewards students who think in counter-examples: "Can I find even one situation where their claim fails?"

"Whose reasoning is correct?" questions with conditional schedule rules appear in OC TS and selective school exams. They combine timetable reading with conditional logic. The "neither" answer is common in harder versions and catches students who assume at least one person must be right.

The examiner is testing two things: (1) whether students understand that the ferry's Sunday rule is unconditional and creates a "free" ferry day that can pair with any adjacent damaged-bridge day, and (2) whether students recognise that the ferry substitutes for Archer Bridge on a damaged Friday, meaning Archer Bridge is not the only Friday crossing option.

A schedule gives conditional rules about which crossing (bridge/ferry/path) is available on each day of the week. A fallback option is available when the normal option is unavailable. Two people each make a deductive claim about the system. You must verify each claim by looking for a counter-example that breaks it.