Deductive reasoning asks what necessarily follows if the premises are accepted. A conclusion can sound believable without following from those premises, so the task is to check the relationship rather than rely on familiarity.
Build a valid chain
Suppose every copper token is marked, and every marked token is stored in the red tray. It follows that every copper token is stored in the red tray.
You can represent the chain as copper → marked → red tray. The conclusion preserves the direction of both rules. It does not imply that everything in the red tray is copper.
Test the reverse separately
Imagine a silver token that is also marked and placed in the red tray. Both original rules remain true. This shows why red tray → copper is not forced by them.
The counterexample is useful because it makes the missing implication concrete. Rather than saying the reverse seems doubtful, you have shown a situation where it fails.
Valid structure and factual premises are different
In a puzzle, you usually accept the given premises for the purpose of the question. Outside a puzzle, you also need to check whether those premises are true. Correctly following a chain does not verify the starting information.
This distinction helps explain why a logically structured argument can still reach an unreliable real-world conclusion if it begins with a false claim.
Try a short deduction
Every archived file is read-only. No read-only file can be edited in this system. What follows about archived files?
They cannot be edited in this system. The first rule places archived files within the read-only group; the second excludes that group from editable files. The result says nothing about whether every non-archived file is editable.
A checking routine
Write the rules in their original direction, connect only compatible steps and inspect whether the conclusion adds an unstated claim. If you can construct a counterexample while preserving the premises, the proposed conclusion is not a necessary deduction.