Advanced SHL Deductive Reasoning Preparation: Our Method and 6 Questions
ReasoningCampus · Online SHL preparation
SHL Deductive Reasoning Preparation: Our Method and 6 Questions
“Could be true” and “must be true” ask different questions, even when they use the same set of rules. SHL deductive reasoning becomes much clearer once you decide what kind of proof the question needs. ReasoningCampus offers deductive preparation built around translating conditions, constructing valid examples and using counterexamples to test necessity.
In deductive reasoning, you accept the supplied facts and work out their consequences. You do not need to guess what normally happens in a real workplace. A fictional schedule or grouping may feel unusual, but your answer must follow the conditions on the page. This lesson shows how to make those conditions visible and use them consistently.
View full preparationUnderstand the main deductive reasoning tasks
SHL’s public deductive fact sheets describe drawing conclusions and evaluating arguments or scenarios. The table below maps those broad skills to the original practice tasks we teach. Your assigned product may use multiple-choice or interactive responses; the invitation determines the actual format.
| Task | What establishes the answer | Common error |
|---|---|---|
| Valid arrangement | One arrangement satisfying every condition. | Checking the most obvious rule only. |
| Could be true | One valid example where the claim holds. | Trying to prove that it always holds. |
| Must be true | A deduction covering every valid arrangement. | Treating your first example as compulsory. |
| Cannot be true | A contradiction if the claim is assumed. | Rejecting an unfamiliar but valid possibility. |
| Grouping and allocation | Assignments respecting links, exclusions and capacity. | Forgetting that a group has a fixed size. |
| Argument or conditional conclusion | A conclusion supported by the premises. | Reversing “if” or importing outside assumptions. |
For the arrangement exercises, keep a compact checklist beside your draft: order, immediate neighbours, forbidden positions, group size. An immediate B–D relationship can be treated as a block; “A before C” leaves room between them. The six questions show why that distinction changes what is possible.
SHL deductive reasoning: our proof-and-counterexample method
We make the required proof explicit before arranging anything. One complete valid example can establish “could”; one valid counterexample can defeat “must”. For “cannot”, show that the proposed condition conflicts with the rules. Keep the entire arrangement available for checking, because a locally convenient placement may break a restriction elsewhere.
Deduction starts from supplied information. A conclusion must be justified by those facts and rules, without adding a preference, a likely workplace convention or a convenient assumption. For arrangement tasks, write down the legal possibilities before deciding what they prove.
SHL’s fact sheet for Verify Interactive Deductive describes an 18-minute, activity-based assessment with a maximum of 12 questions. SHL Direct also lists a multiple-choice deductive practice format. Do not transfer one product’s timing or navigation to every SHL invitation. Our six-question lesson is an untimed learning activity.
| Question | What establishes the answer? | What is insufficient? |
|---|---|---|
| Could be true | At least one complete valid arrangement in which it is true. | A partial arrangement that has not been checked. |
| Must be true | The conclusion holds in every valid arrangement. | One successful example. |
| Cannot be true | No valid arrangement permits it. | Failing to find an example after a quick guess. |
Translate the instruction before solving
- A before C: A has a lower position number; they need not be adjacent.
- B immediately before D: D follows B with no gap. Treat BD as an ordered block.
- E is neither first nor last: E must occupy an interior position.
- Exactly two: both a minimum and a maximum of two apply.
- At least two: two, three or more may be allowed, subject to the other rules.
Check that the rules admit at least one solution. If your practice notes create an impossible system, do not apply ordinary “must be true” reasoning to an empty set of arrangements. First check the transcription or explanation.
Use a counterexample to test necessity
To challenge “A must be first”, deliberately try to put someone else first while keeping every rule. One complete legal counterexample disproves necessity. It does not prove that A cannot be first; those are different claims.
Must be true: challenge your first valid arrangement
After finding an arrangement in which a statement holds, try to construct a valid one in which it fails. If you can, the statement is not necessary. If you cannot find one, that alone is not proof: explain which constraints exclude the alternatives. This is the distinction we ask you to justify in the worked ordering example.
Deductive reasoning worked example: an ordered block
Arrange Ada, Ben, Cam, Dev and Eli in five distinct positions from first to fifth. Each person appears exactly once. Ada is before Cam. Ben is immediately before Dev. Eli is neither first nor last. Use initials A, B, C, D and E.
Step 1: record the constraints
Write A < C, the block BD, and E ∈ {2, 3, 4}. These describe different relationships. In particular, A < C does not mean AC must be a block.
Step 2: build a complete legal example
A–B–D–E–C works: A precedes C, B is directly before D, and E is fourth. This proves that C could be fifth. It does not prove that C must be fifth.
Step 3: search for a counterexample
A–C–E–B–D also works, with C second. Therefore C is not necessarily last. B cannot be last because D would need a position immediately after it. D cannot be first because B must come immediately before it.
See all six valid arrangements and why the list is complete
The valid orders are ABDEC, ACEBD, AEBDC, AECBD, BDAEC and BDEAC.
The BD block can start at positions 1, 2, 3 or 4. Checking the remaining placements under A before C and E interior gives respectively two, one, one and two valid orders. These four block positions exhaust the possibilities, so the six-order list is complete.
Grouping uses the same discipline
Suppose four people P, Q, R and S form two groups of exactly two. P and Q must be in different groups, and R must join P. The groups are {P, R} and {Q, S}. “Two groups” alone would not imply equal sizes; the phrase “exactly two” supplies that restriction.
Common traps to remove from your working
- Turning “before” into “immediately before”.
- Using the same person twice and leaving another out.
- Proving that an option works while answering a “must” question.
- Rejecting an option after checking only one attempted arrangement.
- Adding a balance, fairness or chronological rule that the task did not give.
For meetings, use our separate scheduling and calendar lesson. Time intervals require an additional check of continuous overlap and any stated buffers.
Check an arrangement against all three rules
Use A for Ada, B for Ben, C for Cam, D for Dev and E for Eli. Rules: A before C; B immediately before D; E neither first nor last. All five initials must appear exactly once.
The tool reports whether your complete order is valid and names any violated constraint. A valid order establishes possibility only. The complete enumeration in the worked answer above is what supports conclusions about all possible orders.
SHL deductive reasoning: six explained practice questions
Try all six questions before opening the worked answers below. Submit your choices to see your score and individual feedback. You can change your choices before submission, or go straight to the answers and explanations for self-study.
This is an original ReasoningCampus learning check. One point is awarded per correct answer. The total is not an SHL score, a percentile, a pass prediction or a personality profile.
Answers and complete worked explanations
Open any question below to study the correct answer, the alternatives, the method and the common trap. These explanations are available without completing the quiz.
Review the reasoning in any missed or uncertain answer. The score describes this small set only.
Question 1: Could be true
Correct answer: A. ABDEC
Check A, A–B–D–E–C, against each rule in turn. A comes before C; B is immediately followed by D; and E is fourth, so it is at neither end. Every person appears once. That makes A a complete valid arrangement, not merely an arrangement satisfying one prominent rule.
In B, A–C–B–E–D, E separates B from D, breaking the immediate-following rule. C starts with E, which is forbidden. D places C before A, reversing their required order. For a “valid arrangement” question, you only need one breached rule to reject an option, but you must check all the rules before accepting one.
Question 2: Must be true
Correct answer: C. D is not first
C must be true because D needs B immediately before it. There is no position before the first position, so D cannot be first. This conclusion follows directly from the B–D block, regardless of where A, C and E are placed.
The other claims can be disproved by valid arrangements. A–C–E–B–D places C second, so C need not be last. B–D–E–A–C places B first, so A need not be first. A–B–D–E–C places E fourth, so E need not be third. Each counterexample satisfies every original rule. That last check matters: an invalid arrangement cannot disprove a “must” statement about valid arrangements.
Question 3: Cannot be true
Correct answer: B. B is fifth
B cannot be true. If B occupied the fifth and final position, D would need a sixth position to come immediately after it. No such position exists. This is an impossibility created by the fixed B–D block, rather than a conclusion based on how often you happened to place B elsewhere.
The remaining options are possible: A–C–E–B–D places C second; A–B–D–E–C places E fourth; and B–D–A–E–C places A third. Check each against A before C, B immediately before D, and E away from the ends. These examples establish possibility; they do not claim those positions are compulsory.
Question 4: Exactly two in each group
Correct answer: D. S
There are two groups of two people. R must be with P, so one whole group is already fixed as {P, R}. The two people left, Q and S, must form the other group. S therefore belongs with Q, D.
A would put S with P, creating three people in the P–R group or displacing R against the rule. B has the same problem because R is already tied to P. C treats S’s placement as optional, although the group capacities remove that freedom. In grouping problems, a compulsory partnership often does more work than several separate “not with” restrictions: place the fixed unit first, then fill the remaining capacity.
Question 5: What one example proves
Correct answer: C. K could be fourth
C is all that one valid example establishes: K could be fourth. You have produced a witness to possibility. To show that K must be fourth, you would need to rule out every valid arrangement placing K elsewhere, which this single example does not do.
A turns “can” into “must”. B makes an unsupported claim about every other person. D assumes the full arrangement is unique even though no alternatives have been eliminated. Keep the strength of your conclusion matched to your evidence. One valid arrangement proves “could”; one valid counterexample disproves “must”; establishing “must” requires a deduction that covers all valid arrangements.
Question 6: Before is not necessarily adjacent
Correct answer: A. WXYZ
A, W–X–Y–Z, respects both independent conditions: W is before Y and X is before Z. No condition says W must be immediately before Y, or that W must be before X. Avoid adding either restriction while checking the options.
B starts with Y before W, violating the first condition. C puts Z before X, violating the second. D also puts Z before X. This exercise illustrates a useful distinction between a partial order and a complete order: the rules establish some relationships while leaving others open. Your job is to preserve the required relationships, not to invent a single fixed sequence unless the evidence forces one.
SHL deductive reasoning preparation at ReasoningCampus
ReasoningCampus provides online SHL deductive preparation covering rules, ordering and constraints. This lesson teaches the proof standard behind those tasks. Use the scheduling lesson for time intervals, then consult the full preparation page for the current deductive materials and answer support.
Choose your next practice step
- You answered must using one example. Search for a complete counterexample and check it against every restriction.
- You treated before as immediately before. Rewrite the exact ordering relation before placing a block.
- You lose track of time windows. Move to the scheduling lesson and record availability separately from the duration required.
Explore the ReasoningCampus SHL preparation materials and choose the areas named in your assessment invitation.
SHL deductive reasoning: practical FAQs
How do I know whether to prove possibility or necessity?
Read the exact question stem. Could requires a valid example; must requires the conclusion to hold across all legal cases; cannot requires every attempted legal construction to fail for a reason that covers the possibilities.
Is one valid arrangement enough?
It is enough to establish that an arrangement or event could happen. It is not enough to prove that the arrangement is unique or that a feature must hold.
Should I list every possible order?
For a small practice example, enumeration can verify your reasoning. In a larger task, use restrictive rules, blocks and counterexamples to reduce work. The objective is a justified answer, not an unnecessarily long list.
What if I cannot find any legal arrangement?
Check whether you copied each rule correctly, used each object once and added an unstated assumption. If a third-party practice question is genuinely inconsistent, flag it rather than guessing a normal conclusion.
Can the calendar lesson replace this one?
The lessons overlap in constraint checking but address different errors. This page teaches must/could/cannot and grouping; the calendar lesson adds interval overlap, meeting duration and buffers.
What does ReasoningCampus teach for deductive preparation?
We teach rule translation, complete constraint checks, ordering, grouping and scheduling with worked explanations. Match the materials on the full preparation page to the specific assessment in your invitation.
Official sources and how this lesson was prepared
The SHL references below provide the assessment context. The teaching method, fictional examples, diagrams, tools and explained practice answers are ReasoningCampus learning material; they are not official SHL questions or scoring rules.
- SHL Verify Interactive Deductive Reasoning fact sheet
- SHL Direct: available deductive practice formats
AI assistance was used in research, drafting and implementation. Calculations, logic and the page tools were checked during preparation. These lessons are independent educational material; the methods are not SHL scoring rules. Read about ReasoningCampus or send a correction or question.
