NOTICE: This version of the paper has been superseded. An updated, corrected, and completely revised version of this paper with new results is available here: https://zenodo.org/records/20798793 Changes made and errors corrected in new version: 1. Signed verification of the cosmo testing and methodology results were not accurate. Thus, those results should not be considered reliable and were withdrawn until further testing. 2. The term, the Principle of Efficient Actualization (PEA) has been retired. The Theta Toy Model shows that Continuous Present Actualization (CPA) tends to proceed through relations that remain coherent, writable, and efficient under constraint. When a first distinction is placed inside a lawful relational closure grammar, subsequent actualization can generate structured candidate space. In the tested regimes, this minimal relational setup produced a formal vocabulary for first distinction, candidate bloom, relational inscription, lock-in, pressure densification, and non-regenerative closure. Theta Working Note can be found here: https://zenodo.org/records/20479240