EducationSigned-integer subtraction
625 problems.One teacher-controlled probe.
The compiler scans the frozen 25 by 25 domain, excludes the original problem to leave 624 eligible follow-ups, and persists the deterministic rank-one separator.
The compiler proves disagreement between formalized rules. It does not prove a learner's cognitive state.
Open evidence table
| Stage | Evidence | Output |
|---|---|---|
| Hypothesis 1 | Adds the written second operand | −9 |
| Hypothesis 2 | Uses a non-negative magnitude difference | 5 |
| Compiled probe | Smallest ranked separating problem | −2 − (−7) |
| Teacher approval | Human release gate | Teacher reviews |
| Learner response | One strict signed integer | One signed integer |
| Evidence update | Exact prediction matching | Exact matching |
One controlled evidence loop
Proof begins after constrained model mapping.
- 01
Constrained mapping
GPT maps observed work.
The model can select only templates from a closed, literature-grounded rule registry. Unknown or equivalent rules are rejected.
- 02
Deterministic separation
The compiler finds the probe.
A bounded search ranks the smallest problem on which the leading alternatives predict different answers.
- 03
Human custody
The teacher controls release.
One learner answer updates the evidence exactly; the teacher approves, edits, rejects, or abstains.
The narrow claim
Inspect the separation, not a confidence score.
Every prediction, rule version, compiler version, and probe hash is persisted before the learner sees the question. Ambiguous evidence remains unresolved.
- 01 Supported
- 02 Weakened
- 03 Unresolved
- 04 Abstained
Registry grounding
Published work informs the closed rule registry.
The current domain is deliberately narrow and still requires educator review before public validation claims.