PrismDevRelOpen the app
Case studies: Behavior and proofs

Overview

Case studies

UORust

How UORust was modeledArchitecture walkthroughDesign views in OPM and UMLFeatures and journeysSecurity and threat modelQuality model (ISO/IEC 25010)Behavior and proofsSystem and releaseExtension facetsCommand referenceSlides and video scriptRecord explorerllms.txt and Markdown twins

Prism-DevRel

How Prism-DevRel was modeledArchitecture walkthroughDesign views in OPM and UMLFeatures and journeysSecurity and threat modelQuality model (ISO/IEC 25010)Behavior and proofsExtension facetsSlides and video scriptRecord explorerllms.txt and Markdown twins

Rule 30

How Rule 30 was modeledArchitecture walkthroughSecurity and threat modelQuality model (ISO/IEC 25010)Behavior and proofsSlides and video scriptRecord explorerllms.txt and Markdown twins

Verdant Resonance

How Verdant Resonance was modeledBehavior and proofsExtension facetsSlides and video scriptRecord explorerllms.txt and Markdown twins

Foundry

How Foundry was modeledBehavior and proofsSlides and video scriptRecord explorerllms.txt and Markdown twins

// case study · Foundry

Behavior and proofs

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

Subject: Foundry at commit 5fa2a21e5aca, 248 facet records, source digest 6e5e13608777e1a0.

Behavior and proofs records by kindtheorem: 247 recordstheorem247
Behavior and proofs records by kind. The 247 records this page teaches, one bar for each kind. Each kind has its own section below.
The data in this figure
records
theorem247

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 explains what a proof covers, and what it does not.

Behavior and proofs facet explains the facet for every Prism model, with the counts of every case study.

Every record

Every record 247 rows
IndexRecordKindName
0ChatQueue::queue_activeEdittheoremqueue_activeEdit
1ChatQueue::queue_activeRemovetheoremqueue_activeRemove
2ChatQueue::queue_activeReordertheoremqueue_activeReorder
3ChatQueue::queue_claimtheoremqueue_claim
4ChatQueue::queue_cleartheoremqueue_clear
5ChatQueue::queue_completetheoremqueue_complete
6ChatQueue::queue_duplicatetheoremqueue_duplicate
7ChatQueue::queue_edittheoremqueue_edit
8ChatQueue::queue_enqueuetheoremqueue_enqueue
9ChatQueue::queue_exhaustedRevisiontheoremqueue_exhaustedRevision
10ChatQueue::queue_failtheoremqueue_fail
11ChatQueue::queue_invalidCommandtheoremqueue_invalidCommand
12ChatQueue::queue_invalidStatetheoremqueue_invalidState
13ChatQueue::queue_missingtheoremqueue_missing
14ChatQueue::queue_pausetheoremqueue_pause
15ChatQueue::queue_pausedClaimtheoremqueue_pausedClaim
16ChatQueue::queue_recovertheoremqueue_recover
17ChatQueue::queue_removetheoremqueue_remove
18ChatQueue::queue_reordertheoremqueue_reorder
19ChatQueue::queue_resumetheoremqueue_resume
20ChatQueue::queue_staleResumetheoremqueue_staleResume
21ChatQueue::queue_staleRevisiontheoremqueue_staleRevision
22ChatQueue::queue_stoptheoremqueue_stop
23ChatQueue::queue_wrongOwnertheoremqueue_wrongOwner
24ChatQueueProtocol::wire_cleartheoremwire_clear
25ChatQueueProtocol::wire_edittheoremwire_edit
26ChatQueueProtocol::wire_emptytheoremwire_empty
27ChatQueueProtocol::wire_enqueuetheoremwire_enqueue
28ChatQueueProtocol::wire_pausetheoremwire_pause
29ChatQueueProtocol::wire_removetheoremwire_remove
30ChatQueueProtocol::wire_reordertheoremwire_reorder
31ChatQueueProtocol::wire_trailingtheoremwire_trailing
32EventAdmission::bytesEventAdmittedtheorembytesEventAdmitted
33EventAdmission::duplicateRouteRefusedtheoremduplicateRouteRefused
34EventAdmission::emptyBytesAdmittedtheorememptyBytesAdmitted
35EventAdmission::exhaustedSequenceRefusedtheoremexhaustedSequenceRefused
36EventAdmission::flagEventAdmittedtheoremflagEventAdmitted
37EventAdmission::futureSequenceRefusedtheoremfutureSequenceRefused
38EventAdmission::invalidByteRefusedtheoreminvalidByteRefused
39EventAdmission::invalidContractRefusedtheoreminvalidContractRefused
40EventAdmission::lastSequenceAdmittedtheoremlastSequenceAdmitted
41EventAdmission::missingRouteFeatureRefusedtheoremmissingRouteFeatureRefused
42EventAdmission::naturalEventAdmittedtheoremnaturalEventAdmitted
43EventAdmission::oversizedNaturalRefusedtheoremoversizedNaturalRefused
44EventAdmission::oversizedPayloadRefusedtheoremoversizedPayloadRefused
45EventAdmission::replayedSequenceRefusedtheoremreplayedSequenceRefused
46EventAdmission::revokedPermissionRefusedtheoremrevokedPermissionRefused
47EventAdmission::staleGenerationRefusedtheoremstaleGenerationRefused
48EventAdmission::undeclaredFeatureEventRefusedtheoremundeclaredFeatureEventRefused
49EventAdmission::wrongConsumerRefusedtheoremwrongConsumerRefused
50EventAdmission::wrongEventKeyRefusedtheoremwrongEventKeyRefused
51EventAdmission::wrongEventVersionRefusedtheoremwrongEventVersionRefused
52EventAdmission::wrongFeatureVersionRefusedtheoremwrongFeatureVersionRefused
53EventAdmission::wrongPayloadKindRefusedtheoremwrongPayloadKindRefused
54EventAdmission::wrongProducerRefusedtheoremwrongProducerRefused
55EventAdmission::zeroGenerationRefusedtheoremzeroGenerationRefused
56EventProtocol::wire_flagtheoremwire_flag
57EventProtocol::wire_naturaltheoremwire_natural
58EventProtocol::wire_revokedtheoremwire_revoked
59EventProtocol::wire_staleGenerationtheoremwire_staleGeneration
60EventProtocol::wire_trailingtheoremwire_trailing
61FeatureComposition::cpuRefusedtheoremcpuRefused
62FeatureComposition::dependencyAdmittedtheoremdependencyAdmitted
63FeatureComposition::duplicateIdentityRefusedtheoremduplicateIdentityRefused
64FeatureComposition::emptyRefusedtheorememptyRefused
65FeatureComposition::emptyVocabularyRefusedtheorememptyVocabularyRefused
66FeatureComposition::evidenceRefusedtheoremevidenceRefused
67FeatureComposition::forwardDependencyRefusedtheoremforwardDependencyRefused
68FeatureComposition::incompatibleInputRefusedtheoremincompatibleInputRefused
69FeatureComposition::memoryRefusedtheoremmemoryRefused
70FeatureComposition::missingDependencyRefusedtheoremmissingDependencyRefused
71FeatureComposition::newConflictRefusedtheoremnewConflictRefused
72FeatureComposition::permissionRefusedtheorempermissionRefused
73FeatureComposition::priorConflictRefusedtheorempriorConflictRefused
74FeatureComposition::singleAdmittedtheoremsingleAdmitted
75FeatureComposition::targetRefusedtheoremtargetRefused
76FeatureComposition::wrongVersionRefusedtheoremwrongVersionRefused
77FeatureComposition::zeroIdentityRefusedtheoremzeroIdentityRefused
78FeatureComposition::zeroVersionRefusedtheoremzeroVersionRefused
80ForgeKernelProofs::budgetOverWithinHoldstheorembudgetOverWithinHolds
81ForgeKernelProofs::budgetWithinOverHoldstheorembudgetWithinOverHolds
82ForgeKernelProofs::builtBudgetBoundHoldstheorembuiltBudgetBoundHolds
83ForgeKernelProofs::denyWinsHoldstheoremdenyWinsHolds
84ForgeKernelProofs::editBudgetBoundHoldstheoremeditBudgetBoundHolds
85ForgeKernelProofs::firstThinkHoldstheoremfirstThinkHolds
86ForgeKernelProofs::inpBudgetBoundHoldstheoreminpBudgetBoundHolds
87ForgeKernelProofs::inv001Holdstheoreminv001Holds
88ForgeKernelProofs::inv002Holdstheoreminv002Holds
89ForgeKernelProofs::inv003Holdstheoreminv003Holds
90ForgeKernelProofs::inv004Holdstheoreminv004Holds
91ForgeKernelProofs::longMotionHoldstheoremlongMotionHolds
92ForgeKernelProofs::narrowSplitHoldstheoremnarrowSplitHolds
93ForgeKernelProofs::noRecordNoFetchHoldstheoremnoRecordNoFetchHolds
94ForgeKernelProofs::noRecordOnlyForgeHoldstheoremnoRecordOnlyForgeHolds
95ForgeKernelProofs::oldRecentHoldstheoremoldRecentHolds
96ForgeKernelProofs::outsideForgeNeedsGrantHoldstheoremoutsideForgeNeedsGrantHolds
97ForgeKernelProofs::previewNoNetworkWithoutGrantHoldstheorempreviewNoNetworkWithoutGrantHolds
98ForgeKernelProofs::reducedMotionHoldstheoremreducedMotionHolds
99ForgeKernelProofs::rewordKeepsProofHoldstheoremrewordKeepsProofHolds
100ForgeKernelProofs::rewordKeepsPublishedHoldstheoremrewordKeepsPublishedHolds
101ForgeKernelProofs::routeBelowFirstLoadHoldstheoremrouteBelowFirstLoadHolds
102ForgeKernelProofs::smallTargetHoldstheoremsmallTargetHolds
103ForgeKernelProofs::telemetryEgressHoldstheoremtelemetryEgressHolds
104ForgeKernelProofs::telemetryOffDeviceHoldstheoremtelemetryOffDeviceHolds
105ForgeKernelProofs::telemetryUnaskedHoldstheoremtelemetryUnaskedHolds
106ForgeKernelProofs::wideTabsHoldstheoremwideTabsHolds
107FoundrySpecification::checkedExternalBoundarytheoremcheckedExternalBoundary
108FoundrySpecification::competingExternalOwnerstheoremcompetingExternalOwners
109FoundrySpecification::competingProductOwnerstheoremcompetingProductOwners
110FoundrySpecification::missingExternalOwnertheoremmissingExternalOwner
111FoundrySpecification::missingProductOwnertheoremmissingProductOwner
112FoundrySpecification::oneProductOwnertheoremoneProductOwner
113FoundrySpecification::uncheckedExternalBoundarytheoremuncheckedExternalBoundary
114InteractionModel::interactionBackwardtheoreminteractionBackward
115InteractionModel::interactionBadDestinationtheoreminteractionBadDestination
116InteractionModel::interactionBadStatetheoreminteractionBadState
117InteractionModel::interactionCurrenttheoreminteractionCurrent
118InteractionModel::interactionDuplicateRoutetheoreminteractionDuplicateRoute
119InteractionModel::interactionEmptyFramestheoreminteractionEmptyFrames
120InteractionModel::interactionForwardtheoreminteractionForward
121InteractionModel::interactionMissingRoutetheoreminteractionMissingRoute
122InteractionModel::interactionOutputStatetheoreminteractionOutputState
123InteractionModel::interactionReducedMotionStatictheoreminteractionReducedMotionStatic
124InteractionModel::interactionSilentWithoutConsenttheoreminteractionSilentWithoutConsent
125InteractionModel::interactionWrongVersiontheoreminteractionWrongVersion
126InteractionProtocol::interactionWire_emptytheoreminteractionWire_empty
127InteractionProtocol::interactionWire_trailingtheoreminteractionWire_trailing
128InteractionProtocol::interactionWords_duplicateRoutetheoreminteractionWords_duplicateRoute
129InteractionProtocol::interactionWords_galleryNexttheoreminteractionWords_galleryNext
130InteractionProtocol::interactionWords_gardenAudiotheoreminteractionWords_gardenAudio
131InteractionProtocol::interactionWords_gardenReducedtheoreminteractionWords_gardenReduced
132InteractionProtocol::interactionWords_gardenSilenttheoreminteractionWords_gardenSilent
133InteractionProtocol::interactionWords_wrongVersiontheoreminteractionWords_wrongVersion
134ProposalAdmission::ambiguityRefusedtheoremambiguityRefused
135ProposalAdmission::confidenceCannotGrantPermissiontheoremconfidenceCannotGrantPermission
136ProposalAdmission::confidenceCannotIncreaseBudgettheoremconfidenceCannotIncreaseBudget
137ProposalAdmission::constraintRefusedtheoremconstraintRefused
138ProposalAdmission::duplicateRegistryRefusedtheoremduplicateRegistryRefused
139ProposalAdmission::duplicateSelectionRefusedtheoremduplicateSelectionRefused
140ProposalAdmission::emptySelectionRefusedtheorememptySelectionRefused
141ProposalAdmission::exactVersionSelectedtheoremexactVersionSelected
142ProposalAdmission::invalidConfidenceRefusedtheoreminvalidConfidenceRefused
143ProposalAdmission::malformedRegistryRefusedtheoremmalformedRegistryRefused
144ProposalAdmission::maximumConfidenceAdmittedtheoremmaximumConfidenceAdmitted
145ProposalAdmission::missingDependencyRefusedtheoremmissingDependencyRefused
146ProposalAdmission::orderedDependenciesAdmittedtheoremorderedDependenciesAdmitted
147ProposalAdmission::staleIntentRefusedtheoremstaleIntentRefused
148ProposalAdmission::staleRegistryRefusedtheoremstaleRegistryRefused
149ProposalAdmission::unknownFeatureRefusedtheoremunknownFeatureRefused
150ProposalAdmission::wrongOrderRefusedtheoremwrongOrderRefused
151ProposalAdmission::wrongVersionRefusedtheoremwrongVersionRefused
152ProposalAdmission::zeroConfidenceAdmittedtheoremzeroConfidenceAdmitted
153ProposalAdmission::zeroExpectedIntentRefusedtheoremzeroExpectedIntentRefused
154ProposalAdmission::zeroExpectedRevisionRefusedtheoremzeroExpectedRevisionRefused
155RoutingProtocol::routingRaw_emptytheoremroutingRaw_empty
156RoutingProtocol::routingRaw_uppercasetheoremroutingRaw_uppercase
157RoutingProtocol::routingWords_ambiguitytheoremroutingWords_ambiguity
158RoutingProtocol::routingWords_exactGallerytheoremroutingWords_exactGallery
159RoutingProtocol::routingWords_forwardDependencytheoremroutingWords_forwardDependency
160RoutingProtocol::routingWords_invalidWeighttheoremroutingWords_invalidWeight
161RoutingProtocol::routingWords_permissionDeniedtheoremroutingWords_permissionDenied
162RoutingProtocol::routingWords_unknowntheoremroutingWords_unknown
163SemanticRouter::router_admissionIndependenttheoremrouter_admissionIndependent
164SemanticRouter::router_budgetExceededtheoremrouter_budgetExceeded
165SemanticRouter::router_contextDisambiguatestheoremrouter_contextDisambiguates
166SemanticRouter::router_duplicateIntenttheoremrouter_duplicateIntent
167SemanticRouter::router_emptyIntenttheoremrouter_emptyIntent
168SemanticRouter::router_exactGalleryClosuretheoremrouter_exactGalleryClosure
169SemanticRouter::router_exactRankScoretheoremrouter_exactRankScore
170SemanticRouter::router_featureConflicttheoremrouter_featureConflict
171SemanticRouter::router_forwardDependencytheoremrouter_forwardDependency
172SemanticRouter::router_incompatibleInputtheoremrouter_incompatibleInput
173SemanticRouter::router_invalidRelationtheoremrouter_invalidRelation
174SemanticRouter::router_missingEvidencetheoremrouter_missingEvidence
175SemanticRouter::router_multidomainClosuretheoremrouter_multidomainClosure
176SemanticRouter::router_noContextOnlyCandidatetheoremrouter_noContextOnlyCandidate
177SemanticRouter::router_permissionDeniedtheoremrouter_permissionDenied
178SemanticRouter::router_relationGalleryClosuretheoremrouter_relationGalleryClosure
179SemanticRouter::router_staleIntenttheoremrouter_staleIntent
180SemanticRouter::router_staleRegistrytheoremrouter_staleRegistry
181SemanticRouter::router_unknownAbstainstheoremrouter_unknownAbstains
182SemanticRouter::router_unresolvedAmbiguitytheoremrouter_unresolvedAmbiguity
183SemanticRouter::router_unresolvedConstrainttheoremrouter_unresolvedConstraint
184SemanticRouter::router_unselectedIntentRemainsUnresolvedtheoremrouter_unselectedIntentRemainsUnresolved
185VersionPreview::preview_acquiretheorempreview_acquire
186VersionPreview::preview_emptyOwnertheorempreview_emptyOwner
187VersionPreview::preview_exhaustedtheorempreview_exhausted
188VersionPreview::preview_inactiveOrigintheorempreview_inactiveOrigin
189VersionPreview::preview_inactiveOwnertheorempreview_inactiveOwner
190VersionPreview::preview_inactiveRecoverytheorempreview_inactiveRecovery
191VersionPreview::preview_inactiveReturntheorempreview_inactiveReturn
192VersionPreview::preview_inactiveSelecttheorempreview_inactiveSelect
193VersionPreview::preview_invalidKindtheorempreview_invalidKind
194VersionPreview::preview_invalidOwnertheorempreview_invalidOwner
195VersionPreview::preview_invalidPhasetheorempreview_invalidPhase
196VersionPreview::preview_maximumIdentitytheorempreview_maximumIdentity
197VersionPreview::preview_occupiedtheorempreview_occupied
198VersionPreview::preview_recovertheorempreview_recover
199VersionPreview::preview_restorePreparedtheorempreview_restorePrepared
200VersionPreview::preview_returnOrigintheorempreview_returnOrigin
201VersionPreview::preview_sameRecoveryOwnertheorempreview_sameRecoveryOwner
202VersionPreview::preview_selecttheorempreview_select
203VersionPreview::preview_selectSametheorempreview_selectSame
204VersionPreview::preview_staleRevisiontheorempreview_staleRevision
205VersionPreview::preview_unusedTargettheorempreview_unusedTarget
206VersionPreview::preview_wrongRestoreOwnertheorempreview_wrongRestoreOwner
207VersionPreview::preview_wrongReturnOwnertheorempreview_wrongReturnOwner
208VersionPreview::preview_wrongSelectOwnertheorempreview_wrongSelectOwner
209VersionPreviewProtocol::previewRaw_emptytheorempreviewRaw_empty
210VersionPreviewProtocol::previewRaw_trailingtheorempreviewRaw_trailing
211VersionPreviewProtocol::previewWire_acquiretheorempreviewWire_acquire
212VersionPreviewProtocol::previewWire_recovertheorempreviewWire_recover
213VersionPreviewProtocol::previewWire_restorePreparedtheorempreviewWire_restorePrepared
214VersionPreviewProtocol::previewWire_returnOrigintheorempreviewWire_returnOrigin
215VersionPreviewProtocol::previewWire_selecttheorempreviewWire_select
216VersionPreviewProtocol::previewWire_selectSametheorempreviewWire_selectSame
217WorkOwnership::completedResumeRefusedtheoremcompletedResumeRefused
218WorkOwnership::completionReleasesReservationtheoremcompletionReleasesReservation
219WorkOwnership::emptyProgressRefusedtheorememptyProgressRefused
220WorkOwnership::emptyReserveRefusedtheorememptyReserveRefused
221WorkOwnership::emptyResumeRefusedtheorememptyResumeRefused
222WorkOwnership::excessObligationRefusedtheoremexcessObligationRefused
223WorkOwnership::excessReserveRefusedtheoremexcessReserveRefused
224WorkOwnership::initializeAdmittedtheoreminitializeAdmitted
225WorkOwnership::initializeEmptyRefusedtheoreminitializeEmptyRefused
226WorkOwnership::initializeOwnerRefusedtheoreminitializeOwnerRefused
227WorkOwnership::invalidStateRefusedtheoreminvalidStateRefused
228WorkOwnership::missingOwnerRefusedtheoremmissingOwnerRefused
229WorkOwnership::pauseRetainsWorktheorempauseRetainsWork
230WorkOwnership::pausedCompletionAdmittedtheorempausedCompletionAdmitted
231WorkOwnership::pausedProgressRefusedtheorempausedProgressRefused
232WorkOwnership::progressAdmittedtheoremprogressAdmitted
233WorkOwnership::reserveAdmittedtheoremreserveAdmitted
234WorkOwnership::reservedStartAdmittedtheoremreservedStartAdmitted
235WorkOwnership::resumeRetainsWorktheoremresumeRetainsWork
236WorkOwnership::runningReserveRefusedtheoremrunningReserveRefused
237WorkOwnership::runningTransferRefusedtheoremrunningTransferRefused
238WorkOwnership::staleCheckpointRefusedtheoremstaleCheckpointRefused
239WorkOwnership::staleRevisionRefusedtheoremstaleRevisionRefused
240WorkOwnership::transferRetainsWorktheoremtransferRetainsWork
241WorkOwnership::unfinishedRefusedtheoremunfinishedRefused
242WorkOwnership::unreservedProgressRefusedtheoremunreservedProgressRefused
243WorkOwnership::unreservedStartRefusedtheoremunreservedStartRefused
244WorkOwnership::wrongOwnerRefusedtheoremwrongOwnerRefused
245WorkProtocol::wireProgressKeepsAccountingtheoremwireProgressKeepsAccounting
246WorkProtocol::wireRefusesCounterOverflowtheoremwireRefusesCounterOverflow
247WorkProtocol::wireRejectsWrongOwnertheoremwireRejectsWrongOwner

theorem (247)

ChatQueue: 24 records

queue_activeEdit

ChatQueue::queue_activeEdit theorem #0 source

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 and proofs, Slides and video script

queue_activeRemove

ChatQueue::queue_activeRemove theorem #1 source

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 and proofs

queue_activeReorder

ChatQueue::queue_activeReorder theorem #2 source

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 and proofs

queue_claim

ChatQueue::queue_claim theorem #3 source

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 and proofs

queue_clear

ChatQueue::queue_clear theorem #4 source

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 and proofs

queue_complete

ChatQueue::queue_complete theorem #5 source

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 and proofs

queue_duplicate

ChatQueue::queue_duplicate theorem #6 source

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 and proofs

queue_edit

ChatQueue::queue_edit theorem #7 source

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 and proofs

queue_enqueue

ChatQueue::queue_enqueue theorem #8 source

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 and proofs

queue_exhaustedRevision

ChatQueue::queue_exhaustedRevision theorem #9 source

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 and proofs

queue_fail

ChatQueue::queue_fail theorem #10 source

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 and proofs

queue_invalidCommand

ChatQueue::queue_invalidCommand theorem #11 source

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 and proofs

queue_invalidState

ChatQueue::queue_invalidState theorem #12 source

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 and proofs

queue_missing

ChatQueue::queue_missing theorem #13 source

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 and proofs

queue_pause

ChatQueue::queue_pause theorem #14 source

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 and proofs

queue_pausedClaim

ChatQueue::queue_pausedClaim theorem #15 source

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 and proofs

queue_recover

ChatQueue::queue_recover theorem #16 source

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 and proofs

queue_remove

ChatQueue::queue_remove theorem #17 source

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 and proofs

queue_reorder

ChatQueue::queue_reorder theorem #18 source

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 and proofs

queue_resume

ChatQueue::queue_resume theorem #19 source

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 and proofs

queue_staleResume

ChatQueue::queue_staleResume theorem #20 source

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 and proofs

queue_staleRevision

ChatQueue::queue_staleRevision theorem #21 source

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 and proofs

queue_stop

ChatQueue::queue_stop theorem #22 source

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 and proofs

queue_wrongOwner

ChatQueue::queue_wrongOwner theorem #23 source

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 and proofs

ChatQueueProtocol: 8 records

wire_clear

ChatQueueProtocol::wire_clear theorem #24 source

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 and proofs

wire_edit

ChatQueueProtocol::wire_edit theorem #25 source

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 and proofs

wire_empty

ChatQueueProtocol::wire_empty theorem #26 source

statement
((dispatchQueue 0x) = 0x6d616c666f726d6564517565756552657175657374)
proof
reflexivity

Taught by Behavior and proofs

wire_enqueue

ChatQueueProtocol::wire_enqueue theorem #27 source

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 and proofs

wire_pause

ChatQueueProtocol::wire_pause theorem #28 source

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 and proofs

wire_remove

ChatQueueProtocol::wire_remove theorem #29 source

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 and proofs

wire_reorder

ChatQueueProtocol::wire_reorder theorem #30 source

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 and proofs

wire_trailing

ChatQueueProtocol::wire_trailing theorem #31 source

statement
((dispatchQueue 0x30313030303030303033303030303030303030303030303030323030303030303030303030303030303030303030303030333030303030303062303030303030306330303030303030643030303030303033303030303030303130303030303030653030303030303030303030303030303030303030303030303030303030303030303030303030) = 0x6d616c666f726d6564517565756552657175657374)
proof
reflexivity

Taught by Behavior and proofs

EventAdmission: 24 records

bytesEventAdmitted

EventAdmission::bytesEventAdmitted theorem #32 source

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 and proofs

duplicateRouteRefused

EventAdmission::duplicateRouteRefused theorem #33 source

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 and proofs

emptyBytesAdmitted

EventAdmission::emptyBytesAdmitted theorem #34 source

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 and proofs

exhaustedSequenceRefused

EventAdmission::exhaustedSequenceRefused theorem #35 source

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 and proofs

flagEventAdmitted

EventAdmission::flagEventAdmitted theorem #36 source

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 and proofs

futureSequenceRefused

EventAdmission::futureSequenceRefused theorem #37 source

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 and proofs

invalidByteRefused

EventAdmission::invalidByteRefused theorem #38 source

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 and proofs

invalidContractRefused

EventAdmission::invalidContractRefused theorem #39 source

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 and proofs

lastSequenceAdmitted

EventAdmission::lastSequenceAdmitted theorem #40 source

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 and proofs

missingRouteFeatureRefused

EventAdmission::missingRouteFeatureRefused theorem #41 source

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 and proofs

naturalEventAdmitted

EventAdmission::naturalEventAdmitted theorem #42 source

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 and proofs

oversizedNaturalRefused

EventAdmission::oversizedNaturalRefused theorem #43 source

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 and proofs

oversizedPayloadRefused

EventAdmission::oversizedPayloadRefused theorem #44 source

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 and proofs

replayedSequenceRefused

EventAdmission::replayedSequenceRefused theorem #45 source

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 and proofs

revokedPermissionRefused

EventAdmission::revokedPermissionRefused theorem #46 source

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 and proofs

staleGenerationRefused

EventAdmission::staleGenerationRefused theorem #47 source

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 and proofs

undeclaredFeatureEventRefused

EventAdmission::undeclaredFeatureEventRefused theorem #48 source

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 and proofs

wrongConsumerRefused

EventAdmission::wrongConsumerRefused theorem #49 source

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 and proofs

wrongEventKeyRefused

EventAdmission::wrongEventKeyRefused theorem #50 source

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 and proofs

wrongEventVersionRefused

EventAdmission::wrongEventVersionRefused theorem #51 source

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 and proofs

wrongFeatureVersionRefused

EventAdmission::wrongFeatureVersionRefused theorem #52 source

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 and proofs

wrongPayloadKindRefused

EventAdmission::wrongPayloadKindRefused theorem #53 source

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 and proofs

wrongProducerRefused

EventAdmission::wrongProducerRefused theorem #54 source

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 and proofs

zeroGenerationRefused

EventAdmission::zeroGenerationRefused theorem #55 source

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 and proofs

EventProtocol: 5 records

wire_flag

EventProtocol::wire_flag theorem #56 source

statement
((dispatchEvent 0x3032303030303030303230303030303030313030303030303039303030303030303130303030303030313030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030303030303030303030303030303030303130303030303030373030303030303030303030303030303130303030303030393030303030303030303030303030303130303030303030313030303030303030303030303030303030303030303030303030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303037303030303030303130303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030323030303030303031303030303030303330303030303030323030303030303037303030303030303130303030303030333030303030303032303030303030303130303030303030313030303030303032303030303030303130303030303030313030303030303030303030303030) = 0x6f6b203033303030303030)
proof
reflexivity

Taught by Behavior and proofs

wire_natural

EventProtocol::wire_natural theorem #57 source

statement
((dispatchEvent 0x3032303030303030303230303030303030313030303030303039303030303030303130303030303030313030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030303030303030303030303030303030303130303030303030373030303030303030303030303030303130303030303030393030303030303030303030303030303130303030303030313030303030303030303030303030303030303030303030303030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303037303030303030303130303030303030303030303030303034303030303030303130303030303030313030303030303031303030303030303130303030303030323030303030303031303030303030303330303030303030323030303030303037303030303030303130303030303030333030303030303032303030303030303130303030303030313030303030303032303030303030303130303030303030303030303030303261303030303030) = 0x6f6b203033303030303030)
proof
reflexivity

Taught by Behavior and proofs

wire_revoked

EventProtocol::wire_revoked theorem #58 source

statement
((dispatchEvent 0x303230303030303030323030303030303030303030303030303130303030303030313030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030303030303030303030303030303030303130303030303030373030303030303030303030303030303130303030303030393030303030303030303030303030303130303030303030313030303030303030303030303030303030303030303030303030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303037303030303030303130303030303030303030303030303034303030303030303130303030303030313030303030303031303030303030303130303030303030323030303030303031303030303030303330303030303030323030303030303037303030303030303130303030303030333030303030303032303030303030303130303030303030313030303030303032303030303030303130303030303030303030303030303261303030303030) = 0x636f6d706f736974696f6e52656a65637465643a7065726d697373696f6e44656e696564)
proof
reflexivity

Taught by Behavior and proofs

wire_staleGeneration

EventProtocol::wire_staleGeneration theorem #59 source

statement
((dispatchEvent 0x3032303030303030303230303030303030313030303030303039303030303030303130303030303030313030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303130303030303030303030303030303030303030303030303130303030303030373030303030303030303030303030303130303030303030393030303030303030303030303030303130303030303030313030303030303030303030303030303030303030303030303030303030303030303030303030303230303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303037303030303030303130303030303030303030303030303034303030303030303130303030303030313030303030303031303030303030303130303030303030323030303030303031303030303030303330303030303030323030303030303037303030303030303130303030303030323030303030303032303030303030303130303030303030313030303030303032303030303030303130303030303030303030303030303261303030303030) = 0x7374616c6547656e65726174696f6e)
proof
reflexivity

Taught by Behavior and proofs

wire_trailing

EventProtocol::wire_trailing theorem #60 source

statement
((dispatchEvent 0x30323030303030303032303030303030303130303030303030393030303030303031303030303030303130303030303030303030303030303032303030303030303130303030303030313030303030303031303030303030303130303030303030313030303030303031303030303030303030303030303030303030303030303031303030303030303730303030303030303030303030303031303030303030303930303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303030303030303030303030303030303032303030303030303130303030303030313030303030303031303030303030303130303030303030313030303030303030303030303030303030303030303030313030303030303037303030303030303030303030303030313030303030303039303030303030303030303030303030313030303030303031303030303030303030303030303030303030303030303030303030303030303030303030303030373030303030303031303030303030303030303030303030343030303030303031303030303030303130303030303030313030303030303031303030303030303230303030303030313030303030303033303030303030303230303030303030373030303030303031303030303030303330303030303030323030303030303031303030303030303130303030303030323030303030303031303030303030303030303030303032613030303030303030303030303030) = 0x6d616c666f726d65644576656e74)
proof
reflexivity

Taught by Behavior and proofs

FeatureComposition: 18 records

cpuRefused

FeatureComposition::cpuRefused theorem #61 source

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 and proofs

dependencyAdmitted

FeatureComposition::dependencyAdmitted theorem #62 source

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 and proofs

duplicateIdentityRefused

FeatureComposition::duplicateIdentityRefused theorem #63 source

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 and proofs

emptyRefused

FeatureComposition::emptyRefused theorem #64 source

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 and proofs

emptyVocabularyRefused

FeatureComposition::emptyVocabularyRefused theorem #65 source

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 and proofs

evidenceRefused

FeatureComposition::evidenceRefused theorem #66 source

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 and proofs

forwardDependencyRefused

FeatureComposition::forwardDependencyRefused theorem #67 source

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 and proofs

incompatibleInputRefused

FeatureComposition::incompatibleInputRefused theorem #68 source

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 and proofs

memoryRefused

FeatureComposition::memoryRefused theorem #69 source

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 and proofs

missingDependencyRefused

FeatureComposition::missingDependencyRefused theorem #70 source

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 and proofs

newConflictRefused

FeatureComposition::newConflictRefused theorem #71 source

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 and proofs

permissionRefused

FeatureComposition::permissionRefused theorem #72 source

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 and proofs

priorConflictRefused

FeatureComposition::priorConflictRefused theorem #73 source

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 and proofs

singleAdmitted

FeatureComposition::singleAdmitted theorem #74 source

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 and proofs

targetRefused

FeatureComposition::targetRefused theorem #75 source

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 and proofs

wrongVersionRefused

FeatureComposition::wrongVersionRefused theorem #76 source

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 and proofs

zeroIdentityRefused

FeatureComposition::zeroIdentityRefused theorem #77 source

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 and proofs

zeroVersionRefused

FeatureComposition::zeroVersionRefused theorem #78 source

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 and proofs

ForgeKernelProofs: 27 records

budgetOverWithinHolds

ForgeKernelProofs::budgetOverWithinHolds theorem #80 source

statement
((breaksBudgetOverWithin request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

budgetWithinOverHolds

ForgeKernelProofs::budgetWithinOverHolds theorem #81 source

statement
((breaksBudgetWithinOver request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

builtBudgetBoundHolds

ForgeKernelProofs::builtBudgetBoundHolds theorem #82 source

statement
((breaksBuiltBudgetBound request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

denyWinsHolds

ForgeKernelProofs::denyWinsHolds theorem #83 source

statement
((breaksGateDenyWins request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

editBudgetBoundHolds

ForgeKernelProofs::editBudgetBoundHolds theorem #84 source

statement
((breaksEditBudgetBound request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

firstThinkHolds

ForgeKernelProofs::firstThinkHolds theorem #85 source

statement
((breaksFirstThink request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

inpBudgetBoundHolds

ForgeKernelProofs::inpBudgetBoundHolds theorem #86 source

statement
((breaksInpBudgetBound request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

inv001Holds

ForgeKernelProofs::inv001Holds theorem #87 source

statement
((breaksInv001 request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

inv002Holds

ForgeKernelProofs::inv002Holds theorem #88 source

statement
((breaksInv002 request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

inv003Holds

ForgeKernelProofs::inv003Holds theorem #89 source

statement
((breaksInv003 request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

inv004Holds

ForgeKernelProofs::inv004Holds theorem #90 source

statement
((breaksInv004 request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

longMotionHolds

ForgeKernelProofs::longMotionHolds theorem #91 source

statement
((breaksLongMotion request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

narrowSplitHolds

ForgeKernelProofs::narrowSplitHolds theorem #92 source

statement
((breaksNarrowSplit request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

noRecordNoFetchHolds

ForgeKernelProofs::noRecordNoFetchHolds theorem #93 source

statement
((breaksGateNoRecordNoFetch request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

noRecordOnlyForgeHolds

ForgeKernelProofs::noRecordOnlyForgeHolds theorem #94 source

statement
((breaksGateNoRecordOnlyForge request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

oldRecentHolds

ForgeKernelProofs::oldRecentHolds theorem #95 source

statement
((breaksOldRecent request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

outsideForgeNeedsGrantHolds

ForgeKernelProofs::outsideForgeNeedsGrantHolds theorem #96 source

statement
((breaksGateOutsideForgeNeedsGrant request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

previewNoNetworkWithoutGrantHolds

ForgeKernelProofs::previewNoNetworkWithoutGrantHolds theorem #97 source

statement
((breaksGatePreviewNoNetworkWithoutGrant request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

reducedMotionHolds

ForgeKernelProofs::reducedMotionHolds theorem #98 source

statement
((breaksReducedMotion request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

rewordKeepsProofHolds

ForgeKernelProofs::rewordKeepsProofHolds theorem #99 source

statement
((breaksRewordKeepsProof request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

rewordKeepsPublishedHolds

ForgeKernelProofs::rewordKeepsPublishedHolds theorem #100 source

statement
((breaksRewordKeepsPublished request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

routeBelowFirstLoadHolds

ForgeKernelProofs::routeBelowFirstLoadHolds theorem #101 source

statement
((breaksRouteBelowFirstLoad request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

smallTargetHolds

ForgeKernelProofs::smallTargetHolds theorem #102 source

statement
((breaksSmallTarget request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

telemetryEgressHolds

ForgeKernelProofs::telemetryEgressHolds theorem #103 source

statement
((breaksTelemetryEgress request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

telemetryOffDeviceHolds

ForgeKernelProofs::telemetryOffDeviceHolds theorem #104 source

statement
((breaksTelemetryOffDevice request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

telemetryUnaskedHolds

ForgeKernelProofs::telemetryUnaskedHolds theorem #105 source

statement
((breaksTelemetryUnasked request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

wideTabsHolds

ForgeKernelProofs::wideTabsHolds theorem #106 source

statement
((breaksWideTabs request) = false)
proof
linear_arithmetic

Taught by Behavior and proofs

FoundrySpecification: 7 records

checkedExternalBoundary

FoundrySpecification::checkedExternalBoundary theorem #107 source

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

Taught by Behavior and proofs

competingExternalOwners

FoundrySpecification::competingExternalOwners theorem #108 source

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

Taught by Behavior and proofs

competingProductOwners

FoundrySpecification::competingProductOwners theorem #109 source

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

Taught by Behavior and proofs

missingExternalOwner

FoundrySpecification::missingExternalOwner theorem #110 source

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

Taught by Behavior and proofs

missingProductOwner

FoundrySpecification::missingProductOwner theorem #111 source

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

Taught by Behavior and proofs

oneProductOwner

FoundrySpecification::oneProductOwner theorem #112 source

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

Taught by Behavior and proofs

uncheckedExternalBoundary

FoundrySpecification::uncheckedExternalBoundary theorem #113 source

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

Taught by Behavior and proofs

InteractionModel: 12 records

interactionBackward

InteractionModel::interactionBackward theorem #114 source

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 and proofs

interactionBadDestination

InteractionModel::interactionBadDestination theorem #115 source

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 and proofs

interactionBadState

InteractionModel::interactionBadState theorem #116 source

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

Taught by Behavior and proofs

interactionCurrent

InteractionModel::interactionCurrent theorem #117 source

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 and proofs

interactionDuplicateRoute

InteractionModel::interactionDuplicateRoute theorem #118 source

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 and proofs

interactionEmptyFrames

InteractionModel::interactionEmptyFrames theorem #119 source

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 and proofs

interactionForward

InteractionModel::interactionForward theorem #120 source

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 and proofs

interactionMissingRoute

InteractionModel::interactionMissingRoute theorem #121 source

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

Taught by Behavior and proofs

interactionOutputState

InteractionModel::interactionOutputState theorem #122 source

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

Taught by Behavior and proofs

interactionReducedMotionStatic

InteractionModel::interactionReducedMotionStatic theorem #123 source

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

Taught by Behavior and proofs

interactionSilentWithoutConsent

InteractionModel::interactionSilentWithoutConsent theorem #124 source

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

Taught by Behavior and proofs

interactionWrongVersion

InteractionModel::interactionWrongVersion theorem #125 source

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 and proofs

InteractionProtocol: 8 records

interactionWire_empty

InteractionProtocol::interactionWire_empty theorem #126 source

statement
((dispatchInteraction 0x) = 0x6d616c666f726d6564496e746572616374696f6e)
proof
reflexivity

Taught by Behavior and proofs

interactionWire_trailing

InteractionProtocol::interactionWire_trailing theorem #127 source

statement
((dispatchInteraction 0x303130303030303030303030303030303032303030303030303230303030303030303030303030303030303030303030303030303030303030303030303030303031303030303030303130303030303030303030303030303030303030303030303230303030303030303030303030303031303030303030303130303030303030313030303030303032303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030) = 0x6d616c666f726d6564496e746572616374696f6e)
proof
reflexivity

Taught by Behavior and proofs

interactionWords_duplicateRoute

InteractionProtocol::interactionWords_duplicateRoute theorem #128 source

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 and proofs

interactionWords_galleryNext

InteractionProtocol::interactionWords_galleryNext theorem #129 source

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 and proofs

interactionWords_gardenAudio

InteractionProtocol::interactionWords_gardenAudio theorem #130 source

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 and proofs

interactionWords_gardenReduced

InteractionProtocol::interactionWords_gardenReduced theorem #131 source

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 and proofs

interactionWords_gardenSilent

InteractionProtocol::interactionWords_gardenSilent theorem #132 source

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 and proofs

interactionWords_wrongVersion

InteractionProtocol::interactionWords_wrongVersion theorem #133 source

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 and proofs

ProposalAdmission: 21 records

ambiguityRefused

ProposalAdmission::ambiguityRefused theorem #134 source

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 and proofs

confidenceCannotGrantPermission

ProposalAdmission::confidenceCannotGrantPermission theorem #135 source

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 and proofs

confidenceCannotIncreaseBudget

ProposalAdmission::confidenceCannotIncreaseBudget theorem #136 source

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 and proofs

constraintRefused

ProposalAdmission::constraintRefused theorem #137 source

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 and proofs

duplicateRegistryRefused

ProposalAdmission::duplicateRegistryRefused theorem #138 source

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 and proofs

duplicateSelectionRefused

ProposalAdmission::duplicateSelectionRefused theorem #139 source

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 and proofs

emptySelectionRefused

ProposalAdmission::emptySelectionRefused theorem #140 source

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 and proofs

exactVersionSelected

ProposalAdmission::exactVersionSelected theorem #141 source

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 and proofs

invalidConfidenceRefused

ProposalAdmission::invalidConfidenceRefused theorem #142 source

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 and proofs

malformedRegistryRefused

ProposalAdmission::malformedRegistryRefused theorem #143 source

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 and proofs

maximumConfidenceAdmitted

ProposalAdmission::maximumConfidenceAdmitted theorem #144 source

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 and proofs

missingDependencyRefused

ProposalAdmission::missingDependencyRefused theorem #145 source

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 and proofs

orderedDependenciesAdmitted

ProposalAdmission::orderedDependenciesAdmitted theorem #146 source

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 and proofs

staleIntentRefused

ProposalAdmission::staleIntentRefused theorem #147 source

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 and proofs

staleRegistryRefused

ProposalAdmission::staleRegistryRefused theorem #148 source

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 and proofs

unknownFeatureRefused

ProposalAdmission::unknownFeatureRefused theorem #149 source

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 and proofs

wrongOrderRefused

ProposalAdmission::wrongOrderRefused theorem #150 source

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 and proofs

wrongVersionRefused

ProposalAdmission::wrongVersionRefused theorem #151 source

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 and proofs

zeroConfidenceAdmitted

ProposalAdmission::zeroConfidenceAdmitted theorem #152 source

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 and proofs

zeroExpectedIntentRefused

ProposalAdmission::zeroExpectedIntentRefused theorem #153 source

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 and proofs

zeroExpectedRevisionRefused

ProposalAdmission::zeroExpectedRevisionRefused theorem #154 source

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 and proofs

RoutingProtocol: 8 records

routingRaw_empty

RoutingProtocol::routingRaw_empty theorem #155 source

statement
((dispatchRouting 0x) = 0x6d616c666f726d6564526f7574696e6752657175657374)
proof
reflexivity

Taught by Behavior and proofs

routingRaw_uppercase

RoutingProtocol::routingRaw_uppercase theorem #156 source

statement
((dispatchRouting 0x4130303030303030) = 0x6d616c666f726d6564526f7574696e6752657175657374)
proof
reflexivity

Taught by Behavior and proofs

routingWords_ambiguity

RoutingProtocol::routingWords_ambiguity theorem #157 source

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 and proofs

routingWords_exactGallery

RoutingProtocol::routingWords_exactGallery theorem #158 source

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 and proofs

routingWords_forwardDependency

RoutingProtocol::routingWords_forwardDependency theorem #159 source

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 and proofs

routingWords_invalidWeight

RoutingProtocol::routingWords_invalidWeight theorem #160 source

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 and proofs

routingWords_permissionDenied

RoutingProtocol::routingWords_permissionDenied theorem #161 source

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 and proofs

routingWords_unknown

RoutingProtocol::routingWords_unknown theorem #162 source

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 and proofs

SemanticRouter: 22 records

router_admissionIndependent

SemanticRouter::router_admissionIndependent theorem #163 source

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 and proofs

router_budgetExceeded

SemanticRouter::router_budgetExceeded theorem #164 source

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 and proofs

router_contextDisambiguates

SemanticRouter::router_contextDisambiguates theorem #165 source

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 and proofs

router_duplicateIntent

SemanticRouter::router_duplicateIntent theorem #166 source

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 and proofs

router_emptyIntent

SemanticRouter::router_emptyIntent theorem #167 source

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 and proofs

router_exactGalleryClosure

SemanticRouter::router_exactGalleryClosure theorem #168 source

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 and proofs

router_exactRankScore

SemanticRouter::router_exactRankScore theorem #169 source

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 and proofs

router_featureConflict

SemanticRouter::router_featureConflict theorem #170 source

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 and proofs

router_forwardDependency

SemanticRouter::router_forwardDependency theorem #171 source

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 and proofs

router_incompatibleInput

SemanticRouter::router_incompatibleInput theorem #172 source

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 and proofs

router_invalidRelation

SemanticRouter::router_invalidRelation theorem #173 source

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 and proofs

router_missingEvidence

SemanticRouter::router_missingEvidence theorem #174 source

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 and proofs

router_multidomainClosure

SemanticRouter::router_multidomainClosure theorem #175 source

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 and proofs

router_noContextOnlyCandidate

SemanticRouter::router_noContextOnlyCandidate theorem #176 source

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 and proofs

router_permissionDenied

SemanticRouter::router_permissionDenied theorem #177 source

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 and proofs

router_relationGalleryClosure

SemanticRouter::router_relationGalleryClosure theorem #178 source

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 and proofs

router_staleIntent

SemanticRouter::router_staleIntent theorem #179 source

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 and proofs

router_staleRegistry

SemanticRouter::router_staleRegistry theorem #180 source

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 and proofs

router_unknownAbstains

SemanticRouter::router_unknownAbstains theorem #181 source

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 and proofs

router_unresolvedAmbiguity

SemanticRouter::router_unresolvedAmbiguity theorem #182 source

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 and proofs

router_unresolvedConstraint

SemanticRouter::router_unresolvedConstraint theorem #183 source

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 and proofs

router_unselectedIntentRemainsUnresolved

SemanticRouter::router_unselectedIntentRemainsUnresolved theorem #184 source

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 and proofs

VersionPreview: 24 records

preview_acquire

VersionPreview::preview_acquire theorem #185 source

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 and proofs

preview_emptyOwner

VersionPreview::preview_emptyOwner theorem #186 source

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 and proofs

preview_exhausted

VersionPreview::preview_exhausted theorem #187 source

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 and proofs

preview_inactiveOrigin

VersionPreview::preview_inactiveOrigin theorem #188 source

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 and proofs

preview_inactiveOwner

VersionPreview::preview_inactiveOwner theorem #189 source

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 and proofs

preview_inactiveRecovery

VersionPreview::preview_inactiveRecovery theorem #190 source

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 and proofs

preview_inactiveReturn

VersionPreview::preview_inactiveReturn theorem #191 source

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 and proofs

preview_inactiveSelect

VersionPreview::preview_inactiveSelect theorem #192 source

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 and proofs

preview_invalidKind

VersionPreview::preview_invalidKind theorem #193 source

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 and proofs

preview_invalidOwner

VersionPreview::preview_invalidOwner theorem #194 source

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 and proofs

preview_invalidPhase

VersionPreview::preview_invalidPhase theorem #195 source

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 and proofs

preview_maximumIdentity

VersionPreview::preview_maximumIdentity theorem #196 source

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 and proofs

preview_occupied

VersionPreview::preview_occupied theorem #197 source

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 and proofs

preview_recover

VersionPreview::preview_recover theorem #198 source

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 and proofs

preview_restorePrepared

VersionPreview::preview_restorePrepared theorem #199 source

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 and proofs

preview_returnOrigin

VersionPreview::preview_returnOrigin theorem #200 source

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 and proofs

preview_sameRecoveryOwner

VersionPreview::preview_sameRecoveryOwner theorem #201 source

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 and proofs

preview_select

VersionPreview::preview_select theorem #202 source

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 and proofs

preview_selectSame

VersionPreview::preview_selectSame theorem #203 source

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 and proofs

preview_staleRevision

VersionPreview::preview_staleRevision theorem #204 source

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 and proofs

preview_unusedTarget

VersionPreview::preview_unusedTarget theorem #205 source

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 and proofs

preview_wrongRestoreOwner

VersionPreview::preview_wrongRestoreOwner theorem #206 source

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 and proofs

preview_wrongReturnOwner

VersionPreview::preview_wrongReturnOwner theorem #207 source

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 and proofs

preview_wrongSelectOwner

VersionPreview::preview_wrongSelectOwner theorem #208 source

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 and proofs

VersionPreviewProtocol: 8 records

previewRaw_empty

VersionPreviewProtocol::previewRaw_empty theorem #209 source

statement
((dispatchPreview 0x) = 0x6d616c666f726d65645072657669657752657175657374)
proof
reflexivity

Taught by Behavior and proofs

previewRaw_trailing

VersionPreviewProtocol::previewRaw_trailing theorem #210 source

statement
((dispatchPreview 0x30313030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030303030313030303030303037303030303030303130303030303030323030303030303033303030303030303430303030303030353030303030303036303030303030303730303030303030383030303030303030303030303030) = 0x7072657669657752657175657374546f6f4c61726765)
proof
reflexivity

Taught by Behavior and proofs

previewWire_acquire

VersionPreviewProtocol::previewWire_acquire theorem #211 source

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 and proofs

previewWire_recover

VersionPreviewProtocol::previewWire_recover theorem #212 source

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 and proofs

previewWire_restorePrepared

VersionPreviewProtocol::previewWire_restorePrepared theorem #213 source

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 and proofs

previewWire_returnOrigin

VersionPreviewProtocol::previewWire_returnOrigin theorem #214 source

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 and proofs

previewWire_select

VersionPreviewProtocol::previewWire_select theorem #215 source

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 and proofs

previewWire_selectSame

VersionPreviewProtocol::previewWire_selectSame theorem #216 source

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 and proofs

WorkOwnership: 28 records

completedResumeRefused

WorkOwnership::completedResumeRefused theorem #217 source

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 and proofs

completionReleasesReservation

WorkOwnership::completionReleasesReservation theorem #218 source

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 and proofs

emptyProgressRefused

WorkOwnership::emptyProgressRefused theorem #219 source

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 and proofs

emptyReserveRefused

WorkOwnership::emptyReserveRefused theorem #220 source

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 and proofs

emptyResumeRefused

WorkOwnership::emptyResumeRefused theorem #221 source

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 and proofs

excessObligationRefused

WorkOwnership::excessObligationRefused theorem #222 source

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 and proofs

excessReserveRefused

WorkOwnership::excessReserveRefused theorem #223 source

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 and proofs

initializeAdmitted

WorkOwnership::initializeAdmitted theorem #224 source

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 and proofs

initializeEmptyRefused

WorkOwnership::initializeEmptyRefused theorem #225 source

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

Taught by Behavior and proofs

initializeOwnerRefused

WorkOwnership::initializeOwnerRefused theorem #226 source

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

Taught by Behavior and proofs

invalidStateRefused

WorkOwnership::invalidStateRefused theorem #227 source

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 and proofs

missingOwnerRefused

WorkOwnership::missingOwnerRefused theorem #228 source

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 and proofs

pauseRetainsWork

WorkOwnership::pauseRetainsWork theorem #229 source

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 and proofs

pausedCompletionAdmitted

WorkOwnership::pausedCompletionAdmitted theorem #230 source

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 and proofs

pausedProgressRefused

WorkOwnership::pausedProgressRefused theorem #231 source

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 and proofs

progressAdmitted

WorkOwnership::progressAdmitted theorem #232 source

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 and proofs

reserveAdmitted

WorkOwnership::reserveAdmitted theorem #233 source

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 and proofs

reservedStartAdmitted

WorkOwnership::reservedStartAdmitted theorem #234 source

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 and proofs

resumeRetainsWork

WorkOwnership::resumeRetainsWork theorem #235 source

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 and proofs

runningReserveRefused

WorkOwnership::runningReserveRefused theorem #236 source

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 and proofs

runningTransferRefused

WorkOwnership::runningTransferRefused theorem #237 source

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 and proofs

staleCheckpointRefused

WorkOwnership::staleCheckpointRefused theorem #238 source

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 and proofs

staleRevisionRefused

WorkOwnership::staleRevisionRefused theorem #239 source

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 and proofs

transferRetainsWork

WorkOwnership::transferRetainsWork theorem #240 source

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 and proofs

unfinishedRefused

WorkOwnership::unfinishedRefused theorem #241 source

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 and proofs

unreservedProgressRefused

WorkOwnership::unreservedProgressRefused theorem #242 source

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 and proofs

unreservedStartRefused

WorkOwnership::unreservedStartRefused theorem #243 source

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 and proofs

wrongOwnerRefused

WorkOwnership::wrongOwnerRefused theorem #244 source

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 and proofs

WorkProtocol: 3 records

wireProgressKeepsAccounting

WorkProtocol::wireProgressKeepsAccounting theorem #245 source

statement
((dispatchWork 0x303130303030303030373030303030303033303030303030313430303030303030343030303030303038303030303030303230303030303030353030303030303031303030303030303730303030303030333030303030303032303030303030303330303030303030323030303030303039303030303030) = 0x6f6b2030373030303030303034303030303030313430303030303030373030303030303035303030303030303930303030303030333030303030303031303030303030)
proof
reflexivity

Taught by Behavior and proofs

wireRefusesCounterOverflow

WorkProtocol::wireRefusesCounterOverflow theorem #246 source

statement
((dispatchWork 0x303130303030303030373030303030306666666666666666313430303030303030343030303030303038303030303030303230303030303030353030303030303031303030303030303730303030303066666666666666663033303030303030303030303030303030303030303030303030303030303030) = 0x776f726b436f756e746572457868617573746564)
proof
reflexivity

Taught by Behavior and proofs

wireRejectsWrongOwner

WorkProtocol::wireRejectsWrongOwner theorem #247 source

statement
((dispatchWork 0x303130303030303030373030303030303033303030303030313430303030303030343030303030303038303030303030303230303030303030353030303030303031303030303030303930303030303030333030303030303033303030303030303030303030303030303030303030303030303030303030) = 0x77726f6e674f776e6572)
proof
reflexivity

Taught by Behavior and proofs

referenceBuildcase studyMarkdown

Words on this page 5
Prism model
A description of an app, written in LexLean, that covers every facet of it and that the Lean kernel checks before the app is built.
facet
One view of a model, such as its architecture, its security or its quality. Each facet holds records.
record
One entry in a facet: a component, a threat, a measure or a journey step, with the place in the source it came from.
Lean kernel
The small checker at the heart of the Lean prover. It accepts a proof only if every step follows the rules.
theorem
A statement about the model that the Lean kernel has checked, so it holds for every input, not only the ones tested.