Build and verify a fresh rule after Lesson 23

Full specification: a system accepts when A or B is true, provided C is false. A, B and C are independent Boolean facts. You may use the Lesson 9 attempt as a record, but construct the executable solution yourself.

Record your first response, explanation and time before opening a key. There is no countdown. Use paper or your own scratch file; this page does not save responses.

1. Write the parenthesized Boolean rule and map A, B and C to Var(0), Var(1) and Var(2). State their repository names.
2. Choose a valid ordered row/column split different from the first Lesson 9 split. Declare false-first order and materialize the matrix with the public API.
3. Write a scalar oracle from the specification independently of the CM lookup. Compare all eight assignments and report the accepted count.
4. Change OR to exclusive-or in the specification, leaving the C requirement unchanged. Rebuild and repeat every check. Explain which assignments and count change.
5. Explain your output contract and why this is a small correctness exercise rather than a performance result.

The mathematics route may tabulate both variants by hand, but that does not satisfy the executable outcome of the programmer/full route.

Environment and existing worked lab · Checkpoint rubric · Lesson 23