https://github.com/qwaz/satire

An educational SAT solver written in Rust
https://github.com/qwaz/satire

Last synced: about 1 month ago
JSON representation

An educational SAT solver written in Rust

• Host: GitHub
• URL: https://github.com/qwaz/satire
• Owner: Qwaz
• Created: 2021-06-23T05:18:04.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2023-09-23T06:38:55.000Z (about 1 year ago)
• Last Synced: 2024-05-22T19:32:32.479Z (6 months ago)
• Language: Rust
• Homepage:
• Size: 265 KB
• Stars: 12
• Watchers: 1
• Forks: 2
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Satire

Satire is an educational (i.e., not feature-complete) SAT solver that may evolve into something else (or not) in the future.

I wrote Satire primarily for learning about SAT solver internals by writing one.

However, I also tried hard to separate different concepts of SAT solvers in different modules,

so it might be helpful for people who found existing SAT solver code difficult to read

or who is learning how to organize code in Rust.

## How to use

Satire accepts limited form of DIMAC CNF files.

```

satire [dpll|cdcl] check testcases/satch_cnfs/add4.cnf

```

To run the entire test suite, use `cargo test`.

```

# Run all tests (note: it doesn't pass all tests in time)

cargo test --release

# Run all tests only with cdcl solver (note: it doesn't pass all tests in time)

cargo test --release -- cdcl

```

## Known limitations

* DPLL solver uses recursion which unnecessarily causes function call overhead.

* CDCL solver uses O(1) data structure for literal marking, but it is often slower than linear search due to the constant overhead.

* Binary heap used for VSIDS scoring scheme is quite inefficient. It could be fixed by custom binary heap implementation.

* No clause minimization.

* No restart.

## References

* [SATCH](https://github.com/arminbiere/satch)

* [MiniSat](https://github.com/niklasso/minisat)

* [splr](https://github.com/shnarazk/splr)