https://github.com/snigavik/bootfrost

https://github.com/snigavik/bootfrost

Last synced: 27 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/snigavik/bootfrost
• Owner: snigavik
• License: mit
• Created: 2022-02-28T15:26:08.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2024-04-02T07:49:59.000Z (3 months ago)
• Last Synced: 2024-04-02T08:50:37.571Z (3 months ago)
• Language: Rust
• Size: 165 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Lists

• awesome-rust-formalized-reasoning - bootfrost - automated theorem proving program for first-order formulas with extensions. (Projects / Provers and Solvers)

README

        
BOOTFROST - automated theorem proving program for first-order formulas with extensions. 

cargo build

bootfrost --help

USAGE: \

    bootfrost [OPTIONS] --formula <FORMULA> --strategy <STRATEGY> --limit <LIMIT>

OPTIONS: \

    -f, --formula <FORMULA>      Path to the file containing the formula \

    -h, --help                   Print help information \

    -j, --json                   JSON logging \

    -l, --limit <LIMIT>          Maximum number of steps \

    -s, --strategy <STRATEGY>    Strategy: "plain", "general", "manualfirst", "manualbest" \

    -V, --version                Print version information

We recommend using the general strategy for automatic mode

Example: ./bootfrost -f ./problems/branch1.pcf -s general -l 1000

The formula consists of a tree of alternating typical quantifiers. Each typical quantifier is indicated on a new line with a mandatory indent (as in Python). The universal quantifier is denoted by the symbol "!", and the existential quantifier by the symbol "?". Typical existential and universal quantifiers that have a single immediate parent are combined into a disjunction and conjunction correspondingly. 

For a more comprehensive syntax description, please refer to the examples of formulas in the 'problems' subdirectory.