pub struct InventoryItem {
pub kind: ClaimKind,
pub name: String,
pub status: ClaimStatus,
pub finite_enumeration: bool,
pub domain_bound: Option<String>,
pub counterexample: Option<String>,
pub vacuous: bool,
pub proof: bool,
pub certificate: Option<TheoremCertificate>,
pub certificate_rechecks: Option<bool>,
}Expand description
ONE classified claim in the inventory.
Fields§
§kind: ClaimKind§name: StringThe claim’s identity (the test’s prose name, or the theorem/axiom name).
status: ClaimStatus§finite_enumeration: boolTrue when the claim was established by FINITE testing (an example, or a finite-enumeration property/bounded theorem) rather than an unbounded mathematical argument. The disclosure that keeps green from meaning “unbounded proof”.
domain_bound: Option<String>The disclosed finite bound (integers sampled over [-1000, 1000], the
exhausted boolean space, …) — present whenever a bound was actually
covered, so a bounded claim can never masquerade as unbounded.
counterexample: Option<String>A concrete counterexample, when the claim was falsified.
vacuous: boolTrue only for the vacuous example — a green that asserted nothing.
proof: boolWhether this item is an actual PROOF: true ONLY for a kernel-certified
theorem. An example, a finite-enumeration property (even one exhausted
over booleans), an axiom, and an admitted assumption are all false —
finite testing and admitted premises are never unrestricted proofs.
certificate: Option<TheoremCertificate>The independently re-checkable proof certificate — the kernel proof term,
the goal it proves, and the theorem’s disclosed premises. Present ONLY on a
proof: true theorem: a third party can re-verify it against the kernel
WITHOUT trusting the prover. Never present on an axiom/assumption (an
assumption is not a proof), a finite-enumeration item, or an unproved
theorem.
certificate_rechecks: Option<bool>Whether the carried certificate RE-CHECKS via the independent kernel checker
(type-checking the term to the claimed goal, not re-running the prover).
Some(true) on a certificate that re-verifies; None when there is no
certificate to check. A proof: true theorem whose certificate does NOT
re-check is a soundness alarm the consumer must treat as a failure.
Trait Implementations§
Source§impl Clone for InventoryItem
impl Clone for InventoryItem
Source§fn clone(&self) -> InventoryItem
fn clone(&self) -> InventoryItem
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for InventoryItem
impl Debug for InventoryItem
Auto Trait Implementations§
impl Freeze for InventoryItem
impl RefUnwindSafe for InventoryItem
impl Send for InventoryItem
impl Sync for InventoryItem
impl Unpin for InventoryItem
impl UnsafeUnpin for InventoryItem
impl UnwindSafe for InventoryItem
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.