Problemadvanced
Minimal unsatisfiable subset
Also called MUS, minimal unsatisfiable core.
Find an unsatisfiable subset of clauses that is minimal under inclusion.
Find an unsatisfiable subset of clauses that is minimal under inclusion.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag V0RSZE Edit this page History Report an error