Skip to content

A DPLL-based SAT solver written in TypeScript, powered by Bun.

License

Notifications You must be signed in to change notification settings

davidgonmar/sat-ts

Repository files navigation

💡sat-ts

Introduction

A DPLL-based SAT solver written in TypeScript, powered by Bun.

Usage

Requirements

You need to have Bun installed on your system. You can find more information at https://bun.sh/.

Running the solver

First, clone the repository and install dependencies:

git clone https://github.com/davidgonmar/sat-ts.git
cd sat-ts
bun install

Then, you can run the solver with:

bun sat-ts <path-to-cnf-file>

The program accepts CNF files in the DIMACS format.

Example

bun sat-ts path/to/file.cnf

# Example output
Finished with result: SAT
Parsed in: 0.123 seconds
Solved in: 0.456 seconds
Total time: 0.579 seconds

Testing

Tests can be run with:

bun test

Tests for the solver use example .cnf files from the SATLIB Benchmark Problems mainly.

Linting and formatting

The project uses ESLint for linting. It can be run with:

bun lint
bun format

License

This project is licensed under the MIT License. See the LICENSE file for details.

About

A DPLL-based SAT solver written in TypeScript, powered by Bun.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published