Proof of `FF(1,m)||ΣZj is strongly NP-hard under the standard reading` (2nd statement)
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The emitter's program: it checks the numbers, walks them once storing the membership pairs, and writes the jobs of the construction one by one.