FA-15339 / Numerics / Member archive

Involution permutations: paired positions removal · case 04

The exact involution permutations result violates the stated contract at paired positions removal.

Member previewVariant 4 · 3 implementations · 6 checks per implementation

Case contract

Input 0<=n<=7; return lexicographically sorted permutations p of 0..n-1 satisfying p[p[i]]=i.

Why this case matters

Exact discrete arithmetic with observable algorithmic state; no floating point approximation is used.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
explicit oracle 0	`[[0, 1, 2, 3, 4, 5], [0, 1, 2, 3, 5, 4], [0, 1, 2, 4, 3, -1], [0, 1, 2, 5, -1, 3], [0, 1, 3, 2, -1, -1], [0, 1, 4, -1, 2, -1], [0, 1, 5, -1, -1, 2], [0, 2, 1, -1, -1, -1], [0, 3, -1, 1, -1, -1], [0, 4, -1, -1, 1, -1], [0, 5, -1, -1, -1, 1], [1, 0, -1, -1, -1, -1], [2, -1, 0, -1, -1, -1], [3, -1, -1, 0, -1, -1], [4, -1, -1, -1, 0, -1], [5, -1, -1, -1, -1, 0]]`	[[0, 1, 2, 3, 4, 5], [0, 1, 2, 3, 5, 4], [0, 1, 2, 4, 3, 5], [0, 1, 2, 5, 4, 3], [0, 1, 3, 2, 4, 5], [0, 1, 3, 2, 5, 4], [0, 1, 4, 3, 2, 5], [0, 1, 4, 5, 2, 3], [0, 1, 5, 3, 4, 2], [0, 1, 5, 4, 3, 2], [0, 2, 1, 3, 4, 5], [0, 2, 1, 3, 5, 4], [0, 2, 1, 4, 3, 5], [0, 2, 1, 5, 4, 3], [0, 3, 2, 1, 4, 5], [0, 3, 2, 1, 5, 4], [0, 3, 4, 1, 2, 5], [0, 3, 5, 1, 4, 2], [0, 4, 2, 3, 1, 5], [0, 4, 2, 5, 1, 3], [0, 4, 3, 2, 1, 5], [0, 4, 5, 3, 1, 2], [0, 5, 2, 3, 4, 1], [0, 5, 2, 4, 3, 1], [0, 5, 3, 2, 4, 1], [0, 5, 4, 3, 2, 1], [1, 0, 2, 3, 4, 5], [1, 0, 2, 3, 5, 4], [1, 0, 2, 4, 3, 5], [1, 0, 2, 5, 4, 3], [1, 0, 3, 2, 4, 5], [1, 0, 3, 2, 5, 4], [1, 0, 4, 3, 2, 5], [1, 0, 4, 5, 2, 3], [1, 0, 5, 3, 4, 2], [1, 0, 5, 4, 3, 2], [2, 1, 0, 3, 4, 5], [2, 1, 0, 3, 5, 4], [2, 1, 0, 4, 3, 5], [2, 1, 0, 5, 4, 3], [2, 3, 0, 1, 4, 5], [2, 3, 0, 1, 5, 4], [2, 4, 0, 3, 1, 5], [2, 4, 0, 5, 1, 3], [2, 5, 0, 3, 4, 1], [2, 5, 0, 4, 3, 1], [3, 1, 2, 0, 4, 5], [3, 1, 2, 0, 5, 4], [3, 1, 4, 0, 2, 5], [3, 1, 5, 0, 4, 2], [3, 2, 1, 0, 4, 5], [3, 2, 1, 0, 5, 4], [3, 4, 2, 0, 1, 5], [3, 4, 5, 0, 1, 2], [3, 5, 2, 0, 4, 1], [3, 5, 4, 0, 2, 1], [4, 1, 2, 3, 0, 5], [4, 1, 2, 5, 0, 3], [4, 1, 3, 2, 0, 5], [4, 1, 5, 3, 0, 2], [4, 2, 1, 3, 0, 5], [4, 2, 1, 5, 0, 3], [4, 3, 2, 1, 0, 5], [4, 3, 5, 1, 0, 2], [4, 5, 2, 3, 0, 1], [4, 5, 3, 2, 0, 1], [5, 1, 2, 3, 4, 0], [5, 1, 2, 4, 3, 0], [5, 1, 3, 2, 4, 0], [5, 1, 4, 3, 2, 0], [5, 2, 1, 3, 4, 0], [5, 2, 1, 4, 3, 0], [5, 3, 2, 1, 4, 0], [5, 3, 4, 1, 2, 0], [5, 4, 2, 3, 1, 0], [5, 4, 3, 2, 1, 0]]	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.