---
title: "Behavior and proofs"
url: https://afflom.github.io/prism-devrel/case-studies/foundry/behavior/
diataxis: reference
developer-journey: build
collection: case-studies
collection-group: "Foundry"
subject: https://github.com/UOR-Foundation/foundry
commit: 5fa2a21e5acadcac3f0f13fe98ae142064918794
---

# Behavior and proofs

> Every theorem of Foundry, and how it is proved. The Lean kernel checks each one.

Subject: [Foundry](https://github.com/UOR-Foundation/foundry) at commit [`5fa2a21e5aca`](https://github.com/UOR-Foundation/foundry/tree/5fa2a21e5acadcac3f0f13fe98ae142064918794), 248 facet records, source digest `6e5e13608777e1a0`.

**Figure: Behavior and proofs records by kind.** The 247 records this page teaches, one bar for each kind. Each kind has its own section below.

| | Count |
| --- | --- |
| theorem | 247 |

Behavior is what the Lean kernel checks. Every theorem below is proved when `prismpm verify` runs, by the method named beside it. [Proof and assurance](https://uor.foundation/docs/concepts/proof-and-assurance) explains what a proof covers, and what it does not.

- `decide` evaluates a closed statement; `simplify` and `boolean_reflection` prove statements over every input.

[Behavior and proofs facet](https://afflom.github.io/prism-devrel/facets/behavior/) explains the facet for every Prism model, with the counts of every case study.

## Every record

| Index | Record | Kind | Name |
| --- | --- | --- | --- |
| 0 | `ChatQueue::queue_activeEdit` | theorem | queue_activeEdit |
| 1 | `ChatQueue::queue_activeRemove` | theorem | queue_activeRemove |
| 2 | `ChatQueue::queue_activeReorder` | theorem | queue_activeReorder |
| 3 | `ChatQueue::queue_claim` | theorem | queue_claim |
| 4 | `ChatQueue::queue_clear` | theorem | queue_clear |
| 5 | `ChatQueue::queue_complete` | theorem | queue_complete |
| 6 | `ChatQueue::queue_duplicate` | theorem | queue_duplicate |
| 7 | `ChatQueue::queue_edit` | theorem | queue_edit |
| 8 | `ChatQueue::queue_enqueue` | theorem | queue_enqueue |
| 9 | `ChatQueue::queue_exhaustedRevision` | theorem | queue_exhaustedRevision |
| 10 | `ChatQueue::queue_fail` | theorem | queue_fail |
| 11 | `ChatQueue::queue_invalidCommand` | theorem | queue_invalidCommand |
| 12 | `ChatQueue::queue_invalidState` | theorem | queue_invalidState |
| 13 | `ChatQueue::queue_missing` | theorem | queue_missing |
| 14 | `ChatQueue::queue_pause` | theorem | queue_pause |
| 15 | `ChatQueue::queue_pausedClaim` | theorem | queue_pausedClaim |
| 16 | `ChatQueue::queue_recover` | theorem | queue_recover |
| 17 | `ChatQueue::queue_remove` | theorem | queue_remove |
| 18 | `ChatQueue::queue_reorder` | theorem | queue_reorder |
| 19 | `ChatQueue::queue_resume` | theorem | queue_resume |
| 20 | `ChatQueue::queue_staleResume` | theorem | queue_staleResume |
| 21 | `ChatQueue::queue_staleRevision` | theorem | queue_staleRevision |
| 22 | `ChatQueue::queue_stop` | theorem | queue_stop |
| 23 | `ChatQueue::queue_wrongOwner` | theorem | queue_wrongOwner |
| 24 | `ChatQueueProtocol::wire_clear` | theorem | wire_clear |
| 25 | `ChatQueueProtocol::wire_edit` | theorem | wire_edit |
| 26 | `ChatQueueProtocol::wire_empty` | theorem | wire_empty |
| 27 | `ChatQueueProtocol::wire_enqueue` | theorem | wire_enqueue |
| 28 | `ChatQueueProtocol::wire_pause` | theorem | wire_pause |
| 29 | `ChatQueueProtocol::wire_remove` | theorem | wire_remove |
| 30 | `ChatQueueProtocol::wire_reorder` | theorem | wire_reorder |
| 31 | `ChatQueueProtocol::wire_trailing` | theorem | wire_trailing |
| 32 | `EventAdmission::bytesEventAdmitted` | theorem | bytesEventAdmitted |
| 33 | `EventAdmission::duplicateRouteRefused` | theorem | duplicateRouteRefused |
| 34 | `EventAdmission::emptyBytesAdmitted` | theorem | emptyBytesAdmitted |
| 35 | `EventAdmission::exhaustedSequenceRefused` | theorem | exhaustedSequenceRefused |
| 36 | `EventAdmission::flagEventAdmitted` | theorem | flagEventAdmitted |
| 37 | `EventAdmission::futureSequenceRefused` | theorem | futureSequenceRefused |
| 38 | `EventAdmission::invalidByteRefused` | theorem | invalidByteRefused |
| 39 | `EventAdmission::invalidContractRefused` | theorem | invalidContractRefused |
| 40 | `EventAdmission::lastSequenceAdmitted` | theorem | lastSequenceAdmitted |
| 41 | `EventAdmission::missingRouteFeatureRefused` | theorem | missingRouteFeatureRefused |
| 42 | `EventAdmission::naturalEventAdmitted` | theorem | naturalEventAdmitted |
| 43 | `EventAdmission::oversizedNaturalRefused` | theorem | oversizedNaturalRefused |
| 44 | `EventAdmission::oversizedPayloadRefused` | theorem | oversizedPayloadRefused |
| 45 | `EventAdmission::replayedSequenceRefused` | theorem | replayedSequenceRefused |
| 46 | `EventAdmission::revokedPermissionRefused` | theorem | revokedPermissionRefused |
| 47 | `EventAdmission::staleGenerationRefused` | theorem | staleGenerationRefused |
| 48 | `EventAdmission::undeclaredFeatureEventRefused` | theorem | undeclaredFeatureEventRefused |
| 49 | `EventAdmission::wrongConsumerRefused` | theorem | wrongConsumerRefused |
| 50 | `EventAdmission::wrongEventKeyRefused` | theorem | wrongEventKeyRefused |
| 51 | `EventAdmission::wrongEventVersionRefused` | theorem | wrongEventVersionRefused |
| 52 | `EventAdmission::wrongFeatureVersionRefused` | theorem | wrongFeatureVersionRefused |
| 53 | `EventAdmission::wrongPayloadKindRefused` | theorem | wrongPayloadKindRefused |
| 54 | `EventAdmission::wrongProducerRefused` | theorem | wrongProducerRefused |
| 55 | `EventAdmission::zeroGenerationRefused` | theorem | zeroGenerationRefused |
| 56 | `EventProtocol::wire_flag` | theorem | wire_flag |
| 57 | `EventProtocol::wire_natural` | theorem | wire_natural |
| 58 | `EventProtocol::wire_revoked` | theorem | wire_revoked |
| 59 | `EventProtocol::wire_staleGeneration` | theorem | wire_staleGeneration |
| 60 | `EventProtocol::wire_trailing` | theorem | wire_trailing |
| 61 | `FeatureComposition::cpuRefused` | theorem | cpuRefused |
| 62 | `FeatureComposition::dependencyAdmitted` | theorem | dependencyAdmitted |
| 63 | `FeatureComposition::duplicateIdentityRefused` | theorem | duplicateIdentityRefused |
| 64 | `FeatureComposition::emptyRefused` | theorem | emptyRefused |
| 65 | `FeatureComposition::emptyVocabularyRefused` | theorem | emptyVocabularyRefused |
| 66 | `FeatureComposition::evidenceRefused` | theorem | evidenceRefused |
| 67 | `FeatureComposition::forwardDependencyRefused` | theorem | forwardDependencyRefused |
| 68 | `FeatureComposition::incompatibleInputRefused` | theorem | incompatibleInputRefused |
| 69 | `FeatureComposition::memoryRefused` | theorem | memoryRefused |
| 70 | `FeatureComposition::missingDependencyRefused` | theorem | missingDependencyRefused |
| 71 | `FeatureComposition::newConflictRefused` | theorem | newConflictRefused |
| 72 | `FeatureComposition::permissionRefused` | theorem | permissionRefused |
| 73 | `FeatureComposition::priorConflictRefused` | theorem | priorConflictRefused |
| 74 | `FeatureComposition::singleAdmitted` | theorem | singleAdmitted |
| 75 | `FeatureComposition::targetRefused` | theorem | targetRefused |
| 76 | `FeatureComposition::wrongVersionRefused` | theorem | wrongVersionRefused |
| 77 | `FeatureComposition::zeroIdentityRefused` | theorem | zeroIdentityRefused |
| 78 | `FeatureComposition::zeroVersionRefused` | theorem | zeroVersionRefused |
| 80 | `ForgeKernelProofs::budgetOverWithinHolds` | theorem | budgetOverWithinHolds |
| 81 | `ForgeKernelProofs::budgetWithinOverHolds` | theorem | budgetWithinOverHolds |
| 82 | `ForgeKernelProofs::builtBudgetBoundHolds` | theorem | builtBudgetBoundHolds |
| 83 | `ForgeKernelProofs::denyWinsHolds` | theorem | denyWinsHolds |
| 84 | `ForgeKernelProofs::editBudgetBoundHolds` | theorem | editBudgetBoundHolds |
| 85 | `ForgeKernelProofs::firstThinkHolds` | theorem | firstThinkHolds |
| 86 | `ForgeKernelProofs::inpBudgetBoundHolds` | theorem | inpBudgetBoundHolds |
| 87 | `ForgeKernelProofs::inv001Holds` | theorem | inv001Holds |
| 88 | `ForgeKernelProofs::inv002Holds` | theorem | inv002Holds |
| 89 | `ForgeKernelProofs::inv003Holds` | theorem | inv003Holds |
| 90 | `ForgeKernelProofs::inv004Holds` | theorem | inv004Holds |
| 91 | `ForgeKernelProofs::longMotionHolds` | theorem | longMotionHolds |
| 92 | `ForgeKernelProofs::narrowSplitHolds` | theorem | narrowSplitHolds |
| 93 | `ForgeKernelProofs::noRecordNoFetchHolds` | theorem | noRecordNoFetchHolds |
| 94 | `ForgeKernelProofs::noRecordOnlyForgeHolds` | theorem | noRecordOnlyForgeHolds |
| 95 | `ForgeKernelProofs::oldRecentHolds` | theorem | oldRecentHolds |
| 96 | `ForgeKernelProofs::outsideForgeNeedsGrantHolds` | theorem | outsideForgeNeedsGrantHolds |
| 97 | `ForgeKernelProofs::previewNoNetworkWithoutGrantHolds` | theorem | previewNoNetworkWithoutGrantHolds |
| 98 | `ForgeKernelProofs::reducedMotionHolds` | theorem | reducedMotionHolds |
| 99 | `ForgeKernelProofs::rewordKeepsProofHolds` | theorem | rewordKeepsProofHolds |
| 100 | `ForgeKernelProofs::rewordKeepsPublishedHolds` | theorem | rewordKeepsPublishedHolds |
| 101 | `ForgeKernelProofs::routeBelowFirstLoadHolds` | theorem | routeBelowFirstLoadHolds |
| 102 | `ForgeKernelProofs::smallTargetHolds` | theorem | smallTargetHolds |
| 103 | `ForgeKernelProofs::telemetryEgressHolds` | theorem | telemetryEgressHolds |
| 104 | `ForgeKernelProofs::telemetryOffDeviceHolds` | theorem | telemetryOffDeviceHolds |
| 105 | `ForgeKernelProofs::telemetryUnaskedHolds` | theorem | telemetryUnaskedHolds |
| 106 | `ForgeKernelProofs::wideTabsHolds` | theorem | wideTabsHolds |
| 107 | `FoundrySpecification::checkedExternalBoundary` | theorem | checkedExternalBoundary |
| 108 | `FoundrySpecification::competingExternalOwners` | theorem | competingExternalOwners |
| 109 | `FoundrySpecification::competingProductOwners` | theorem | competingProductOwners |
| 110 | `FoundrySpecification::missingExternalOwner` | theorem | missingExternalOwner |
| 111 | `FoundrySpecification::missingProductOwner` | theorem | missingProductOwner |
| 112 | `FoundrySpecification::oneProductOwner` | theorem | oneProductOwner |
| 113 | `FoundrySpecification::uncheckedExternalBoundary` | theorem | uncheckedExternalBoundary |
| 114 | `InteractionModel::interactionBackward` | theorem | interactionBackward |
| 115 | `InteractionModel::interactionBadDestination` | theorem | interactionBadDestination |
| 116 | `InteractionModel::interactionBadState` | theorem | interactionBadState |
| 117 | `InteractionModel::interactionCurrent` | theorem | interactionCurrent |
| 118 | `InteractionModel::interactionDuplicateRoute` | theorem | interactionDuplicateRoute |
| 119 | `InteractionModel::interactionEmptyFrames` | theorem | interactionEmptyFrames |
| 120 | `InteractionModel::interactionForward` | theorem | interactionForward |
| 121 | `InteractionModel::interactionMissingRoute` | theorem | interactionMissingRoute |
| 122 | `InteractionModel::interactionOutputState` | theorem | interactionOutputState |
| 123 | `InteractionModel::interactionReducedMotionStatic` | theorem | interactionReducedMotionStatic |
| 124 | `InteractionModel::interactionSilentWithoutConsent` | theorem | interactionSilentWithoutConsent |
| 125 | `InteractionModel::interactionWrongVersion` | theorem | interactionWrongVersion |
| 126 | `InteractionProtocol::interactionWire_empty` | theorem | interactionWire_empty |
| 127 | `InteractionProtocol::interactionWire_trailing` | theorem | interactionWire_trailing |
| 128 | `InteractionProtocol::interactionWords_duplicateRoute` | theorem | interactionWords_duplicateRoute |
| 129 | `InteractionProtocol::interactionWords_galleryNext` | theorem | interactionWords_galleryNext |
| 130 | `InteractionProtocol::interactionWords_gardenAudio` | theorem | interactionWords_gardenAudio |
| 131 | `InteractionProtocol::interactionWords_gardenReduced` | theorem | interactionWords_gardenReduced |
| 132 | `InteractionProtocol::interactionWords_gardenSilent` | theorem | interactionWords_gardenSilent |
| 133 | `InteractionProtocol::interactionWords_wrongVersion` | theorem | interactionWords_wrongVersion |
| 134 | `ProposalAdmission::ambiguityRefused` | theorem | ambiguityRefused |
| 135 | `ProposalAdmission::confidenceCannotGrantPermission` | theorem | confidenceCannotGrantPermission |
| 136 | `ProposalAdmission::confidenceCannotIncreaseBudget` | theorem | confidenceCannotIncreaseBudget |
| 137 | `ProposalAdmission::constraintRefused` | theorem | constraintRefused |
| 138 | `ProposalAdmission::duplicateRegistryRefused` | theorem | duplicateRegistryRefused |
| 139 | `ProposalAdmission::duplicateSelectionRefused` | theorem | duplicateSelectionRefused |
| 140 | `ProposalAdmission::emptySelectionRefused` | theorem | emptySelectionRefused |
| 141 | `ProposalAdmission::exactVersionSelected` | theorem | exactVersionSelected |
| 142 | `ProposalAdmission::invalidConfidenceRefused` | theorem | invalidConfidenceRefused |
| 143 | `ProposalAdmission::malformedRegistryRefused` | theorem | malformedRegistryRefused |
| 144 | `ProposalAdmission::maximumConfidenceAdmitted` | theorem | maximumConfidenceAdmitted |
| 145 | `ProposalAdmission::missingDependencyRefused` | theorem | missingDependencyRefused |
| 146 | `ProposalAdmission::orderedDependenciesAdmitted` | theorem | orderedDependenciesAdmitted |
| 147 | `ProposalAdmission::staleIntentRefused` | theorem | staleIntentRefused |
| 148 | `ProposalAdmission::staleRegistryRefused` | theorem | staleRegistryRefused |
| 149 | `ProposalAdmission::unknownFeatureRefused` | theorem | unknownFeatureRefused |
| 150 | `ProposalAdmission::wrongOrderRefused` | theorem | wrongOrderRefused |
| 151 | `ProposalAdmission::wrongVersionRefused` | theorem | wrongVersionRefused |
| 152 | `ProposalAdmission::zeroConfidenceAdmitted` | theorem | zeroConfidenceAdmitted |
| 153 | `ProposalAdmission::zeroExpectedIntentRefused` | theorem | zeroExpectedIntentRefused |
| 154 | `ProposalAdmission::zeroExpectedRevisionRefused` | theorem | zeroExpectedRevisionRefused |
| 155 | `RoutingProtocol::routingRaw_empty` | theorem | routingRaw_empty |
| 156 | `RoutingProtocol::routingRaw_uppercase` | theorem | routingRaw_uppercase |
| 157 | `RoutingProtocol::routingWords_ambiguity` | theorem | routingWords_ambiguity |
| 158 | `RoutingProtocol::routingWords_exactGallery` | theorem | routingWords_exactGallery |
| 159 | `RoutingProtocol::routingWords_forwardDependency` | theorem | routingWords_forwardDependency |
| 160 | `RoutingProtocol::routingWords_invalidWeight` | theorem | routingWords_invalidWeight |
| 161 | `RoutingProtocol::routingWords_permissionDenied` | theorem | routingWords_permissionDenied |
| 162 | `RoutingProtocol::routingWords_unknown` | theorem | routingWords_unknown |
| 163 | `SemanticRouter::router_admissionIndependent` | theorem | router_admissionIndependent |
| 164 | `SemanticRouter::router_budgetExceeded` | theorem | router_budgetExceeded |
| 165 | `SemanticRouter::router_contextDisambiguates` | theorem | router_contextDisambiguates |
| 166 | `SemanticRouter::router_duplicateIntent` | theorem | router_duplicateIntent |
| 167 | `SemanticRouter::router_emptyIntent` | theorem | router_emptyIntent |
| 168 | `SemanticRouter::router_exactGalleryClosure` | theorem | router_exactGalleryClosure |
| 169 | `SemanticRouter::router_exactRankScore` | theorem | router_exactRankScore |
| 170 | `SemanticRouter::router_featureConflict` | theorem | router_featureConflict |
| 171 | `SemanticRouter::router_forwardDependency` | theorem | router_forwardDependency |
| 172 | `SemanticRouter::router_incompatibleInput` | theorem | router_incompatibleInput |
| 173 | `SemanticRouter::router_invalidRelation` | theorem | router_invalidRelation |
| 174 | `SemanticRouter::router_missingEvidence` | theorem | router_missingEvidence |
| 175 | `SemanticRouter::router_multidomainClosure` | theorem | router_multidomainClosure |
| 176 | `SemanticRouter::router_noContextOnlyCandidate` | theorem | router_noContextOnlyCandidate |
| 177 | `SemanticRouter::router_permissionDenied` | theorem | router_permissionDenied |
| 178 | `SemanticRouter::router_relationGalleryClosure` | theorem | router_relationGalleryClosure |
| 179 | `SemanticRouter::router_staleIntent` | theorem | router_staleIntent |
| 180 | `SemanticRouter::router_staleRegistry` | theorem | router_staleRegistry |
| 181 | `SemanticRouter::router_unknownAbstains` | theorem | router_unknownAbstains |
| 182 | `SemanticRouter::router_unresolvedAmbiguity` | theorem | router_unresolvedAmbiguity |
| 183 | `SemanticRouter::router_unresolvedConstraint` | theorem | router_unresolvedConstraint |
| 184 | `SemanticRouter::router_unselectedIntentRemainsUnresolved` | theorem | router_unselectedIntentRemainsUnresolved |
| 185 | `VersionPreview::preview_acquire` | theorem | preview_acquire |
| 186 | `VersionPreview::preview_emptyOwner` | theorem | preview_emptyOwner |
| 187 | `VersionPreview::preview_exhausted` | theorem | preview_exhausted |
| 188 | `VersionPreview::preview_inactiveOrigin` | theorem | preview_inactiveOrigin |
| 189 | `VersionPreview::preview_inactiveOwner` | theorem | preview_inactiveOwner |
| 190 | `VersionPreview::preview_inactiveRecovery` | theorem | preview_inactiveRecovery |
| 191 | `VersionPreview::preview_inactiveReturn` | theorem | preview_inactiveReturn |
| 192 | `VersionPreview::preview_inactiveSelect` | theorem | preview_inactiveSelect |
| 193 | `VersionPreview::preview_invalidKind` | theorem | preview_invalidKind |
| 194 | `VersionPreview::preview_invalidOwner` | theorem | preview_invalidOwner |
| 195 | `VersionPreview::preview_invalidPhase` | theorem | preview_invalidPhase |
| 196 | `VersionPreview::preview_maximumIdentity` | theorem | preview_maximumIdentity |
| 197 | `VersionPreview::preview_occupied` | theorem | preview_occupied |
| 198 | `VersionPreview::preview_recover` | theorem | preview_recover |
| 199 | `VersionPreview::preview_restorePrepared` | theorem | preview_restorePrepared |
| 200 | `VersionPreview::preview_returnOrigin` | theorem | preview_returnOrigin |
| 201 | `VersionPreview::preview_sameRecoveryOwner` | theorem | preview_sameRecoveryOwner |
| 202 | `VersionPreview::preview_select` | theorem | preview_select |
| 203 | `VersionPreview::preview_selectSame` | theorem | preview_selectSame |
| 204 | `VersionPreview::preview_staleRevision` | theorem | preview_staleRevision |
| 205 | `VersionPreview::preview_unusedTarget` | theorem | preview_unusedTarget |
| 206 | `VersionPreview::preview_wrongRestoreOwner` | theorem | preview_wrongRestoreOwner |
| 207 | `VersionPreview::preview_wrongReturnOwner` | theorem | preview_wrongReturnOwner |
| 208 | `VersionPreview::preview_wrongSelectOwner` | theorem | preview_wrongSelectOwner |
| 209 | `VersionPreviewProtocol::previewRaw_empty` | theorem | previewRaw_empty |
| 210 | `VersionPreviewProtocol::previewRaw_trailing` | theorem | previewRaw_trailing |
| 211 | `VersionPreviewProtocol::previewWire_acquire` | theorem | previewWire_acquire |
| 212 | `VersionPreviewProtocol::previewWire_recover` | theorem | previewWire_recover |
| 213 | `VersionPreviewProtocol::previewWire_restorePrepared` | theorem | previewWire_restorePrepared |
| 214 | `VersionPreviewProtocol::previewWire_returnOrigin` | theorem | previewWire_returnOrigin |
| 215 | `VersionPreviewProtocol::previewWire_select` | theorem | previewWire_select |
| 216 | `VersionPreviewProtocol::previewWire_selectSame` | theorem | previewWire_selectSame |
| 217 | `WorkOwnership::completedResumeRefused` | theorem | completedResumeRefused |
| 218 | `WorkOwnership::completionReleasesReservation` | theorem | completionReleasesReservation |
| 219 | `WorkOwnership::emptyProgressRefused` | theorem | emptyProgressRefused |
| 220 | `WorkOwnership::emptyReserveRefused` | theorem | emptyReserveRefused |
| 221 | `WorkOwnership::emptyResumeRefused` | theorem | emptyResumeRefused |
| 222 | `WorkOwnership::excessObligationRefused` | theorem | excessObligationRefused |
| 223 | `WorkOwnership::excessReserveRefused` | theorem | excessReserveRefused |
| 224 | `WorkOwnership::initializeAdmitted` | theorem | initializeAdmitted |
| 225 | `WorkOwnership::initializeEmptyRefused` | theorem | initializeEmptyRefused |
| 226 | `WorkOwnership::initializeOwnerRefused` | theorem | initializeOwnerRefused |
| 227 | `WorkOwnership::invalidStateRefused` | theorem | invalidStateRefused |
| 228 | `WorkOwnership::missingOwnerRefused` | theorem | missingOwnerRefused |
| 229 | `WorkOwnership::pauseRetainsWork` | theorem | pauseRetainsWork |
| 230 | `WorkOwnership::pausedCompletionAdmitted` | theorem | pausedCompletionAdmitted |
| 231 | `WorkOwnership::pausedProgressRefused` | theorem | pausedProgressRefused |
| 232 | `WorkOwnership::progressAdmitted` | theorem | progressAdmitted |
| 233 | `WorkOwnership::reserveAdmitted` | theorem | reserveAdmitted |
| 234 | `WorkOwnership::reservedStartAdmitted` | theorem | reservedStartAdmitted |
| 235 | `WorkOwnership::resumeRetainsWork` | theorem | resumeRetainsWork |
| 236 | `WorkOwnership::runningReserveRefused` | theorem | runningReserveRefused |
| 237 | `WorkOwnership::runningTransferRefused` | theorem | runningTransferRefused |
| 238 | `WorkOwnership::staleCheckpointRefused` | theorem | staleCheckpointRefused |
| 239 | `WorkOwnership::staleRevisionRefused` | theorem | staleRevisionRefused |
| 240 | `WorkOwnership::transferRetainsWork` | theorem | transferRetainsWork |
| 241 | `WorkOwnership::unfinishedRefused` | theorem | unfinishedRefused |
| 242 | `WorkOwnership::unreservedProgressRefused` | theorem | unreservedProgressRefused |
| 243 | `WorkOwnership::unreservedStartRefused` | theorem | unreservedStartRefused |
| 244 | `WorkOwnership::wrongOwnerRefused` | theorem | wrongOwnerRefused |
| 245 | `WorkProtocol::wireProgressKeepsAccounting` | theorem | wireProgressKeepsAccounting |
| 246 | `WorkProtocol::wireRefusesCounterOverflow` | theorem | wireRefusesCounterOverflow |
| 247 | `WorkProtocol::wireRejectsWrongOwner` | theorem | wireRejectsWrongOwner |

## theorem (247)

**ChatQueue: 24 records**

### `queue_activeEdit`

`ChatQueue::queue_activeEdit` · theorem · #0 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 11, owner := 7, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 4, item := 11, index := 0, owner := 0, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queueActiveConflict)))`
- proof: `reflexivity`

Taught by: behavior, slides

### `queue_activeRemove`

`ChatQueue::queue_activeRemove` · theorem · #1 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 11, owner := 7, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 2, item := 11, index := 0, owner := 0, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queueActiveConflict)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_activeReorder`

`ChatQueue::queue_activeReorder` · theorem · #2 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 11, owner := 7, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 3, item := 12, index := 0, owner := 0, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queueActiveConflict)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_claim`

`ChatQueue::queue_claim` · theorem · #3 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 9, item := 0, index := 0, owner := 7, observedStop := 2})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 0, stopPolicy := 2, active := 11, owner := 7, items := (cons 11 (cons 12 (cons 13 (nil Nat))))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_clear`

`ChatQueue::queue_clear` · theorem · #4 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 5, item := 0, index := 0, owner := 0, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (nil Nat)})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_complete`

`ChatQueue::queue_complete` · theorem · #5 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 11, owner := 7, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 10, item := 11, index := 0, owner := 7, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 12 (cons 13 (nil Nat)))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_duplicate`

`ChatQueue::queue_duplicate` · theorem · #6 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 1, item := 12, index := 0, owner := 0, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queueItemDuplicate)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_edit`

`ChatQueue::queue_edit` · theorem · #7 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 4, item := 12, index := 0, owner := 0, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_enqueue`

`ChatQueue::queue_enqueue` · theorem · #8 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 1, item := 14, index := 0, owner := 0, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (cons 14 (nil Nat)))))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_exhaustedRevision`

`ChatQueue::queue_exhaustedRevision` · theorem · #9 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 4294967295, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 4294967295 (record QueueCommand {kind := 6, item := 0, index := 0, owner := 0, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queueRevisionExhausted)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_fail`

`ChatQueue::queue_fail` · theorem · #10 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 11, owner := 7, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 12, item := 0, index := 0, owner := 7, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 1, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_invalidCommand`

`ChatQueue::queue_invalidCommand` · theorem · #11 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 6, item := 1, index := 0, owner := 0, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.invalidQueueCommand)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_invalidState`

`ChatQueue::queue_invalidState` · theorem · #12 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 12, owner := 7, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 6, item := 0, index := 0, owner := 0, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.invalidQueueState)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_missing`

`ChatQueue::queue_missing` · theorem · #13 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 2, item := 99, index := 0, owner := 0, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queueItemMissing)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_pause`

`ChatQueue::queue_pause` · theorem · #14 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 6, item := 0, index := 0, owner := 0, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 1, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_pausedClaim`

`ChatQueue::queue_pausedClaim` · theorem · #15 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 1, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 9, item := 0, index := 0, owner := 7, observedStop := 2})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queuePaused)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_recover`

`ChatQueue::queue_recover` · theorem · #16 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 11, owner := 7, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 11, item := 0, index := 0, owner := 8, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 1, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_remove`

`ChatQueue::queue_remove` · theorem · #17 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 2, item := 12, index := 0, owner := 0, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 13 (nil Nat)))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_reorder`

`ChatQueue::queue_reorder` · theorem · #18 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 3, item := 13, index := 0, owner := 0, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 13 (cons 11 (cons 12 (nil Nat))))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_resume`

`ChatQueue::queue_resume` · theorem · #19 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 1, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 7, item := 0, index := 0, owner := 0, observedStop := 2})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_staleResume`

`ChatQueue::queue_staleResume` · theorem · #20 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 1, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 7, item := 0, index := 0, owner := 0, observedStop := 1})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queueStopConflict)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_staleRevision`

`ChatQueue::queue_staleRevision` · theorem · #21 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 2 (record QueueCommand {kind := 6, item := 0, index := 0, owner := 0, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queueRevisionConflict)))`
- proof: `reflexivity`

Taught by: behavior

### `queue_stop`

`ChatQueue::queue_stop` · theorem · #22 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 8, item := 0, index := 0, owner := 0, observedStop := 0})) = (ctor Result.ok [QueueState, QueueError] (record QueueState {revision := 4, paused := 1, stopPolicy := 3, active := 0, owner := 0, items := (cons 11 (cons 12 (cons 13 (nil Nat))))})))`
- proof: `reflexivity`

Taught by: behavior

### `queue_wrongOwner`

`ChatQueue::queue_wrongOwner` · theorem · #23 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueue.lex.tex)

- statement: `((transitionQueue (record QueueState {revision := 3, paused := 0, stopPolicy := 2, active := 11, owner := 7, items := (cons 11 (cons 12 (cons 13 (nil Nat))))}) 3 (record QueueCommand {kind := 10, item := 11, index := 0, owner := 8, observedStop := 0})) = (ctor Result.error [QueueState, QueueError] (ctor QueueError.queueOwnerConflict)))`
- proof: `reflexivity`

Taught by: behavior

**ChatQueueProtocol: 8 records**

### `wire_clear`

`ChatQueueProtocol::wire_clear` · theorem · #24 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueueProtocol.lex.tex)

- statement: `((dispatchQueueWords (cons 1 (cons 3 (cons 0 (cons 2 (cons 0 (cons 0 (cons 3 (cons 11 (cons 12 (cons 13 (cons 3 (cons 5 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat)))))))))))))))))) = 0x6f6b203031303030303030303430303030303030303030303030303032303030303030303030303030303030303030303030303030303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `wire_edit`

`ChatQueueProtocol::wire_edit` · theorem · #25 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueueProtocol.lex.tex)

- statement: `((dispatchQueueWords (cons 1 (cons 3 (cons 0 (cons 2 (cons 0 (cons 0 (cons 3 (cons 11 (cons 12 (cons 13 (cons 3 (cons 4 (cons 12 (cons 0 (cons 0 (cons 0 (nil Nat)))))))))))))))))) = 0x6f6b203031303030303030303430303030303030303030303030303032303030303030303030303030303030303030303030303033303030303030306230303030303030633030303030303064303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `wire_empty`

`ChatQueueProtocol::wire_empty` · theorem · #26 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueueProtocol.lex.tex)

- statement: `((dispatchQueue 0x) = 0x6d616c666f726d6564517565756552657175657374)`
- proof: `reflexivity`

Taught by: behavior

### `wire_enqueue`

`ChatQueueProtocol::wire_enqueue` · theorem · #27 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueueProtocol.lex.tex)

- statement: `((dispatchQueueWords (cons 1 (cons 3 (cons 0 (cons 2 (cons 0 (cons 0 (cons 3 (cons 11 (cons 12 (cons 13 (cons 3 (cons 1 (cons 14 (cons 0 (cons 0 (cons 0 (nil Nat)))))))))))))))))) = 0x6f6b2030313030303030303034303030303030303030303030303030323030303030303030303030303030303030303030303030343030303030303062303030303030306330303030303030643030303030303065303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `wire_pause`

`ChatQueueProtocol::wire_pause` · theorem · #28 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueueProtocol.lex.tex)

- statement: `((dispatchQueueWords (cons 1 (cons 3 (cons 0 (cons 2 (cons 0 (cons 0 (cons 3 (cons 11 (cons 12 (cons 13 (cons 3 (cons 6 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat)))))))))))))))))) = 0x6f6b203031303030303030303430303030303030313030303030303032303030303030303030303030303030303030303030303033303030303030306230303030303030633030303030303064303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `wire_remove`

`ChatQueueProtocol::wire_remove` · theorem · #29 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueueProtocol.lex.tex)

- statement: `((dispatchQueueWords (cons 1 (cons 3 (cons 0 (cons 2 (cons 0 (cons 0 (cons 3 (cons 11 (cons 12 (cons 13 (cons 3 (cons 2 (cons 12 (cons 0 (cons 0 (cons 0 (nil Nat)))))))))))))))))) = 0x6f6b20303130303030303030343030303030303030303030303030303230303030303030303030303030303030303030303030303230303030303030623030303030303064303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `wire_reorder`

`ChatQueueProtocol::wire_reorder` · theorem · #30 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueueProtocol.lex.tex)

- statement: `((dispatchQueueWords (cons 1 (cons 3 (cons 0 (cons 2 (cons 0 (cons 0 (cons 3 (cons 11 (cons 12 (cons 13 (cons 3 (cons 3 (cons 13 (cons 0 (cons 0 (cons 0 (nil Nat)))))))))))))))))) = 0x6f6b203031303030303030303430303030303030303030303030303032303030303030303030303030303030303030303030303033303030303030306430303030303030623030303030303063303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `wire_trailing`

`ChatQueueProtocol::wire_trailing` · theorem · #31 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ChatQueueProtocol.lex.tex)

- statement: `((dispatchQueue 0x30313030303030303033303030303030303030303030303030323030303030303030303030303030303030303030303030333030303030303062303030303030306330303030303030643030303030303033303030303030303130303030303030653030303030303030303030303030303030303030303030303030303030303030303030303030) = 0x6d616c666f726d6564517565756552657175657374)`
- proof: `reflexivity`

Taught by: behavior

**EventAdmission: 24 records**

### `bytesEventAdmitted`

`EventAdmission::bytesEventAdmitted` · theorem · #32 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 2, maximumBytes := 2, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.bytes (cons 0 (cons 255 (nil Nat))))})) = (ctor Result.ok [Nat, EventError] 3))`
- proof: `reflexivity`

Taught by: behavior

### `duplicateRouteRefused`

`EventAdmission::duplicateRouteRefused` · theorem · #33 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef))), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidEventContract)))`
- proof: `reflexivity`

Taught by: behavior

### `emptyBytesAdmitted`

`EventAdmission::emptyBytesAdmitted` · theorem · #34 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 2, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.bytes (nil Nat))})) = (ctor Result.ok [Nat, EventError] 3))`
- proof: `reflexivity`

Taught by: behavior

### `exhaustedSequenceRefused`

`EventAdmission::exhaustedSequenceRefused` · theorem · #35 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 4294967295 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 4294967295, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidEventContext)))`
- proof: `reflexivity`

Taught by: behavior

### `flagEventAdmitted`

`EventAdmission::flagEventAdmitted` · theorem · #36 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 1, maximumBytes := 1, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.flag false)})) = (ctor Result.ok [Nat, EventError] 3))`
- proof: `reflexivity`

Taught by: behavior

### `futureSequenceRefused`

`EventAdmission::futureSequenceRefused` · theorem · #37 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 3, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.staleSequence)))`
- proof: `reflexivity`

Taught by: behavior

### `invalidByteRefused`

`EventAdmission::invalidByteRefused` · theorem · #38 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 2, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.bytes (cons 256 (nil Nat)))})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidPayload)))`
- proof: `reflexivity`

Taught by: behavior

### `invalidContractRefused`

`EventAdmission::invalidContractRefused` · theorem · #39 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 0, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidEventContract)))`
- proof: `reflexivity`

Taught by: behavior

### `lastSequenceAdmitted`

`EventAdmission::lastSequenceAdmitted` · theorem · #40 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 4294967294 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 4294967294, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.ok [Nat, EventError] 4294967295))`
- proof: `reflexivity`

Taught by: behavior

### `missingRouteFeatureRefused`

`EventAdmission::missingRouteFeatureRefused` · theorem · #41 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 3, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidEventContract)))`
- proof: `reflexivity`

Taught by: behavior

### `naturalEventAdmitted`

`EventAdmission::naturalEventAdmitted` · theorem · #42 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.ok [Nat, EventError] 3))`
- proof: `reflexivity`

Taught by: behavior

### `oversizedNaturalRefused`

`EventAdmission::oversizedNaturalRefused` · theorem · #43 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 4294967296)})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidPayload)))`
- proof: `reflexivity`

Taught by: behavior

### `oversizedPayloadRefused`

`EventAdmission::oversizedPayloadRefused` · theorem · #44 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 2, maximumBytes := 1, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.bytes (cons 0 (cons 1 (nil Nat))))})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidPayload)))`
- proof: `reflexivity`

Taught by: behavior

### `replayedSequenceRefused`

`EventAdmission::replayedSequenceRefused` · theorem · #45 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 1, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.staleSequence)))`
- proof: `reflexivity`

Taught by: behavior

### `revokedPermissionRefused`

`EventAdmission::revokedPermissionRefused` · theorem · #46 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.compositionRejected (ctor FeatureComposition::CompositionError.permissionDenied))))`
- proof: `reflexivity`

Taught by: behavior

### `staleGenerationRefused`

`EventAdmission::staleGenerationRefused` · theorem · #47 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 2, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.staleGeneration)))`
- proof: `reflexivity`

Taught by: behavior

### `undeclaredFeatureEventRefused`

`EventAdmission::undeclaredFeatureEventRefused` · theorem · #48 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (record FeatureComposition::FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureComposition::FeatureInput), outputs := (nil Nat), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (cons 9 (nil Nat)), needs := (nil FeatureComposition::FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (nil Nat), quality := (nil Nat), cpu := 1, memory := 1}) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidEventContract)))`
- proof: `reflexivity`

Taught by: behavior

### `wrongConsumerRefused`

`EventAdmission::wrongConsumerRefused` · theorem · #49 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.undeclaredRoute)))`
- proof: `reflexivity`

Taught by: behavior

### `wrongEventKeyRefused`

`EventAdmission::wrongEventKeyRefused` · theorem · #50 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 8, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.wrongEvent)))`
- proof: `reflexivity`

Taught by: behavior

### `wrongEventVersionRefused`

`EventAdmission::wrongEventVersionRefused` · theorem · #51 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 2, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.wrongEvent)))`
- proof: `reflexivity`

Taught by: behavior

### `wrongFeatureVersionRefused`

`EventAdmission::wrongFeatureVersionRefused` · theorem · #52 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 2}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.undeclaredRoute)))`
- proof: `reflexivity`

Taught by: behavior

### `wrongPayloadKindRefused`

`EventAdmission::wrongPayloadKindRefused` · theorem · #53 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.flag true)})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidPayload)))`
- proof: `reflexivity`

Taught by: behavior

### `wrongProducerRefused`

`EventAdmission::wrongProducerRefused` · theorem · #54 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 3 2 (record EventEnvelope {key := 7, version := 1, generation := 3, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.undeclaredRoute)))`
- proof: `reflexivity`

Taught by: behavior

### `zeroGenerationRefused`

`EventAdmission::zeroGenerationRefused` · theorem · #55 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventAdmission.lex.tex)

- statement: `((admitEvent (cons (eventFixture1) (cons (eventFixture2) (nil FeatureComposition::FeatureContract))) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 2, memory := 2}) (record EventContract {key := 7, version := 1, kind := 0, maximumBytes := 4, producers := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), consumers := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))}) 0 2 (record EventEnvelope {key := 7, version := 1, generation := 0, sequence := 2, producer := (record FeatureComposition::FeatureRef {key := 1, version := 1}), consumer := (record FeatureComposition::FeatureRef {key := 2, version := 1}), payload := (ctor EventPayload.natural 42)})) = (ctor Result.error [Nat, EventError] (ctor EventError.invalidEventContext)))`
- proof: `reflexivity`

Taught by: behavior

**EventProtocol: 5 records**

### `wire_flag`

`EventProtocol::wire_flag` · theorem · #56 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventProtocol.lex.tex)

- statement: `((dispatchEvent 0x3032303030303030303230303030303030313030303030303039303030303030303130303030303030313030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030303030303030303030303030303030303130303030303030373030303030303030303030303030303130303030303030393030303030303030303030303030303130303030303030313030303030303030303030303030303030303030303030303030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303037303030303030303130303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030323030303030303031303030303030303330303030303030323030303030303037303030303030303130303030303030333030303030303032303030303030303130303030303030313030303030303032303030303030303130303030303030313030303030303030303030303030) = 0x6f6b203033303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `wire_natural`

`EventProtocol::wire_natural` · theorem · #57 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventProtocol.lex.tex)

- statement: `((dispatchEvent 0x3032303030303030303230303030303030313030303030303039303030303030303130303030303030313030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030303030303030303030303030303030303130303030303030373030303030303030303030303030303130303030303030393030303030303030303030303030303130303030303030313030303030303030303030303030303030303030303030303030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303037303030303030303130303030303030303030303030303034303030303030303130303030303030313030303030303031303030303030303130303030303030323030303030303031303030303030303330303030303030323030303030303037303030303030303130303030303030333030303030303032303030303030303130303030303030313030303030303032303030303030303130303030303030303030303030303261303030303030) = 0x6f6b203033303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `wire_revoked`

`EventProtocol::wire_revoked` · theorem · #58 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventProtocol.lex.tex)

- statement: `((dispatchEvent 0x303230303030303030323030303030303030303030303030303130303030303030313030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030303030303030303030303030303030303130303030303030373030303030303030303030303030303130303030303030393030303030303030303030303030303130303030303030313030303030303030303030303030303030303030303030303030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303037303030303030303130303030303030303030303030303034303030303030303130303030303030313030303030303031303030303030303130303030303030323030303030303031303030303030303330303030303030323030303030303037303030303030303130303030303030333030303030303032303030303030303130303030303030313030303030303032303030303030303130303030303030303030303030303261303030303030) = 0x636f6d706f736974696f6e52656a65637465643a7065726d697373696f6e44656e696564)`
- proof: `reflexivity`

Taught by: behavior

### `wire_staleGeneration`

`EventProtocol::wire_staleGeneration` · theorem · #59 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventProtocol.lex.tex)

- statement: `((dispatchEvent 0x3032303030303030303230303030303030313030303030303039303030303030303130303030303030313030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030303030303030303030303030303030303130303030303030373030303030303030303030303030303130303030303030393030303030303030303030303030303130303030303030313030303030303030303030303030303030303030303030303030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303037303030303030303130303030303030303030303030303034303030303030303130303030303030313030303030303031303030303030303130303030303030323030303030303031303030303030303330303030303030323030303030303037303030303030303130303030303030323030303030303032303030303030303130303030303030313030303030303032303030303030303130303030303030303030303030303261303030303030) = 0x7374616c6547656e65726174696f6e)`
- proof: `reflexivity`

Taught by: behavior

### `wire_trailing`

`EventProtocol::wire_trailing` · theorem · #60 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/EventProtocol.lex.tex)

- statement: `((dispatchEvent 0x30323030303030303032303030303030303130303030303030393030303030303031303030303030303130303030303030303030303030303032303030303030303130303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303032303030303030303130303030303030313030303030303031303030303030303130303030303030313030303030303030303030303030303030303030303030313030303030303037303030303030303030303030303030313030303030303039303030303030303030303030303030313030303030303031303030303030303030303030303030303030303030303030303030303030303030303030303030373030303030303031303030303030303030303030303030343030303030303031303030303030303130303030303030313030303030303031303030303030303230303030303030313030303030303033303030303030303230303030303030373030303030303031303030303030303330303030303030323030303030303031303030303030303130303030303030323030303030303031303030303030303030303030303032613030303030303030303030303030) = 0x6d616c666f726d65644576656e74)`
- proof: `reflexivity`

Taught by: behavior

**FeatureComposition: 18 records**

### `cpuRefused`

`FeatureComposition::cpuRefused` · theorem · #61 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 3, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (cons (record FeatureContract {key := 2, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (cons (record FeatureInput {producer := (record FeatureRef {key := 1, version := 1}), schema := 7}) (nil FeatureInput)), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (cons (record FeatureRef {key := 1, version := 1}) (nil FeatureRef)), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract)))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.budgetExceeded)))`
- proof: `reflexivity`

Taught by: behavior

### `dependencyAdmitted`

`FeatureComposition::dependencyAdmitted` · theorem · #62 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (cons (record FeatureContract {key := 2, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (cons (record FeatureInput {producer := (record FeatureRef {key := 1, version := 1}), schema := 7}) (nil FeatureInput)), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (cons (record FeatureRef {key := 1, version := 1}) (nil FeatureRef)), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract)))) = (ctor Result.ok [Bool, CompositionError] true))`
- proof: `reflexivity`

Taught by: behavior

### `duplicateIdentityRefused`

`FeatureComposition::duplicateIdentityRefused` · theorem · #63 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (cons (record FeatureContract {key := 1, version := 2, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract)))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.duplicateFeature)))`
- proof: `reflexivity`

Taught by: behavior

### `emptyRefused`

`FeatureComposition::emptyRefused` · theorem · #64 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (nil FeatureContract)) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.emptyComposition)))`
- proof: `reflexivity`

Taught by: behavior

### `emptyVocabularyRefused`

`FeatureComposition::emptyVocabularyRefused` · theorem · #65 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (nil Nat), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.invalidDeclaration)))`
- proof: `reflexivity`

Taught by: behavior

### `evidenceRefused`

`FeatureComposition::evidenceRefused` · theorem · #66 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (nil Nat)), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.missingEvidence)))`
- proof: `reflexivity`

Taught by: behavior

### `forwardDependencyRefused`

`FeatureComposition::forwardDependencyRefused` · theorem · #67 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 2, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (cons (record FeatureInput {producer := (record FeatureRef {key := 1, version := 1}), schema := 7}) (nil FeatureInput)), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (cons (record FeatureRef {key := 1, version := 1}) (nil FeatureRef)), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract)))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.missingDependency)))`
- proof: `reflexivity`

Taught by: behavior

### `incompatibleInputRefused`

`FeatureComposition::incompatibleInputRefused` · theorem · #68 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 8 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (cons (record FeatureContract {key := 2, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (cons (record FeatureInput {producer := (record FeatureRef {key := 1, version := 1}), schema := 7}) (nil FeatureInput)), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (cons (record FeatureRef {key := 1, version := 1}) (nil FeatureRef)), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract)))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.incompatibleInput)))`
- proof: `reflexivity`

Taught by: behavior

### `memoryRefused`

`FeatureComposition::memoryRefused` · theorem · #69 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 5}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (cons (record FeatureContract {key := 2, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (cons (record FeatureInput {producer := (record FeatureRef {key := 1, version := 1}), schema := 7}) (nil FeatureInput)), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (cons (record FeatureRef {key := 1, version := 1}) (nil FeatureRef)), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract)))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.budgetExceeded)))`
- proof: `reflexivity`

Taught by: behavior

### `missingDependencyRefused`

`FeatureComposition::missingDependencyRefused` · theorem · #70 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 2, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (cons (record FeatureInput {producer := (record FeatureRef {key := 1, version := 1}), schema := 7}) (nil FeatureInput)), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (cons (record FeatureRef {key := 1, version := 1}) (nil FeatureRef)), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.missingDependency)))`
- proof: `reflexivity`

Taught by: behavior

### `newConflictRefused`

`FeatureComposition::newConflictRefused` · theorem · #71 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (cons (record FeatureContract {key := 2, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (cons 1 (nil Nat)), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract)))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.featureConflict)))`
- proof: `reflexivity`

Taught by: behavior

### `permissionRefused`

`FeatureComposition::permissionRefused` · theorem · #72 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (cons 6 (nil Nat)), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.permissionDenied)))`
- proof: `reflexivity`

Taught by: behavior

### `priorConflictRefused`

`FeatureComposition::priorConflictRefused` · theorem · #73 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (cons 2 (nil Nat)), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (cons (record FeatureContract {key := 2, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract)))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.featureConflict)))`
- proof: `reflexivity`

Taught by: behavior

### `singleAdmitted`

`FeatureComposition::singleAdmitted` · theorem · #74 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract))) = (ctor Result.ok [Bool, CompositionError] true))`
- proof: `reflexivity`

Taught by: behavior

### `targetRefused`

`FeatureComposition::targetRefused` · theorem · #75 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 2 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.unsupportedTarget)))`
- proof: `reflexivity`

Taught by: behavior

### `wrongVersionRefused`

`FeatureComposition::wrongVersionRefused` · theorem · #76 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 2, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (cons (record FeatureContract {key := 2, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (cons (record FeatureInput {producer := (record FeatureRef {key := 1, version := 1}), schema := 7}) (nil FeatureInput)), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (cons (record FeatureRef {key := 1, version := 1}) (nil FeatureRef)), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract)))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.missingDependency)))`
- proof: `reflexivity`

Taught by: behavior

### `zeroIdentityRefused`

`FeatureComposition::zeroIdentityRefused` · theorem · #77 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 0, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.invalidDeclaration)))`
- proof: `reflexivity`

Taught by: behavior

### `zeroVersionRefused`

`FeatureComposition::zeroVersionRefused` · theorem · #78 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FeatureComposition.lex.tex)

- statement: `((admitComposition (record CompositionPolicy {grants := (cons 5 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (cons 10 (cons 11 (nil Nat))), cpu := 4, memory := 6}) (cons (record FeatureContract {key := 1, version := 0, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (cons 10 (nil Nat)), quality := (cons 11 (nil Nat)), cpu := 2, memory := 3}) (nil FeatureContract))) = (ctor Result.error [Bool, CompositionError] (ctor CompositionError.invalidDeclaration)))`
- proof: `reflexivity`

Taught by: behavior

**ForgeKernelProofs: 27 records**

### `budgetOverWithinHolds`

`ForgeKernelProofs::budgetOverWithinHolds` · theorem · #80 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksBudgetOverWithin request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `budgetWithinOverHolds`

`ForgeKernelProofs::budgetWithinOverHolds` · theorem · #81 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksBudgetWithinOver request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `builtBudgetBoundHolds`

`ForgeKernelProofs::builtBudgetBoundHolds` · theorem · #82 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksBuiltBudgetBound request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `denyWinsHolds`

`ForgeKernelProofs::denyWinsHolds` · theorem · #83 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksGateDenyWins request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `editBudgetBoundHolds`

`ForgeKernelProofs::editBudgetBoundHolds` · theorem · #84 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksEditBudgetBound request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `firstThinkHolds`

`ForgeKernelProofs::firstThinkHolds` · theorem · #85 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksFirstThink request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `inpBudgetBoundHolds`

`ForgeKernelProofs::inpBudgetBoundHolds` · theorem · #86 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksInpBudgetBound request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `inv001Holds`

`ForgeKernelProofs::inv001Holds` · theorem · #87 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksInv001 request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `inv002Holds`

`ForgeKernelProofs::inv002Holds` · theorem · #88 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksInv002 request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `inv003Holds`

`ForgeKernelProofs::inv003Holds` · theorem · #89 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksInv003 request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `inv004Holds`

`ForgeKernelProofs::inv004Holds` · theorem · #90 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksInv004 request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `longMotionHolds`

`ForgeKernelProofs::longMotionHolds` · theorem · #91 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksLongMotion request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `narrowSplitHolds`

`ForgeKernelProofs::narrowSplitHolds` · theorem · #92 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksNarrowSplit request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `noRecordNoFetchHolds`

`ForgeKernelProofs::noRecordNoFetchHolds` · theorem · #93 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksGateNoRecordNoFetch request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `noRecordOnlyForgeHolds`

`ForgeKernelProofs::noRecordOnlyForgeHolds` · theorem · #94 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksGateNoRecordOnlyForge request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `oldRecentHolds`

`ForgeKernelProofs::oldRecentHolds` · theorem · #95 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksOldRecent request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `outsideForgeNeedsGrantHolds`

`ForgeKernelProofs::outsideForgeNeedsGrantHolds` · theorem · #96 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksGateOutsideForgeNeedsGrant request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `previewNoNetworkWithoutGrantHolds`

`ForgeKernelProofs::previewNoNetworkWithoutGrantHolds` · theorem · #97 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksGatePreviewNoNetworkWithoutGrant request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `reducedMotionHolds`

`ForgeKernelProofs::reducedMotionHolds` · theorem · #98 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksReducedMotion request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `rewordKeepsProofHolds`

`ForgeKernelProofs::rewordKeepsProofHolds` · theorem · #99 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksRewordKeepsProof request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `rewordKeepsPublishedHolds`

`ForgeKernelProofs::rewordKeepsPublishedHolds` · theorem · #100 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksRewordKeepsPublished request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `routeBelowFirstLoadHolds`

`ForgeKernelProofs::routeBelowFirstLoadHolds` · theorem · #101 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksRouteBelowFirstLoad request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `smallTargetHolds`

`ForgeKernelProofs::smallTargetHolds` · theorem · #102 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksSmallTarget request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `telemetryEgressHolds`

`ForgeKernelProofs::telemetryEgressHolds` · theorem · #103 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksTelemetryEgress request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `telemetryOffDeviceHolds`

`ForgeKernelProofs::telemetryOffDeviceHolds` · theorem · #104 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksTelemetryOffDevice request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `telemetryUnaskedHolds`

`ForgeKernelProofs::telemetryUnaskedHolds` · theorem · #105 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksTelemetryUnasked request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

### `wideTabsHolds`

`ForgeKernelProofs::wideTabsHolds` · theorem · #106 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ForgeKernelProofs.lex.tex)

- statement: `((breaksWideTabs request) = false)`
- proof: `linear_arithmetic`

Taught by: behavior

**FoundrySpecification: 7 records**

### `checkedExternalBoundary`

`FoundrySpecification::checkedExternalBoundary` · theorem · #107 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FoundrySpecification.lex.tex)

- statement: `((admitAuthority (ctor Ownership.external 1 true)) = (ctor Result.ok [Bool, AuthorityError] true))`
- proof: `reflexivity`

Taught by: behavior

### `competingExternalOwners`

`FoundrySpecification::competingExternalOwners` · theorem · #108 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FoundrySpecification.lex.tex)

- statement: `((admitAuthority (ctor Ownership.external 2 true)) = (ctor Result.error [Bool, AuthorityError] (ctor AuthorityError.competingOwners)))`
- proof: `reflexivity`

Taught by: behavior

### `competingProductOwners`

`FoundrySpecification::competingProductOwners` · theorem · #109 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FoundrySpecification.lex.tex)

- statement: `((admitAuthority (ctor Ownership.product 2)) = (ctor Result.error [Bool, AuthorityError] (ctor AuthorityError.competingOwners)))`
- proof: `reflexivity`

Taught by: behavior

### `missingExternalOwner`

`FoundrySpecification::missingExternalOwner` · theorem · #110 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FoundrySpecification.lex.tex)

- statement: `((admitAuthority (ctor Ownership.external 0 true)) = (ctor Result.error [Bool, AuthorityError] (ctor AuthorityError.missingOwner)))`
- proof: `reflexivity`

Taught by: behavior

### `missingProductOwner`

`FoundrySpecification::missingProductOwner` · theorem · #111 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FoundrySpecification.lex.tex)

- statement: `((admitAuthority (ctor Ownership.product 0)) = (ctor Result.error [Bool, AuthorityError] (ctor AuthorityError.missingOwner)))`
- proof: `reflexivity`

Taught by: behavior

### `oneProductOwner`

`FoundrySpecification::oneProductOwner` · theorem · #112 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FoundrySpecification.lex.tex)

- statement: `((admitAuthority (ctor Ownership.product 1)) = (ctor Result.ok [Bool, AuthorityError] true))`
- proof: `reflexivity`

Taught by: behavior

### `uncheckedExternalBoundary`

`FoundrySpecification::uncheckedExternalBoundary` · theorem · #113 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/FoundrySpecification.lex.tex)

- statement: `((admitAuthority (ctor Ownership.external 1 false)) = (ctor Result.error [Bool, AuthorityError] (ctor AuthorityError.uncheckedBoundary)))`
- proof: `reflexivity`

Taught by: behavior

**InteractionModel: 12 records**

### `interactionBackward`

`InteractionModel::interactionBackward` · theorem · #114 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((interactionStep (interactionExample) 1 2 false true) = (ctor Result.ok [InteractionOutput, InteractionError] (record InteractionOutput {state := 0, screen := 0, palette := 2, tone := 0, motion := 0})))`
- proof: `reflexivity`

Taught by: behavior

### `interactionBadDestination`

`InteractionModel::interactionBadDestination` · theorem · #115 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((interactionStep (record InteractionProfile {version := 1, initial := 0, screens := 2, frames := (cons (record InteractionFrame {screen := 0, palette := 2, tone := 220, motion := 10}) (cons (record InteractionFrame {screen := 1, palette := 3, tone := 440, motion := 20}) (nil InteractionFrame))), edges := (cons (record InteractionEdge {origin := 0, event := 1, destination := 2}) (nil InteractionEdge))}) 0 0 false false) = (ctor Result.error [InteractionOutput, InteractionError] (ctor InteractionError.invalidInteractionModel)))`
- proof: `reflexivity`

Taught by: behavior

### `interactionBadState`

`InteractionModel::interactionBadState` · theorem · #116 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((interactionStep (interactionExample) 2 1 false false) = (ctor Result.error [InteractionOutput, InteractionError] (ctor InteractionError.invalidInteractionState)))`
- proof: `reflexivity`

Taught by: behavior

### `interactionCurrent`

`InteractionModel::interactionCurrent` · theorem · #117 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((interactionStep (interactionExample) 0 0 false false) = (ctor Result.ok [InteractionOutput, InteractionError] (record InteractionOutput {state := 0, screen := 0, palette := 2, tone := 0, motion := 10})))`
- proof: `reflexivity`

Taught by: behavior

### `interactionDuplicateRoute`

`InteractionModel::interactionDuplicateRoute` · theorem · #118 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((interactionStep (record InteractionProfile {version := 1, initial := 0, screens := 2, frames := (cons (record InteractionFrame {screen := 0, palette := 2, tone := 220, motion := 10}) (cons (record InteractionFrame {screen := 1, palette := 3, tone := 440, motion := 20}) (nil InteractionFrame))), edges := (cons (record InteractionEdge {origin := 0, event := 1, destination := 1}) (cons (record InteractionEdge {origin := 0, event := 1, destination := 1}) (nil InteractionEdge)))}) 0 0 false false) = (ctor Result.error [InteractionOutput, InteractionError] (ctor InteractionError.invalidInteractionModel)))`
- proof: `reflexivity`

Taught by: behavior

### `interactionEmptyFrames`

`InteractionModel::interactionEmptyFrames` · theorem · #119 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((interactionStep (record InteractionProfile {version := 1, initial := 0, screens := 2, frames := (nil InteractionFrame), edges := (cons (record InteractionEdge {origin := 0, event := 1, destination := 1}) (cons (record InteractionEdge {origin := 1, event := 2, destination := 0}) (nil InteractionEdge)))}) 0 0 false false) = (ctor Result.error [InteractionOutput, InteractionError] (ctor InteractionError.invalidInteractionModel)))`
- proof: `reflexivity`

Taught by: behavior

### `interactionForward`

`InteractionModel::interactionForward` · theorem · #120 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((interactionStep (interactionExample) 0 1 true false) = (ctor Result.ok [InteractionOutput, InteractionError] (record InteractionOutput {state := 1, screen := 1, palette := 3, tone := 440, motion := 20})))`
- proof: `reflexivity`

Taught by: behavior

### `interactionMissingRoute`

`InteractionModel::interactionMissingRoute` · theorem · #121 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((interactionStep (interactionExample) 0 2 false false) = (ctor Result.error [InteractionOutput, InteractionError] (ctor InteractionError.unknownInteractionEvent)))`
- proof: `reflexivity`

Taught by: behavior

### `interactionOutputState`

`InteractionModel::interactionOutputState` · theorem · #122 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((project (interactionProject frame state audioGranted reducedMotion) state) = state)`
- proof: `reflexivity`

Taught by: behavior

### `interactionReducedMotionStatic`

`InteractionModel::interactionReducedMotionStatic` · theorem · #123 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((project (interactionProject frame state audioGranted true) motion) = 0)`
- proof: `reflexivity`

Taught by: behavior

### `interactionSilentWithoutConsent`

`InteractionModel::interactionSilentWithoutConsent` · theorem · #124 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((project (interactionProject frame state false reducedMotion) tone) = 0)`
- proof: `reflexivity`

Taught by: behavior

### `interactionWrongVersion`

`InteractionModel::interactionWrongVersion` · theorem · #125 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionModel.lex.tex)

- statement: `((interactionStep (record InteractionProfile {version := 2, initial := 0, screens := 2, frames := (cons (record InteractionFrame {screen := 0, palette := 2, tone := 220, motion := 10}) (cons (record InteractionFrame {screen := 1, palette := 3, tone := 440, motion := 20}) (nil InteractionFrame))), edges := (cons (record InteractionEdge {origin := 0, event := 1, destination := 1}) (cons (record InteractionEdge {origin := 1, event := 2, destination := 0}) (nil InteractionEdge)))}) 0 0 false false) = (ctor Result.error [InteractionOutput, InteractionError] (ctor InteractionError.invalidInteractionModel)))`
- proof: `reflexivity`

Taught by: behavior

**InteractionProtocol: 8 records**

### `interactionWire_empty`

`InteractionProtocol::interactionWire_empty` · theorem · #126 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionProtocol.lex.tex)

- statement: `((dispatchInteraction 0x) = 0x6d616c666f726d6564496e746572616374696f6e)`
- proof: `reflexivity`

Taught by: behavior

### `interactionWire_trailing`

`InteractionProtocol::interactionWire_trailing` · theorem · #127 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionProtocol.lex.tex)

- statement: `((dispatchInteraction 0x303130303030303030303030303030303032303030303030303230303030303030303030303030303030303030303030303030303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303230303030303030303030303030303031303030303030303130303030303030313030303030303032303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030) = 0x6d616c666f726d6564496e746572616374696f6e)`
- proof: `reflexivity`

Taught by: behavior

### `interactionWords_duplicateRoute`

`InteractionProtocol::interactionWords_duplicateRoute` · theorem · #128 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionProtocol.lex.tex)

- statement: `((dispatchInteractionWords (cons 1 (cons 0 (cons 2 (cons 2 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 2 (cons 0 (cons 1 (cons 1 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))))))))))) = 0x696e76616c6964496e746572616374696f6e4d6f64656c)`
- proof: `reflexivity`

Taught by: behavior

### `interactionWords_galleryNext`

`InteractionProtocol::interactionWords_galleryNext` · theorem · #129 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionProtocol.lex.tex)

- statement: `((dispatchInteractionWords (cons 1 (cons 0 (cons 2 (cons 2 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 2 (cons 0 (cons 1 (cons 1 (cons 1 (cons 2 (cons 0 (cons 0 (cons 1 (cons 0 (cons 0 (nil Nat))))))))))))))))))))))))) = 0x6f6b2030313030303030303031303030303030303130303030303030303030303030303030303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `interactionWords_gardenAudio`

`InteractionProtocol::interactionWords_gardenAudio` · theorem · #130 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionProtocol.lex.tex)

- statement: `((dispatchInteractionWords (cons 1 (cons 0 (cons 2 (cons 2 (cons 0 (cons 2 (cons 220 (cons 10 (cons 1 (cons 3 (cons 440 (cons 20 (cons 2 (cons 0 (cons 1 (cons 1 (cons 1 (cons 2 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (nil Nat))))))))))))))))))))))))) = 0x6f6b2030313030303030303031303030303030303330303030303062383031303030303134303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `interactionWords_gardenReduced`

`InteractionProtocol::interactionWords_gardenReduced` · theorem · #131 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionProtocol.lex.tex)

- statement: `((dispatchInteractionWords (cons 1 (cons 0 (cons 2 (cons 2 (cons 0 (cons 2 (cons 220 (cons 10 (cons 1 (cons 3 (cons 440 (cons 20 (cons 2 (cons 0 (cons 1 (cons 1 (cons 1 (cons 2 (cons 0 (cons 0 (cons 1 (cons 1 (cons 1 (nil Nat))))))))))))))))))))))))) = 0x6f6b2030313030303030303031303030303030303330303030303062383031303030303030303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `interactionWords_gardenSilent`

`InteractionProtocol::interactionWords_gardenSilent` · theorem · #132 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionProtocol.lex.tex)

- statement: `((dispatchInteractionWords (cons 1 (cons 0 (cons 2 (cons 2 (cons 0 (cons 2 (cons 220 (cons 10 (cons 1 (cons 3 (cons 440 (cons 20 (cons 2 (cons 0 (cons 1 (cons 1 (cons 1 (cons 2 (cons 0 (cons 0 (cons 1 (cons 0 (cons 0 (nil Nat))))))))))))))))))))))))) = 0x6f6b2030313030303030303031303030303030303330303030303030303030303030303134303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `interactionWords_wrongVersion`

`InteractionProtocol::interactionWords_wrongVersion` · theorem · #133 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/InteractionProtocol.lex.tex)

- statement: `((dispatchInteractionWords (cons 2 (cons 0 (cons 2 (cons 2 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 2 (cons 0 (cons 1 (cons 1 (cons 1 (cons 2 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))))))))))) = 0x696e76616c6964496e746572616374696f6e4d6f64656c)`
- proof: `reflexivity`

Taught by: behavior

**ProposalAdmission: 21 records**

### `ambiguityRefused`

`ProposalAdmission::ambiguityRefused` · theorem · #134 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (cons 1 (nil Nat)), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.unresolvedAmbiguity)))`
- proof: `reflexivity`

Taught by: behavior

### `confidenceCannotGrantPermission`

`ProposalAdmission::confidenceCannotGrantPermission` · theorem · #135 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (record FeatureComposition::FeatureContract {key := 1, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureComposition::FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (cons 6 (nil Nat)), needs := (nil FeatureComposition::FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (nil Nat), quality := (nil Nat), cpu := 1, memory := 1}) (nil FeatureComposition::FeatureContract)) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 10000}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.permissionDenied))))`
- proof: `reflexivity`

Taught by: behavior

### `confidenceCannotIncreaseBudget`

`ProposalAdmission::confidenceCannotIncreaseBudget` · theorem · #136 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 10000}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 0, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.budgetExceeded))))`
- proof: `reflexivity`

Taught by: behavior

### `constraintRefused`

`ProposalAdmission::constraintRefused` · theorem · #137 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (cons 1 (nil Nat)), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.unresolvedConstraint)))`
- proof: `reflexivity`

Taught by: behavior

### `duplicateRegistryRefused`

`ProposalAdmission::duplicateRegistryRefused` · theorem · #138 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureOne) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.invalidRegistry)))`
- proof: `reflexivity`

Taught by: behavior

### `duplicateSelectionRefused`

`ProposalAdmission::duplicateSelectionRefused` · theorem · #139 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef))), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.duplicateFeature))))`
- proof: `reflexivity`

Taught by: behavior

### `emptySelectionRefused`

`ProposalAdmission::emptySelectionRefused` · theorem · #140 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (nil FeatureComposition::FeatureRef), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.emptyComposition))))`
- proof: `reflexivity`

Taught by: behavior

### `exactVersionSelected`

`ProposalAdmission::exactVersionSelected` · theorem · #141 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureOtherVersion) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 2}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.ok [(List FeatureComposition::FeatureContract), ProposalError] (cons (proposalFixtureOtherVersion) (nil FeatureComposition::FeatureContract))))`
- proof: `reflexivity`

Taught by: behavior

### `invalidConfidenceRefused`

`ProposalAdmission::invalidConfidenceRefused` · theorem · #142 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 10001}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.invalidProposal)))`
- proof: `reflexivity`

Taught by: behavior

### `malformedRegistryRefused`

`ProposalAdmission::malformedRegistryRefused` · theorem · #143 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (record FeatureComposition::FeatureContract {key := 0, version := 1, vocabulary := (cons 1 (nil Nat)), inputs := (nil FeatureComposition::FeatureInput), outputs := (cons 7 (nil Nat)), state := (nil Nat), events := (nil Nat), errors := (nil Nat), effects := (nil Nat), needs := (nil FeatureComposition::FeatureRef), conflicts := (nil Nat), targets := (cons 1 (nil Nat)), accessibility := (nil Nat), quality := (nil Nat), cpu := 1, memory := 1}) (nil FeatureComposition::FeatureContract)) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.invalidRegistry)))`
- proof: `reflexivity`

Taught by: behavior

### `maximumConfidenceAdmitted`

`ProposalAdmission::maximumConfidenceAdmitted` · theorem · #144 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 10000}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.ok [(List FeatureComposition::FeatureContract), ProposalError] (cons (proposalFixtureOne) (nil FeatureComposition::FeatureContract))))`
- proof: `reflexivity`

Taught by: behavior

### `missingDependencyRefused`

`ProposalAdmission::missingDependencyRefused` · theorem · #145 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.missingDependency))))`
- proof: `reflexivity`

Taught by: behavior

### `orderedDependenciesAdmitted`

`ProposalAdmission::orderedDependenciesAdmitted` · theorem · #146 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (nil FeatureComposition::FeatureRef))), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.ok [(List FeatureComposition::FeatureContract), ProposalError] (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract)))))`
- proof: `reflexivity`

Taught by: behavior

### `staleIntentRefused`

`ProposalAdmission::staleIntentRefused` · theorem · #147 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 8, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.staleIntent)))`
- proof: `reflexivity`

Taught by: behavior

### `staleRegistryRefused`

`ProposalAdmission::staleRegistryRefused` · theorem · #148 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 4, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.staleRegistry)))`
- proof: `reflexivity`

Taught by: behavior

### `unknownFeatureRefused`

`ProposalAdmission::unknownFeatureRefused` · theorem · #149 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 9, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.unregisteredFeature)))`
- proof: `reflexivity`

Taught by: behavior

### `wrongOrderRefused`

`ProposalAdmission::wrongOrderRefused` · theorem · #150 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 2, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef))), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.missingDependency))))`
- proof: `reflexivity`

Taught by: behavior

### `wrongVersionRefused`

`ProposalAdmission::wrongVersionRefused` · theorem · #151 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 2}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.unregisteredFeature)))`
- proof: `reflexivity`

Taught by: behavior

### `zeroConfidenceAdmitted`

`ProposalAdmission::zeroConfidenceAdmitted` · theorem · #152 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.ok [(List FeatureComposition::FeatureContract), ProposalError] (cons (proposalFixtureOne) (nil FeatureComposition::FeatureContract))))`
- proof: `reflexivity`

Taught by: behavior

### `zeroExpectedIntentRefused`

`ProposalAdmission::zeroExpectedIntentRefused` · theorem · #153 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 0 3 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.invalidProposal)))`
- proof: `reflexivity`

Taught by: behavior

### `zeroExpectedRevisionRefused`

`ProposalAdmission::zeroExpectedRevisionRefused` · theorem · #154 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/ProposalAdmission.lex.tex)

- statement: `((admitProposal (cons (proposalFixtureOne) (cons (proposalFixtureTwo) (nil FeatureComposition::FeatureContract))) 7 0 (record Proposal {intent := 7, registryRevision := 3, selected := (cons (record FeatureComposition::FeatureRef {key := 1, version := 1}) (nil FeatureComposition::FeatureRef)), ambiguities := (nil Nat), unresolved := (nil Nat), confidence := 0}) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 4, memory := 4})) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalError] (ctor ProposalError.invalidProposal)))`
- proof: `reflexivity`

Taught by: behavior

**RoutingProtocol: 8 records**

### `routingRaw_empty`

`RoutingProtocol::routingRaw_empty` · theorem · #155 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/RoutingProtocol.lex.tex)

- statement: `((dispatchRouting 0x) = 0x6d616c666f726d6564526f7574696e6752657175657374)`
- proof: `reflexivity`

Taught by: behavior

### `routingRaw_uppercase`

`RoutingProtocol::routingRaw_uppercase` · theorem · #156 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/RoutingProtocol.lex.tex)

- statement: `((dispatchRouting 0x4130303030303030) = 0x6d616c666f726d6564526f7574696e6752657175657374)`
- proof: `reflexivity`

Taught by: behavior

### `routingWords_ambiguity`

`RoutingProtocol::routingWords_ambiguity` · theorem · #157 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/RoutingProtocol.lex.tex)

- statement: `((dispatchRoutingWords (prim append (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 100 (cons 0 (cons 4 (cons 102 (cons 101 (cons 900 (cons 203 (cons 201 (cons 900 (cons 100 (nil Nat))))))))))))))))) (prim append (cons 101 (cons 500 (cons 100 (cons 201 (cons 500 (cons 100 (cons 100 (cons 1 (cons 9 (cons 1 (cons 1 (cons 0 (cons 5 (cons 10 (cons 1 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 1 (cons 900 (cons 1 (cons 7 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 11 (cons 1 (cons 2 (cons 1 (cons 1 (cons 101 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 0 (cons 1 (cons 10 (cons 1 (cons 7 (cons 14 (cons 1 (cons 1 (cons 1 (cons 1 (cons 901 (cons 1 (cons 8 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 9 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (cons 12 (cons 1 (cons 1 (cons 1 (cons 2 (cons 201 (cons 202 (nil Nat))))))))))))))))) (prim append (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 1 (cons 10 (cons 1 (cons 1 (cons 14 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 8 (cons 13 (cons 1 (cons 1 (cons 1 (cons 1 (cons 301 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (nil Nat))))))))))))))))) (cons 0 (cons 1 (cons 10 (cons 1 (cons 0 (nil Nat)))))) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat))) = 0x6f6b203031303030303030303530303030303030303030303030303031303030303030303130303030303030303030303030303032303030303030306230303030303030313030303030306634323566343030306330303030303030313030303030306634323566343030303230303030303030613030303030303031303030303030306230303030303030313030303030303032303030303030306230303030303030633030303030303030303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `routingWords_exactGallery`

`RoutingProtocol::routingWords_exactGallery` · theorem · #158 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/RoutingProtocol.lex.tex)

- statement: `((dispatchRoutingWords (prim append (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 101 (cons 0 (cons 4 (cons 102 (cons 101 (cons 900 (cons 203 (cons 201 (cons 900 (cons 100 (nil Nat))))))))))))))))) (prim append (cons 101 (cons 500 (cons 100 (cons 201 (cons 500 (cons 100 (cons 100 (cons 1 (cons 9 (cons 1 (cons 1 (cons 0 (cons 5 (cons 10 (cons 1 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 1 (cons 900 (cons 1 (cons 7 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 11 (cons 1 (cons 2 (cons 1 (cons 1 (cons 101 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 0 (cons 1 (cons 10 (cons 1 (cons 7 (cons 14 (cons 1 (cons 1 (cons 1 (cons 1 (cons 901 (cons 1 (cons 8 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 9 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (cons 12 (cons 1 (cons 1 (cons 1 (cons 2 (cons 201 (cons 202 (nil Nat))))))))))))))))) (prim append (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 1 (cons 10 (cons 1 (cons 1 (cons 14 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 8 (cons 13 (cons 1 (cons 1 (cons 1 (cons 1 (cons 301 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (nil Nat))))))))))))))))) (cons 0 (cons 1 (cons 10 (cons 1 (cons 0 (nil Nat)))))) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat))) = 0x6f6b2030313030303030303030303030303030303030303030303030313030303030303031303030303030303030303030303030313030303030303062303030303030303130303030303065383462653830313032303030303030306130303030303030313030303030303062303030303030303130303030303030303030303030303030303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `routingWords_forwardDependency`

`RoutingProtocol::routingWords_forwardDependency` · theorem · #159 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/RoutingProtocol.lex.tex)

- statement: `((dispatchRoutingWords (prim append (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 101 (cons 0 (cons 4 (cons 102 (cons 101 (cons 900 (cons 203 (cons 201 (cons 900 (cons 100 (nil Nat))))))))))))))))) (prim append (cons 101 (cons 500 (cons 100 (cons 201 (cons 500 (cons 100 (cons 100 (cons 1 (cons 9 (cons 1 (cons 1 (cons 0 (cons 2 (cons 11 (cons 1 (cons 2 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 1 (cons 101 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 1 (cons 10 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 7 (cons 10 (cons 1 (cons 1 (cons 1 (cons 1 (cons 900 (cons 1 (cons 7 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (nil Nat))))))))))))))))) (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat)))))) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat))) = 0x696e76616c696453656d616e746963436174616c6f67)`
- proof: `reflexivity`

Taught by: behavior

### `routingWords_invalidWeight`

`RoutingProtocol::routingWords_invalidWeight` · theorem · #160 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/RoutingProtocol.lex.tex)

- statement: `((dispatchRoutingWords (prim append (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 101 (cons 0 (cons 4 (cons 102 (cons 101 (cons 1001 (cons 203 (cons 201 (cons 900 (cons 100 (nil Nat))))))))))))))))) (prim append (cons 101 (cons 500 (cons 100 (cons 201 (cons 500 (cons 100 (cons 100 (cons 1 (cons 9 (cons 1 (cons 1 (cons 0 (cons 5 (cons 10 (cons 1 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 1 (cons 900 (cons 1 (cons 7 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 11 (cons 1 (cons 2 (cons 1 (cons 1 (cons 101 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 0 (cons 1 (cons 10 (cons 1 (cons 7 (cons 14 (cons 1 (cons 1 (cons 1 (cons 1 (cons 901 (cons 1 (cons 8 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 9 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (cons 12 (cons 1 (cons 1 (cons 1 (cons 2 (cons 201 (cons 202 (nil Nat))))))))))))))))) (prim append (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 1 (cons 10 (cons 1 (cons 1 (cons 14 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 8 (cons 13 (cons 1 (cons 1 (cons 1 (cons 1 (cons 301 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (nil Nat))))))))))))))))) (cons 0 (cons 1 (cons 10 (cons 1 (cons 0 (nil Nat)))))) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat))) = 0x696e76616c696453656d616e74696352656c6174696f6e73)`
- proof: `reflexivity`

Taught by: behavior

### `routingWords_permissionDenied`

`RoutingProtocol::routingWords_permissionDenied` · theorem · #161 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/RoutingProtocol.lex.tex)

- statement: `((dispatchRoutingWords (prim append (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 201 (cons 0 (cons 4 (cons 102 (cons 101 (cons 900 (cons 203 (cons 201 (cons 900 (cons 100 (nil Nat))))))))))))))))) (prim append (cons 101 (cons 500 (cons 100 (cons 201 (cons 500 (cons 100 (cons 100 (cons 0 (cons 1 (cons 1 (cons 0 (cons 5 (cons 10 (cons 1 (cons 1 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 900 (cons 1 (cons 7 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (cons 11 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 2 (cons 1 (cons 1 (cons 101 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 10 (cons 1 (cons 7 (cons 14 (cons 1 (cons 1 (cons 1 (cons 1 (cons 901 (cons 1 (cons 8 (cons 0 (cons 0 (cons 0 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 9 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (cons 12 (cons 1 (cons 1 (cons 1 (cons 2 (cons 201 (cons 202 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 1 (cons 10 (cons 1 (cons 1 (cons 14 (cons 1 (cons 8 (nil Nat))))))))))))))))) (prim append (cons 13 (cons 1 (cons 1 (cons 1 (cons 1 (cons 301 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (nil Nat))))))))))))))))) (cons 1 (cons 10 (cons 1 (cons 0 (nil Nat))))) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat))) = 0x6f6b203031303030303030303830303030303030373030303030303031303030303030303130303030303030303030303030303031303030303030306330303030303030313030303030306538346265383031303330303030303030613030303030303031303030303030306530303030303030313030303030303063303030303030303130303030303030303030303030303030303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `routingWords_unknown`

`RoutingProtocol::routingWords_unknown` · theorem · #162 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/RoutingProtocol.lex.tex)

- statement: `((dispatchRoutingWords (prim append (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 1 (cons 999 (cons 0 (cons 4 (cons 102 (cons 101 (cons 900 (cons 203 (cons 201 (cons 900 (cons 100 (nil Nat))))))))))))))))) (prim append (cons 101 (cons 500 (cons 100 (cons 201 (cons 500 (cons 100 (cons 100 (cons 1 (cons 9 (cons 1 (cons 1 (cons 0 (cons 5 (cons 10 (cons 1 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 1 (cons 900 (cons 1 (cons 7 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 11 (cons 1 (cons 2 (cons 1 (cons 1 (cons 101 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 0 (cons 1 (cons 10 (cons 1 (cons 7 (cons 14 (cons 1 (cons 1 (cons 1 (cons 1 (cons 901 (cons 1 (cons 8 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))) (prim append (cons 1 (cons 9 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (cons 12 (cons 1 (cons 1 (cons 1 (cons 2 (cons 201 (cons 202 (nil Nat))))))))))))))))) (prim append (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (cons 0 (cons 1 (cons 10 (cons 1 (cons 1 (cons 14 (cons 1 (nil Nat))))))))))))))))) (prim append (cons 8 (cons 13 (cons 1 (cons 1 (cons 1 (cons 1 (cons 301 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 1 (cons 0 (nil Nat))))))))))))))))) (cons 0 (cons 1 (cons 10 (cons 1 (cons 0 (nil Nat)))))) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat)) : (List Nat))) = 0x6f6b2030313030303030303036303030303030303030303030303030313030303030303031303030303030303030303030303030303030303030303030303030303030303030303030303030313030303030306537303330303030)`
- proof: `reflexivity`

Taught by: behavior

**SemanticRouter: 22 records**

### `router_admissionIndependent`

`SemanticRouter::router_admissionIndependent` · theorem · #163 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) admission) = (ctor Result.ok [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (cons (routerBase) (cons (routerGallery) (nil FeatureComposition::FeatureContract)))))`
- proof: `reflexivity`

Taught by: behavior

### `router_budgetExceeded`

`SemanticRouter::router_budgetExceeded` · theorem · #164 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (record FeatureComposition::CompositionPolicy {grants := (cons 9 (nil Nat)), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 1, memory := 100})) admission) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (ctor ProposalAdmission::ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.budgetExceeded))))`
- proof: `reflexivity`

Taught by: behavior

### `router_contextDisambiguates`

`SemanticRouter::router_contextDisambiguates` · theorem · #165 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 100 (nil Nat)), context := (cons 201 (nil Nat))}) (routerCatalog) (routerRelations) (routerPolicy)) proposal) selected) = (cons (record FeatureComposition::FeatureRef {key := 10, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 14, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 12, version := 1}) (nil FeatureComposition::FeatureRef)))))`
- proof: `reflexivity`

Taught by: behavior

### `router_duplicateIntent`

`SemanticRouter::router_duplicateIntent` · theorem · #166 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((propose 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (cons 101 (nil Nat))), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) = (ctor Result.error [RoutingOutcome, RoutingError] (ctor RoutingError.invalidSemanticIntent)))`
- proof: `reflexivity`

Taught by: behavior

### `router_emptyIntent`

`SemanticRouter::router_emptyIntent` · theorem · #167 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((propose 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (nil Nat), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) = (ctor Result.error [RoutingOutcome, RoutingError] (ctor RoutingError.invalidSemanticIntent)))`
- proof: `reflexivity`

Taught by: behavior

### `router_exactGalleryClosure`

`SemanticRouter::router_exactGalleryClosure` · theorem · #168 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) proposal) selected) = (cons (record FeatureComposition::FeatureRef {key := 10, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 11, version := 1}) (nil FeatureComposition::FeatureRef))))`
- proof: `reflexivity`

Taught by: behavior

### `router_exactRankScore`

`SemanticRouter::router_exactRankScore` · theorem · #169 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) ranked) = (cons (record Candidate {reference := (record FeatureComposition::FeatureRef {key := 11, version := 1}), score := 32001000}) (nil Candidate)))`
- proof: `reflexivity`

Taught by: behavior

### `router_featureConflict`

`SemanticRouter::router_featureConflict` · theorem · #170 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (cons (routerBase) (cons (routerConflict) (nil FeatureComposition::FeatureContract))) (routerRelations) (routerPolicy)) admission) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (ctor ProposalAdmission::ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.featureConflict))))`
- proof: `reflexivity`

Taught by: behavior

### `router_forwardDependency`

`SemanticRouter::router_forwardDependency` · theorem · #171 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((propose 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (cons (routerGallery) (cons (routerBase) (nil FeatureComposition::FeatureContract))) (routerRelations) (routerPolicy)) = (ctor Result.error [RoutingOutcome, RoutingError] (ctor RoutingError.invalidSemanticCatalog)))`
- proof: `reflexivity`

Taught by: behavior

### `router_incompatibleInput`

`SemanticRouter::router_incompatibleInput` · theorem · #172 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (cons (routerBase) (cons (routerWrongInput) (nil FeatureComposition::FeatureContract))) (routerRelations) (routerPolicy)) admission) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (ctor ProposalAdmission::ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.incompatibleInput))))`
- proof: `reflexivity`

Taught by: behavior

### `router_invalidRelation`

`SemanticRouter::router_invalidRelation` · theorem · #173 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((propose 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (routerCatalog) (cons (record SemanticRelation {fromConcept := 1, toConcept := 2, weight := 1001}) (nil SemanticRelation)) (routerPolicy)) = (ctor Result.error [RoutingOutcome, RoutingError] (ctor RoutingError.invalidSemanticRelations)))`
- proof: `reflexivity`

Taught by: behavior

### `router_missingEvidence`

`SemanticRouter::router_missingEvidence` · theorem · #174 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (cons (routerBase) (cons (routerMissingQuality) (nil FeatureComposition::FeatureContract))) (routerRelations) (routerPolicy)) admission) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (ctor ProposalAdmission::ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.missingEvidence))))`
- proof: `reflexivity`

Taught by: behavior

### `router_multidomainClosure`

`SemanticRouter::router_multidomainClosure` · theorem · #175 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 201 (cons 202 (nil Nat))), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) proposal) selected) = (cons (record FeatureComposition::FeatureRef {key := 10, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 14, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 12, version := 1}) (nil FeatureComposition::FeatureRef)))))`
- proof: `reflexivity`

Taught by: behavior

### `router_noContextOnlyCandidate`

`SemanticRouter::router_noContextOnlyCandidate` · theorem · #176 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 999 (nil Nat)), context := (cons 101 (nil Nat))}) (routerCatalog) (routerRelations) (routerPolicy)) ranked) = (nil Candidate))`
- proof: `reflexivity`

Taught by: behavior

### `router_permissionDenied`

`SemanticRouter::router_permissionDenied` · theorem · #177 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 201 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (record FeatureComposition::CompositionPolicy {grants := (nil Nat), targets := (cons 1 (nil Nat)), evidence := (nil Nat), cpu := 100, memory := 100})) admission) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (ctor ProposalAdmission::ProposalError.compositionRejected (ctor FeatureComposition::CompositionError.permissionDenied))))`
- proof: `reflexivity`

Taught by: behavior

### `router_relationGalleryClosure`

`SemanticRouter::router_relationGalleryClosure` · theorem · #178 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 102 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) proposal) selected) = (cons (record FeatureComposition::FeatureRef {key := 10, version := 1}) (cons (record FeatureComposition::FeatureRef {key := 11, version := 1}) (nil FeatureComposition::FeatureRef))))`
- proof: `reflexivity`

Taught by: behavior

### `router_staleIntent`

`SemanticRouter::router_staleIntent` · theorem · #179 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 2, registryRevision := 1, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) admission) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (ctor ProposalAdmission::ProposalError.staleIntent)))`
- proof: `reflexivity`

Taught by: behavior

### `router_staleRegistry`

`SemanticRouter::router_staleRegistry` · theorem · #180 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 2, concepts := (cons 101 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) admission) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (ctor ProposalAdmission::ProposalError.staleRegistry)))`
- proof: `reflexivity`

Taught by: behavior

### `router_unknownAbstains`

`SemanticRouter::router_unknownAbstains` · theorem · #181 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 999 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) ranked) = (nil Candidate))`
- proof: `reflexivity`

Taught by: behavior

### `router_unresolvedAmbiguity`

`SemanticRouter::router_unresolvedAmbiguity` · theorem · #182 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 100 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) admission) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (ctor ProposalAdmission::ProposalError.unresolvedAmbiguity)))`
- proof: `reflexivity`

Taught by: behavior

### `router_unresolvedConstraint`

`SemanticRouter::router_unresolvedConstraint` · theorem · #183 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 999 (nil Nat)), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) admission) = (ctor Result.error [(List FeatureComposition::FeatureContract), ProposalAdmission::ProposalError] (ctor ProposalAdmission::ProposalError.unresolvedConstraint)))`
- proof: `reflexivity`

Taught by: behavior

### `router_unselectedIntentRemainsUnresolved`

`SemanticRouter::router_unselectedIntentRemainsUnresolved` · theorem · #184 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/SemanticRouter.lex.tex)

- statement: `((project (project (routeValidated 1 1 (record SemanticIntent {id := 1, registryRevision := 1, concepts := (cons 102 (cons 201 (nil Nat))), context := (nil Nat)}) (routerCatalog) (routerRelations) (routerPolicy)) proposal) unresolved) = (cons 102 (nil Nat)))`
- proof: `reflexivity`

Taught by: behavior

**VersionPreview: 24 records**

### `preview_acquire`

`VersionPreview::preview_acquire` · theorem · #185 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 0, active := 0, owner := 0, origin := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0}), current := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})}) 0 (record PreviewCommand {kind := 1, owner := 7, target := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8})})) = (ctor Result.ok [PreviewTransition, PreviewError] (record PreviewTransition {state := (record PreviewState {revision := 1, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8})}), writeRequested := false, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})))`
- proof: `reflexivity`

Taught by: behavior

### `preview_emptyOwner`

`VersionPreview::preview_emptyOwner` · theorem · #186 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 0, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 3, owner := 7, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.invalidPreviewState)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_exhausted`

`VersionPreview::preview_exhausted` · theorem · #187 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 4294967295, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 4294967295 (record PreviewCommand {kind := 3, owner := 7, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewRevisionExhausted)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_inactiveOrigin`

`VersionPreview::preview_inactiveOrigin` · theorem · #188 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 0, active := 0, owner := 0, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})}) 0 (record PreviewCommand {kind := 1, owner := 7, target := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.invalidPreviewState)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_inactiveOwner`

`VersionPreview::preview_inactiveOwner` · theorem · #189 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 0, active := 0, owner := 7, origin := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0}), current := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})}) 0 (record PreviewCommand {kind := 1, owner := 7, target := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.invalidPreviewState)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_inactiveRecovery`

`VersionPreview::preview_inactiveRecovery` · theorem · #190 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 0, active := 0, owner := 0, origin := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0}), current := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})}) 0 (record PreviewCommand {kind := 5, owner := 8, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewInactive)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_inactiveReturn`

`VersionPreview::preview_inactiveReturn` · theorem · #191 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 0, active := 0, owner := 0, origin := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0}), current := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})}) 0 (record PreviewCommand {kind := 3, owner := 7, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewInactive)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_inactiveSelect`

`VersionPreview::preview_inactiveSelect` · theorem · #192 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 0, active := 0, owner := 0, origin := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0}), current := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})}) 0 (record PreviewCommand {kind := 2, owner := 7, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewInactive)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_invalidKind`

`VersionPreview::preview_invalidKind` · theorem · #193 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 6, owner := 7, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.invalidPreviewCommand)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_invalidOwner`

`VersionPreview::preview_invalidOwner` · theorem · #194 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 2, owner := 0, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.invalidPreviewCommand)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_invalidPhase`

`VersionPreview::preview_invalidPhase` · theorem · #195 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 2, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 3, owner := 7, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.invalidPreviewState)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_maximumIdentity`

`VersionPreview::preview_maximumIdentity` · theorem · #196 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 2, owner := 4294967295, target := (record PreviewAddress {w0 := 4294967295, w1 := 4294967295, w2 := 4294967295, w3 := 4294967295, w4 := 4294967295, w5 := 4294967295, w6 := 4294967295, w7 := 4294967295})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewWrongOwner)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_occupied`

`VersionPreview::preview_occupied` · theorem · #197 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 1, owner := 8, target := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewAlreadyOwned)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_recover`

`VersionPreview::preview_recover` · theorem · #198 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 5, owner := 8, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.ok [PreviewTransition, PreviewError] (record PreviewTransition {state := (record PreviewState {revision := 4, active := 1, owner := 8, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}), writeRequested := false, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})))`
- proof: `reflexivity`

Taught by: behavior

### `preview_restorePrepared`

`VersionPreview::preview_restorePrepared` · theorem · #199 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 4, owner := 7, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})) = (ctor Result.ok [PreviewTransition, PreviewError] (record PreviewTransition {state := (record PreviewState {revision := 4, active := 0, owner := 0, origin := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0}), current := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})}), writeRequested := true, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})))`
- proof: `reflexivity`

Taught by: behavior

### `preview_returnOrigin`

`VersionPreview::preview_returnOrigin` · theorem · #200 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 3, owner := 7, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.ok [PreviewTransition, PreviewError] (record PreviewTransition {state := (record PreviewState {revision := 4, active := 0, owner := 0, origin := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0}), current := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})}), writeRequested := true, target := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8})})))`
- proof: `reflexivity`

Taught by: behavior

### `preview_sameRecoveryOwner`

`VersionPreview::preview_sameRecoveryOwner` · theorem · #201 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 5, owner := 7, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewWrongOwner)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_select`

`VersionPreview::preview_select` · theorem · #202 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 2, owner := 7, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})) = (ctor Result.ok [PreviewTransition, PreviewError] (record PreviewTransition {state := (record PreviewState {revision := 4, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})}), writeRequested := true, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})))`
- proof: `reflexivity`

Taught by: behavior

### `preview_selectSame`

`VersionPreview::preview_selectSame` · theorem · #203 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 2, owner := 7, target := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})})) = (ctor Result.ok [PreviewTransition, PreviewError] (record PreviewTransition {state := (record PreviewState {revision := 4, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}), writeRequested := true, target := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})})))`
- proof: `reflexivity`

Taught by: behavior

### `preview_staleRevision`

`VersionPreview::preview_staleRevision` · theorem · #204 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 2 (record PreviewCommand {kind := 2, owner := 7, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewRevisionConflict)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_unusedTarget`

`VersionPreview::preview_unusedTarget` · theorem · #205 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 3, owner := 7, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.invalidPreviewCommand)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_wrongRestoreOwner`

`VersionPreview::preview_wrongRestoreOwner` · theorem · #206 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 4, owner := 8, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewWrongOwner)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_wrongReturnOwner`

`VersionPreview::preview_wrongReturnOwner` · theorem · #207 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 3, owner := 8, target := (record PreviewAddress {w0 := 0, w1 := 0, w2 := 0, w3 := 0, w4 := 0, w5 := 0, w6 := 0, w7 := 0})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewWrongOwner)))`
- proof: `reflexivity`

Taught by: behavior

### `preview_wrongSelectOwner`

`VersionPreview::preview_wrongSelectOwner` · theorem · #208 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreview.lex.tex)

- statement: `((transitionPreview (record PreviewState {revision := 3, active := 1, owner := 7, origin := (record PreviewAddress {w0 := 1, w1 := 2, w2 := 3, w3 := 4, w4 := 5, w5 := 6, w6 := 7, w7 := 8}), current := (record PreviewAddress {w0 := 9, w1 := 10, w2 := 11, w3 := 12, w4 := 13, w5 := 14, w6 := 15, w7 := 16})}) 3 (record PreviewCommand {kind := 2, owner := 8, target := (record PreviewAddress {w0 := 17, w1 := 18, w2 := 19, w3 := 20, w4 := 21, w5 := 22, w6 := 23, w7 := 24})})) = (ctor Result.error [PreviewTransition, PreviewError] (ctor PreviewError.previewWrongOwner)))`
- proof: `reflexivity`

Taught by: behavior

**VersionPreviewProtocol: 8 records**

### `previewRaw_empty`

`VersionPreviewProtocol::previewRaw_empty` · theorem · #209 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreviewProtocol.lex.tex)

- statement: `((dispatchPreview 0x) = 0x6d616c666f726d65645072657669657752657175657374)`
- proof: `reflexivity`

Taught by: behavior

### `previewRaw_trailing`

`VersionPreviewProtocol::previewRaw_trailing` · theorem · #210 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreviewProtocol.lex.tex)

- statement: `((dispatchPreview 0x30313030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030313030303030303037303030303030303130303030303030323030303030303033303030303030303430303030303030353030303030303036303030303030303730303030303030383030303030303030303030303030) = 0x7072657669657752657175657374546f6f4c61726765)`
- proof: `reflexivity`

Taught by: behavior

### `previewWire_acquire`

`VersionPreviewProtocol::previewWire_acquire` · theorem · #211 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreviewProtocol.lex.tex)

- statement: `((dispatchPreviewWords (cons 1 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 1 (cons 7 (cons 1 (cons 2 (cons 3 (cons 4 (cons 5 (cons 6 (cons 7 (cons 8 (nil Nat))))))))))))))))))))))))))))))))) = 0x6f6b2030313030303030303031303030303030303130303030303030373030303030303031303030303030303230303030303030333030303030303034303030303030303530303030303030363030303030303037303030303030303830303030303030313030303030303032303030303030303330303030303030343030303030303035303030303030303630303030303030373030303030303038303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `previewWire_recover`

`VersionPreviewProtocol::previewWire_recover` · theorem · #212 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreviewProtocol.lex.tex)

- statement: `((dispatchPreviewWords (cons 1 (cons 3 (cons 1 (cons 7 (cons 1 (cons 2 (cons 3 (cons 4 (cons 5 (cons 6 (cons 7 (cons 8 (cons 9 (cons 10 (cons 11 (cons 12 (cons 13 (cons 14 (cons 15 (cons 16 (cons 3 (cons 5 (cons 8 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))))))))))))))))))) = 0x6f6b2030313030303030303034303030303030303130303030303030383030303030303031303030303030303230303030303030333030303030303034303030303030303530303030303030363030303030303037303030303030303830303030303030393030303030303061303030303030306230303030303030633030303030303064303030303030306530303030303030663030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `previewWire_restorePrepared`

`VersionPreviewProtocol::previewWire_restorePrepared` · theorem · #213 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreviewProtocol.lex.tex)

- statement: `((dispatchPreviewWords (cons 1 (cons 3 (cons 1 (cons 7 (cons 1 (cons 2 (cons 3 (cons 4 (cons 5 (cons 6 (cons 7 (cons 8 (cons 9 (cons 10 (cons 11 (cons 12 (cons 13 (cons 14 (cons 15 (cons 16 (cons 3 (cons 4 (cons 7 (cons 17 (cons 18 (cons 19 (cons 20 (cons 21 (cons 22 (cons 23 (cons 24 (nil Nat))))))))))))))))))))))))))))))))) = 0x6f6b2030313030303030303034303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303130303030303031313030303030303132303030303030313330303030303031343030303030303135303030303030313630303030303031373030303030303138303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `previewWire_returnOrigin`

`VersionPreviewProtocol::previewWire_returnOrigin` · theorem · #214 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreviewProtocol.lex.tex)

- statement: `((dispatchPreviewWords (cons 1 (cons 3 (cons 1 (cons 7 (cons 1 (cons 2 (cons 3 (cons 4 (cons 5 (cons 6 (cons 7 (cons 8 (cons 9 (cons 10 (cons 11 (cons 12 (cons 13 (cons 14 (cons 15 (cons 16 (cons 3 (cons 3 (cons 7 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (cons 0 (nil Nat))))))))))))))))))))))))))))))))) = 0x6f6b2030313030303030303034303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303130303030303030313030303030303032303030303030303330303030303030343030303030303035303030303030303630303030303030373030303030303038303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `previewWire_select`

`VersionPreviewProtocol::previewWire_select` · theorem · #215 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreviewProtocol.lex.tex)

- statement: `((dispatchPreviewWords (cons 1 (cons 3 (cons 1 (cons 7 (cons 1 (cons 2 (cons 3 (cons 4 (cons 5 (cons 6 (cons 7 (cons 8 (cons 9 (cons 10 (cons 11 (cons 12 (cons 13 (cons 14 (cons 15 (cons 16 (cons 3 (cons 2 (cons 7 (cons 17 (cons 18 (cons 19 (cons 20 (cons 21 (cons 22 (cons 23 (cons 24 (nil Nat))))))))))))))))))))))))))))))))) = 0x6f6b2030313030303030303034303030303030303130303030303030373030303030303031303030303030303230303030303030333030303030303034303030303030303530303030303030363030303030303037303030303030303830303030303031313030303030303132303030303030313330303030303031343030303030303135303030303030313630303030303031373030303030303138303030303030303130303030303031313030303030303132303030303030313330303030303031343030303030303135303030303030313630303030303031373030303030303138303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `previewWire_selectSame`

`VersionPreviewProtocol::previewWire_selectSame` · theorem · #216 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/VersionPreviewProtocol.lex.tex)

- statement: `((dispatchPreviewWords (cons 1 (cons 3 (cons 1 (cons 7 (cons 1 (cons 2 (cons 3 (cons 4 (cons 5 (cons 6 (cons 7 (cons 8 (cons 9 (cons 10 (cons 11 (cons 12 (cons 13 (cons 14 (cons 15 (cons 16 (cons 3 (cons 2 (cons 7 (cons 9 (cons 10 (cons 11 (cons 12 (cons 13 (cons 14 (cons 15 (cons 16 (nil Nat))))))))))))))))))))))))))))))))) = 0x6f6b2030313030303030303034303030303030303130303030303030373030303030303031303030303030303230303030303030333030303030303034303030303030303530303030303030363030303030303037303030303030303830303030303030393030303030303061303030303030306230303030303030633030303030303064303030303030306530303030303030663030303030303130303030303030303130303030303030393030303030303061303030303030306230303030303030633030303030303064303030303030306530303030303030663030303030303130303030303030)`
- proof: `reflexivity`

Taught by: behavior

**WorkOwnership: 28 records**

### `completedResumeRefused`

`WorkOwnership::completedResumeRefused` · theorem · #217 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 0, checkpoint := 2, remaining := 0, phase := (ctor Phase.complete)}) 7 3 (ctor Action.resume)) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidPhase)))`
- proof: `reflexivity`

Taught by: behavior

### `completionReleasesReservation`

`WorkOwnership::completionReleasesReservation` · theorem · #218 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 0, phase := (ctor Phase.running)}) 7 3 (ctor Action.finish)) = (ctor Result.ok [Work, WorkError] (record Work {owner := 7, revision := 4, capacity := 20, spent := 4, reserved := 0, checkpoint := 2, remaining := 0, phase := (ctor Phase.complete)})))`
- proof: `reflexivity`

Taught by: behavior

### `emptyProgressRefused`

`WorkOwnership::emptyProgressRefused` · theorem · #219 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.progress 0 2 9)) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidAmount)))`
- proof: `reflexivity`

Taught by: behavior

### `emptyReserveRefused`

`WorkOwnership::emptyReserveRefused` · theorem · #220 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)}) 7 3 (ctor Action.reserve 0)) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidAmount)))`
- proof: `reflexivity`

Taught by: behavior

### `emptyResumeRefused`

`WorkOwnership::emptyResumeRefused` · theorem · #221 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 0, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)}) 7 3 (ctor Action.resume)) = (ctor Result.error [Work, WorkError] (ctor WorkError.reservationMissing)))`
- proof: `reflexivity`

Taught by: behavior

### `excessObligationRefused`

`WorkOwnership::excessObligationRefused` · theorem · #222 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.progress 3 6 9)) = (ctor Result.error [Work, WorkError] (ctor WorkError.obligationExceeded)))`
- proof: `reflexivity`

Taught by: behavior

### `excessReserveRefused`

`WorkOwnership::excessReserveRefused` · theorem · #223 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)}) 7 3 (ctor Action.reserve 9)) = (ctor Result.error [Work, WorkError] (ctor WorkError.budgetExceeded)))`
- proof: `reflexivity`

Taught by: behavior

### `initializeAdmitted`

`WorkOwnership::initializeAdmitted` · theorem · #224 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((initialize 7 20 5) = (ctor Result.ok [Work, WorkError] (record Work {owner := 7, revision := 0, capacity := 20, spent := 0, reserved := 0, checkpoint := 0, remaining := 5, phase := (ctor Phase.ready)})))`
- proof: `reflexivity`

Taught by: behavior

### `initializeEmptyRefused`

`WorkOwnership::initializeEmptyRefused` · theorem · #225 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((initialize 7 20 0) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidAmount)))`
- proof: `reflexivity`

Taught by: behavior

### `initializeOwnerRefused`

`WorkOwnership::initializeOwnerRefused` · theorem · #226 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((initialize 0 20 5) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidOwner)))`
- proof: `reflexivity`

Taught by: behavior

### `invalidStateRefused`

`WorkOwnership::invalidStateRefused` · theorem · #227 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 21, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.pause)) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidState)))`
- proof: `reflexivity`

Taught by: behavior

### `missingOwnerRefused`

`WorkOwnership::missingOwnerRefused` · theorem · #228 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)}) 7 3 (ctor Action.transfer 0)) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidOwner)))`
- proof: `reflexivity`

Taught by: behavior

### `pauseRetainsWork`

`WorkOwnership::pauseRetainsWork` · theorem · #229 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.pause)) = (ctor Result.ok [Work, WorkError] (record Work {owner := 7, revision := 4, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)})))`
- proof: `reflexivity`

Taught by: behavior

### `pausedCompletionAdmitted`

`WorkOwnership::pausedCompletionAdmitted` · theorem · #230 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 0, checkpoint := 2, remaining := 0, phase := (ctor Phase.paused)}) 7 3 (ctor Action.finish)) = (ctor Result.ok [Work, WorkError] (record Work {owner := 7, revision := 4, capacity := 20, spent := 4, reserved := 0, checkpoint := 2, remaining := 0, phase := (ctor Phase.complete)})))`
- proof: `reflexivity`

Taught by: behavior

### `pausedProgressRefused`

`WorkOwnership::pausedProgressRefused` · theorem · #231 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)}) 7 3 (ctor Action.progress 3 2 9)) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidPhase)))`
- proof: `reflexivity`

Taught by: behavior

### `progressAdmitted`

`WorkOwnership::progressAdmitted` · theorem · #232 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.progress 3 2 9)) = (ctor Result.ok [Work, WorkError] (record Work {owner := 7, revision := 4, capacity := 20, spent := 7, reserved := 5, checkpoint := 9, remaining := 3, phase := (ctor Phase.running)})))`
- proof: `reflexivity`

Taught by: behavior

### `reserveAdmitted`

`WorkOwnership::reserveAdmitted` · theorem · #233 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)}) 7 3 (ctor Action.reserve 8)) = (ctor Result.ok [Work, WorkError] (record Work {owner := 7, revision := 4, capacity := 20, spent := 4, reserved := 16, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)})))`
- proof: `reflexivity`

Taught by: behavior

### `reservedStartAdmitted`

`WorkOwnership::reservedStartAdmitted` · theorem · #234 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 0, reserved := 8, checkpoint := 0, remaining := 5, phase := (ctor Phase.ready)}) 7 3 (ctor Action.start)) = (ctor Result.ok [Work, WorkError] (record Work {owner := 7, revision := 4, capacity := 20, spent := 0, reserved := 8, checkpoint := 0, remaining := 5, phase := (ctor Phase.running)})))`
- proof: `reflexivity`

Taught by: behavior

### `resumeRetainsWork`

`WorkOwnership::resumeRetainsWork` · theorem · #235 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)}) 7 3 (ctor Action.resume)) = (ctor Result.ok [Work, WorkError] (record Work {owner := 7, revision := 4, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)})))`
- proof: `reflexivity`

Taught by: behavior

### `runningReserveRefused`

`WorkOwnership::runningReserveRefused` · theorem · #236 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.reserve 1)) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidPhase)))`
- proof: `reflexivity`

Taught by: behavior

### `runningTransferRefused`

`WorkOwnership::runningTransferRefused` · theorem · #237 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.transfer 8)) = (ctor Result.error [Work, WorkError] (ctor WorkError.invalidPhase)))`
- proof: `reflexivity`

Taught by: behavior

### `staleCheckpointRefused`

`WorkOwnership::staleCheckpointRefused` · theorem · #238 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.progress 3 2 2)) = (ctor Result.error [Work, WorkError] (ctor WorkError.checkpointNotAdvanced)))`
- proof: `reflexivity`

Taught by: behavior

### `staleRevisionRefused`

`WorkOwnership::staleRevisionRefused` · theorem · #239 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 2 (ctor Action.pause)) = (ctor Result.error [Work, WorkError] (ctor WorkError.staleRevision)))`
- proof: `reflexivity`

Taught by: behavior

### `transferRetainsWork`

`WorkOwnership::transferRetainsWork` · theorem · #240 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)}) 7 3 (ctor Action.transfer 8)) = (ctor Result.ok [Work, WorkError] (record Work {owner := 8, revision := 4, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.paused)})))`
- proof: `reflexivity`

Taught by: behavior

### `unfinishedRefused`

`WorkOwnership::unfinishedRefused` · theorem · #241 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.finish)) = (ctor Result.error [Work, WorkError] (ctor WorkError.unfinishedWork)))`
- proof: `reflexivity`

Taught by: behavior

### `unreservedProgressRefused`

`WorkOwnership::unreservedProgressRefused` · theorem · #242 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 7 3 (ctor Action.progress 9 2 9)) = (ctor Result.error [Work, WorkError] (ctor WorkError.reservationExceeded)))`
- proof: `reflexivity`

Taught by: behavior

### `unreservedStartRefused`

`WorkOwnership::unreservedStartRefused` · theorem · #243 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 0, reserved := 0, checkpoint := 0, remaining := 5, phase := (ctor Phase.ready)}) 7 3 (ctor Action.start)) = (ctor Result.error [Work, WorkError] (ctor WorkError.reservationMissing)))`
- proof: `reflexivity`

Taught by: behavior

### `wrongOwnerRefused`

`WorkOwnership::wrongOwnerRefused` · theorem · #244 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkOwnership.lex.tex)

- statement: `((transition (record Work {owner := 7, revision := 3, capacity := 20, spent := 4, reserved := 8, checkpoint := 2, remaining := 5, phase := (ctor Phase.running)}) 8 3 (ctor Action.pause)) = (ctor Result.error [Work, WorkError] (ctor WorkError.wrongOwner)))`
- proof: `reflexivity`

Taught by: behavior

**WorkProtocol: 3 records**

### `wireProgressKeepsAccounting`

`WorkProtocol::wireProgressKeepsAccounting` · theorem · #245 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkProtocol.lex.tex)

- statement: `((dispatchWork 0x303130303030303030373030303030303033303030303030313430303030303030343030303030303038303030303030303230303030303030353030303030303031303030303030303730303030303030333030303030303032303030303030303330303030303030323030303030303039303030303030) = 0x6f6b2030373030303030303034303030303030313430303030303030373030303030303035303030303030303930303030303030333030303030303031303030303030)`
- proof: `reflexivity`

Taught by: behavior

### `wireRefusesCounterOverflow`

`WorkProtocol::wireRefusesCounterOverflow` · theorem · #246 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkProtocol.lex.tex)

- statement: `((dispatchWork 0x303130303030303030373030303030306666666666666666313430303030303030343030303030303038303030303030303230303030303030353030303030303031303030303030303730303030303066666666666666663033303030303030303030303030303030303030303030303030303030303030) = 0x776f726b436f756e746572457868617573746564)`
- proof: `reflexivity`

Taught by: behavior

### `wireRejectsWrongOwner`

`WorkProtocol::wireRejectsWrongOwner` · theorem · #247 · [source](https://github.com/UOR-Foundation/foundry/blob/5fa2a21e5acadcac3f0f13fe98ae142064918794/app/src/WorkProtocol.lex.tex)

- statement: `((dispatchWork 0x303130303030303030373030303030303033303030303030313430303030303030343030303030303038303030303030303230303030303030353030303030303031303030303030303930303030303030333030303030303033303030303030303030303030303030303030303030303030303030303030) = 0x77726f6e674f776e6572)`
- proof: `reflexivity`

Taught by: behavior

