Files
content/tools/sat-smt/e.md

21 lines
735 B
Markdown

+++
date = 2025-06-07
draft = false
title = 'E'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://wwwlehre.dhbw-stuttgart.de/~sschulz/E/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/eprover/eprover", icon = 'fa-brands fa-github' },
# { title = "Playground", url = "https://jfmc.github.io/z3-play/", icon = 'fa-solid fa-gamepad' }
]
applications = ['Theorem Prover']
developers = ['DHBW Stuttgart']
licenses = ['GPLv2']
# inputs = ['']
interfaces = ['CLI']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
E is a theorem prover for full first-order logic (and now monomorphic higher-order logic) with equality.