How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
NumberSAT is not a Boolean membership predicate
Statement
With declared variables , let and . Then NumberSAT returns and , respectively, although the SAT membership predicate returns yes on both.
Facts & Assumptions
Given: the two displayed formulas and their declared-variable lists.
NumberSAT is a numerical function rather than a Boolean predicate. by NumberSAT.
Counterexample
Exactly three assignments satisfy . Exactly the two assignments with unequal bits satisfy . Hence [L1] gives outputs and , neither in the Boolean codomain .
Both counts are positive, so the associated SAT predicate maps both inputs to yes. It therefore discards information that NumberSAT retains.
These explicit values show that NumberSAT is a numerical function, not a Boolean membership predicate.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
3 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Arora and Barak, Computational Complexity: A Modern Approach (standard reference, not scraped)
- Lance Fortnow, Counting Complexity (standard reference, not scraped)