From 190ee3c50323057d85c77dbe1c7a67979a71ac2f Mon Sep 17 00:00:00 2001
From: Simon Cruanes <simon.cruanes.2007@m4x.org>
Date: Wed, 9 May 2018 19:48:25 -0500
Subject: [PATCH] add dev doc

---
 highlight.pack.js                             |   2 +
 index.html                                    |  18 ++
 odoc.css                                      | 263 ++++++++++++++++++
 sidekick/CDCL_tseitin/.jbuilder-keep          |   0
 .../Make/argument-1-A/Form/index.html         |   2 +
 .../CDCL_tseitin/Make/argument-1-A/index.html |   2 +
 sidekick/CDCL_tseitin/Make/index.html         |   2 +
 sidekick/CDCL_tseitin/index.html              |   2 +
 .../module-type-Arg/Form/index.html           |   2 +
 .../CDCL_tseitin/module-type-Arg/index.html   |   2 +
 .../CDCL_tseitin/module-type-S/index.html     |   2 +
 sidekick/CDCL_tseitin__/.jbuilder-keep        |   0
 .../CDCL_tseitin__/Tseitin_intf/index.html    |   2 +
 .../module-type-Arg/Form/index.html           |   2 +
 .../Tseitin_intf/module-type-Arg/index.html   |   2 +
 .../Tseitin_intf/module-type-S/index.html     |   2 +
 sidekick/CDCL_tseitin__/index.html            |   2 +
 .../CDCL_tseitin__Tseitin_intf/.jbuilder-keep |   0
 .../CDCL_tseitin__Tseitin_intf/index.html     |   2 +
 .../module-type-Arg/Form/index.html           |   2 +
 .../module-type-Arg/index.html                |   2 +
 .../module-type-S/index.html                  |   2 +
 sidekick/Sidekick_backend/.jbuilder-keep      |   0
 .../Sidekick_backend/Backend_intf/index.html  |   2 +
 .../Backend_intf/module-type-S/index.html     |   2 +
 .../Coq/Make/argument-1-S/Atom/index.html     |   2 +
 .../Coq/Make/argument-1-S/Clause/index.html   |   2 +
 .../Coq/Make/argument-1-S/index.html          |   2 +
 .../Coq/Make/argument-2-A/index.html          |   2 +
 sidekick/Sidekick_backend/Coq/Make/index.html |   2 +
 .../Coq/Simple/argument-1-S/Atom/index.html   |   2 +
 .../Coq/Simple/argument-1-S/Clause/index.html |   2 +
 .../Coq/Simple/argument-1-S/index.html        |   2 +
 .../Coq/Simple/argument-2-A/index.html        |   2 +
 .../Sidekick_backend/Coq/Simple/index.html    |   2 +
 sidekick/Sidekick_backend/Coq/index.html      |   2 +
 .../Coq/module-type-Arg/index.html            |   2 +
 .../Coq/module-type-S/index.html              |   2 +
 .../Dedukti/Make/argument-1-S/Atom/index.html |   2 +
 .../Make/argument-1-S/Clause/index.html       |   2 +
 .../Dedukti/Make/argument-1-S/index.html      |   2 +
 .../Dedukti/Make/argument-2-A/index.html      |   2 +
 .../Sidekick_backend/Dedukti/Make/index.html  |   2 +
 sidekick/Sidekick_backend/Dedukti/index.html  |   2 +
 .../Dedukti/module-type-Arg/index.html        |   2 +
 .../Dedukti/module-type-S/index.html          |   2 +
 .../Dimacs/Make/argument-1-St/Atom/index.html |   2 +
 .../Make/argument-1-St/Clause/index.html      |   2 +
 .../Make/argument-1-St/Formula/index.html     |   2 +
 .../Dimacs/Make/argument-1-St/Var/index.html  |   2 +
 .../Dimacs/Make/argument-1-St/index.html      |   2 +
 .../Sidekick_backend/Dimacs/Make/index.html   |   2 +
 sidekick/Sidekick_backend/Dimacs/index.html   |   2 +
 .../Dimacs/module-type-S/index.html           |   2 +
 .../Dot/Default/argument-1-S/Atom/index.html  |   2 +
 .../Default/argument-1-S/Clause/index.html    |   2 +
 .../Dot/Default/argument-1-S/index.html       |   2 +
 .../Sidekick_backend/Dot/Default/index.html   |   2 +
 .../Dot/Make/argument-1-S/Atom/index.html     |   2 +
 .../Dot/Make/argument-1-S/Clause/index.html   |   2 +
 .../Dot/Make/argument-1-S/index.html          |   2 +
 .../Dot/Make/argument-2-A/index.html          |   2 +
 sidekick/Sidekick_backend/Dot/Make/index.html |   2 +
 .../Dot/Simple/argument-1-S/Atom/index.html   |   2 +
 .../Dot/Simple/argument-1-S/Clause/index.html |   2 +
 .../Dot/Simple/argument-1-S/index.html        |   2 +
 .../Dot/Simple/argument-2-A/index.html        |   2 +
 .../Sidekick_backend/Dot/Simple/index.html    |   2 +
 sidekick/Sidekick_backend/Dot/index.html      |   2 +
 .../Dot/module-type-Arg/index.html            |   2 +
 .../Dot/module-type-S/index.html              |   2 +
 sidekick/Sidekick_backend/index.html          |   2 +
 .../.jbuilder-keep                            |   0
 .../Sidekick_backend__Backend_intf/index.html |   2 +
 .../module-type-S/index.html                  |   2 +
 sidekick/Sidekick_backend__Coq/.jbuilder-keep |   0
 .../Make/argument-1-S/Atom/index.html         |   2 +
 .../Make/argument-1-S/Clause/index.html       |   2 +
 .../Make/argument-1-S/index.html              |   2 +
 .../Make/argument-2-A/index.html              |   2 +
 .../Sidekick_backend__Coq/Make/index.html     |   2 +
 .../Simple/argument-1-S/Atom/index.html       |   2 +
 .../Simple/argument-1-S/Clause/index.html     |   2 +
 .../Simple/argument-1-S/index.html            |   2 +
 .../Simple/argument-2-A/index.html            |   2 +
 .../Sidekick_backend__Coq/Simple/index.html   |   2 +
 sidekick/Sidekick_backend__Coq/index.html     |   2 +
 .../module-type-Arg/index.html                |   2 +
 .../module-type-S/index.html                  |   2 +
 .../Sidekick_backend__Dedukti/.jbuilder-keep  |   0
 .../Make/argument-1-S/Atom/index.html         |   2 +
 .../Make/argument-1-S/Clause/index.html       |   2 +
 .../Make/argument-1-S/index.html              |   2 +
 .../Make/argument-2-A/index.html              |   2 +
 .../Sidekick_backend__Dedukti/Make/index.html |   2 +
 sidekick/Sidekick_backend__Dedukti/index.html |   2 +
 .../module-type-Arg/index.html                |   2 +
 .../module-type-S/index.html                  |   2 +
 .../Sidekick_backend__Dimacs/.jbuilder-keep   |   0
 .../Make/argument-1-St/Atom/index.html        |   2 +
 .../Make/argument-1-St/Clause/index.html      |   2 +
 .../Make/argument-1-St/Formula/index.html     |   2 +
 .../Make/argument-1-St/Var/index.html         |   2 +
 .../Make/argument-1-St/index.html             |   2 +
 .../Sidekick_backend__Dimacs/Make/index.html  |   2 +
 sidekick/Sidekick_backend__Dimacs/index.html  |   2 +
 .../module-type-S/index.html                  |   2 +
 sidekick/Sidekick_backend__Dot/.jbuilder-keep |   0
 .../Default/argument-1-S/Atom/index.html      |   2 +
 .../Default/argument-1-S/Clause/index.html    |   2 +
 .../Default/argument-1-S/index.html           |   2 +
 .../Sidekick_backend__Dot/Default/index.html  |   2 +
 .../Make/argument-1-S/Atom/index.html         |   2 +
 .../Make/argument-1-S/Clause/index.html       |   2 +
 .../Make/argument-1-S/index.html              |   2 +
 .../Make/argument-2-A/index.html              |   2 +
 .../Sidekick_backend__Dot/Make/index.html     |   2 +
 .../Simple/argument-1-S/Atom/index.html       |   2 +
 .../Simple/argument-1-S/Clause/index.html     |   2 +
 .../Simple/argument-1-S/index.html            |   2 +
 .../Simple/argument-2-A/index.html            |   2 +
 .../Sidekick_backend__Dot/Simple/index.html   |   2 +
 sidekick/Sidekick_backend__Dot/index.html     |   2 +
 .../module-type-Arg/index.html                |   2 +
 .../module-type-S/index.html                  |   2 +
 sidekick/Sidekick_dimacs/.jbuilder-keep       |   0
 sidekick/Sidekick_dimacs/index.html           |   2 +
 sidekick/Sidekick_dimacs__/.jbuilder-keep     |   0
 sidekick/Sidekick_dimacs__/Lexer/index.html   |   2 +
 sidekick/Sidekick_dimacs__/Parser/index.html  |   2 +
 sidekick/Sidekick_dimacs__/index.html         |   2 +
 .../Sidekick_dimacs__Lexer/.jbuilder-keep     |   0
 sidekick/Sidekick_dimacs__Lexer/index.html    |   2 +
 .../Sidekick_dimacs__Parser/.jbuilder-keep    |   0
 sidekick/Sidekick_dimacs__Parser/index.html   |   2 +
 sidekick/Sidekick_sat/.jbuilder-keep          |   0
 sidekick/Sidekick_sat/Make/Clause/index.html  |   2 +
 sidekick/Sidekick_sat/Make/Formula/index.html |   2 +
 sidekick/Sidekick_sat/Make/Lit/index.html     |   2 +
 .../Sidekick_sat/Make/Proof/Atom/index.html   |   2 +
 .../Make/Proof/Clause/Tbl/index.html          |   2 +
 .../Sidekick_sat/Make/Proof/Clause/index.html |   2 +
 .../Sidekick_sat/Make/Proof/Tbl/index.html    |   2 +
 sidekick/Sidekick_sat/Make/Proof/index.html   |   2 +
 .../Make/argument-1-E/Form/index.html         |   2 +
 .../Sidekick_sat/Make/argument-1-E/index.html |   2 +
 sidekick/Sidekick_sat/Make/index.html         |   2 +
 .../Sidekick_sat/Res/Make/Atom/index.html     |   2 +
 .../Sidekick_sat/Res/Make/Clause/index.html   |   2 +
 .../Res/Make/argument-1-St/Atom/index.html    |   2 +
 .../Res/Make/argument-1-St/Clause/index.html  |   2 +
 .../Res/Make/argument-1-St/Formula/index.html |   2 +
 .../Res/Make/argument-1-St/Var/index.html     |   2 +
 .../Res/Make/argument-1-St/index.html         |   2 +
 sidekick/Sidekick_sat/Res/Make/index.html     |   2 +
 sidekick/Sidekick_sat/Res/index.html          |   2 +
 .../Res/module-type-FULL/Atom/index.html      |   2 +
 .../Res/module-type-FULL/Clause/index.html    |   2 +
 .../Res/module-type-FULL/St/Atom/index.html   |   2 +
 .../Res/module-type-FULL/St/Clause/index.html |   2 +
 .../module-type-FULL/St/Formula/index.html    |   2 +
 .../Res/module-type-FULL/St/Var/index.html    |   2 +
 .../Res/module-type-FULL/St/index.html        |   2 +
 .../Res/module-type-FULL/index.html           |   2 +
 .../Res/module-type-S/Atom/index.html         |   2 +
 .../Res/module-type-S/Clause/index.html       |   2 +
 .../Sidekick_sat/Res/module-type-S/index.html |   2 +
 .../Solver_types_intf/C_fields/index.html     |   2 +
 .../Solver_types_intf/Var_fields/index.html   |   2 +
 .../Sidekick_sat/Solver_types_intf/index.html |   2 +
 .../module-type-S/Atom/index.html             |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/Formula/index.html          |   2 +
 .../module-type-S/Var/index.html              |   2 +
 .../module-type-S/index.html                  |   2 +
 sidekick/Sidekick_sat/Theory_intf/index.html  |   2 +
 .../Theory_intf/module-type-S/Form/index.html |   2 +
 .../Theory_intf/module-type-S/index.html      |   2 +
 sidekick/Sidekick_sat/index.html              |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/Formula/index.html          |   2 +
 .../Sidekick_sat/module-type-S/Lit/index.html |   2 +
 .../module-type-S/Proof/Atom/index.html       |   2 +
 .../module-type-S/Proof/Clause/index.html     |   2 +
 .../module-type-S/Proof/index.html            |   2 +
 .../Sidekick_sat/module-type-S/index.html     |   2 +
 sidekick/Sidekick_sat__/.jbuilder-keep        |   0
 .../Sidekick_sat__/Internal/Make/H/index.html |   2 +
 .../Internal/Make/Proof/Atom/index.html       |   2 +
 .../Internal/Make/Proof/Clause/Tbl/index.html |   2 +
 .../Internal/Make/Proof/Clause/index.html     |   2 +
 .../Internal/Make/Proof/St/Atom/index.html    |   2 +
 .../Make/Proof/St/Clause/Tbl/index.html       |   2 +
 .../Internal/Make/Proof/St/Clause/index.html  |   2 +
 .../Internal/Make/Proof/St/Formula/index.html |   2 +
 .../Internal/Make/Proof/St/Var/index.html     |   2 +
 .../Internal/Make/Proof/St/index.html         |   2 +
 .../Internal/Make/Proof/Tbl/index.html        |   2 +
 .../Internal/Make/Proof/index.html            |   2 +
 .../Make/argument-1-St/Atom/index.html        |   2 +
 .../Make/argument-1-St/Clause/index.html      |   2 +
 .../Make/argument-1-St/Formula/index.html     |   2 +
 .../Make/argument-1-St/Var/index.html         |   2 +
 .../Internal/Make/argument-1-St/index.html    |   2 +
 .../Make/argument-2-Th/Form/index.html        |   2 +
 .../Internal/Make/argument-2-Th/index.html    |   2 +
 .../Sidekick_sat__/Internal/Make/index.html   |   2 +
 sidekick/Sidekick_sat__/Internal/index.html   |   2 +
 .../Sidekick_sat__/Res/Make/Atom/index.html   |   2 +
 .../Sidekick_sat__/Res/Make/Clause/index.html |   2 +
 .../Res/Make/argument-1-St/Atom/index.html    |   2 +
 .../Res/Make/argument-1-St/Clause/index.html  |   2 +
 .../Res/Make/argument-1-St/Formula/index.html |   2 +
 .../Res/Make/argument-1-St/Var/index.html     |   2 +
 .../Res/Make/argument-1-St/index.html         |   2 +
 sidekick/Sidekick_sat__/Res/Make/index.html   |   2 +
 sidekick/Sidekick_sat__/Res/index.html        |   2 +
 .../Res/module-type-FULL/Atom/index.html      |   2 +
 .../Res/module-type-FULL/Clause/index.html    |   2 +
 .../Res/module-type-FULL/St/Atom/index.html   |   2 +
 .../Res/module-type-FULL/St/Clause/index.html |   2 +
 .../module-type-FULL/St/Formula/index.html    |   2 +
 .../Res/module-type-FULL/St/Var/index.html    |   2 +
 .../Res/module-type-FULL/St/index.html        |   2 +
 .../Res/module-type-FULL/index.html           |   2 +
 .../Res/module-type-S/Atom/index.html         |   2 +
 .../Res/module-type-S/Clause/index.html       |   2 +
 .../Res/module-type-S/index.html              |   2 +
 sidekick/Sidekick_sat__/Res_intf/index.html   |   2 +
 .../Res_intf/module-type-FULL/Atom/index.html |   2 +
 .../module-type-FULL/Clause/index.html        |   2 +
 .../module-type-FULL/St/Atom/index.html       |   2 +
 .../module-type-FULL/St/Clause/index.html     |   2 +
 .../module-type-FULL/St/Formula/index.html    |   2 +
 .../module-type-FULL/St/Var/index.html        |   2 +
 .../Res_intf/module-type-FULL/St/index.html   |   2 +
 .../Res_intf/module-type-FULL/index.html      |   2 +
 .../Res_intf/module-type-S/Atom/index.html    |   2 +
 .../Res_intf/module-type-S/Clause/index.html  |   2 +
 .../Res_intf/module-type-S/index.html         |   2 +
 .../Solver/Make/Clause/index.html             |   2 +
 .../Solver/Make/Formula/index.html            |   2 +
 .../Sidekick_sat__/Solver/Make/Lit/index.html |   2 +
 .../Solver/Make/Proof/Atom/index.html         |   2 +
 .../Solver/Make/Proof/Clause/index.html       |   2 +
 .../Solver/Make/Proof/index.html              |   2 +
 .../Solver/Make/argument-1-St/Atom/index.html |   2 +
 .../Make/argument-1-St/Clause/index.html      |   2 +
 .../Make/argument-1-St/Formula/index.html     |   2 +
 .../Solver/Make/argument-1-St/Var/index.html  |   2 +
 .../Solver/Make/argument-1-St/index.html      |   2 +
 .../Solver/Make/argument-2-Th/Form/index.html |   2 +
 .../Solver/Make/argument-2-Th/index.html      |   2 +
 .../Sidekick_sat__/Solver/Make/index.html     |   2 +
 sidekick/Sidekick_sat__/Solver/index.html     |   2 +
 .../Solver/module-type-S/Clause/index.html    |   2 +
 .../Solver/module-type-S/Formula/index.html   |   2 +
 .../Solver/module-type-S/Lit/index.html       |   2 +
 .../module-type-S/Proof/Atom/index.html       |   2 +
 .../module-type-S/Proof/Clause/index.html     |   2 +
 .../Solver/module-type-S/Proof/index.html     |   2 +
 .../Solver/module-type-S/index.html           |   2 +
 .../Sidekick_sat__/Solver_intf/index.html     |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/Formula/index.html          |   2 +
 .../Solver_intf/module-type-S/Lit/index.html  |   2 +
 .../module-type-S/Proof/Atom/index.html       |   2 +
 .../module-type-S/Proof/Clause/index.html     |   2 +
 .../module-type-S/Proof/index.html            |   2 +
 .../Solver_intf/module-type-S/index.html      |   2 +
 .../Solver_types/Make/Atom/index.html         |   2 +
 .../Solver_types/Make/Clause/index.html       |   2 +
 .../Solver_types/Make/Formula/index.html      |   2 +
 .../Solver_types/Make/Var/index.html          |   2 +
 .../Make/argument-1-E/Form/index.html         |   2 +
 .../Solver_types/Make/argument-1-E/index.html |   2 +
 .../Solver_types/Make/index.html              |   2 +
 .../Sidekick_sat__/Solver_types/index.html    |   2 +
 .../module-type-S/Atom/index.html             |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/Formula/index.html          |   2 +
 .../Solver_types/module-type-S/Var/index.html |   2 +
 .../Solver_types/module-type-S/index.html     |   2 +
 .../Solver_types_intf/C_fields/index.html     |   2 +
 .../Solver_types_intf/Var_fields/index.html   |   2 +
 .../Solver_types_intf/index.html              |   2 +
 .../module-type-S/Atom/index.html             |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/Formula/index.html          |   2 +
 .../module-type-S/Var/index.html              |   2 +
 .../module-type-S/index.html                  |   2 +
 .../Sidekick_sat__/Theory_intf/index.html     |   2 +
 .../Theory_intf/module-type-S/Form/index.html |   2 +
 .../Theory_intf/module-type-S/index.html      |   2 +
 sidekick/Sidekick_sat__/index.html            |   2 +
 .../Sidekick_sat__Internal/.jbuilder-keep     |   0
 .../Sidekick_sat__Internal/Make/H/index.html  |   2 +
 .../Make/Proof/Atom/index.html                |   2 +
 .../Make/Proof/Clause/Tbl/index.html          |   2 +
 .../Make/Proof/Clause/index.html              |   2 +
 .../Make/Proof/St/Atom/index.html             |   2 +
 .../Make/Proof/St/Clause/Tbl/index.html       |   2 +
 .../Make/Proof/St/Clause/index.html           |   2 +
 .../Make/Proof/St/Formula/index.html          |   2 +
 .../Make/Proof/St/Var/index.html              |   2 +
 .../Make/Proof/St/index.html                  |   2 +
 .../Make/Proof/Tbl/index.html                 |   2 +
 .../Make/Proof/index.html                     |   2 +
 .../Make/argument-1-St/Atom/index.html        |   2 +
 .../Make/argument-1-St/Clause/index.html      |   2 +
 .../Make/argument-1-St/Formula/index.html     |   2 +
 .../Make/argument-1-St/Var/index.html         |   2 +
 .../Make/argument-1-St/index.html             |   2 +
 .../Make/argument-2-Th/Form/index.html        |   2 +
 .../Make/argument-2-Th/index.html             |   2 +
 .../Sidekick_sat__Internal/Make/index.html    |   2 +
 sidekick/Sidekick_sat__Internal/index.html    |   2 +
 sidekick/Sidekick_sat__Res/.jbuilder-keep     |   0
 .../Sidekick_sat__Res/Make/Atom/index.html    |   2 +
 .../Sidekick_sat__Res/Make/Clause/index.html  |   2 +
 .../Make/argument-1-St/Atom/index.html        |   2 +
 .../Make/argument-1-St/Clause/index.html      |   2 +
 .../Make/argument-1-St/Formula/index.html     |   2 +
 .../Make/argument-1-St/Var/index.html         |   2 +
 .../Make/argument-1-St/index.html             |   2 +
 sidekick/Sidekick_sat__Res/Make/index.html    |   2 +
 sidekick/Sidekick_sat__Res/index.html         |   2 +
 .../module-type-FULL/Atom/index.html          |   2 +
 .../module-type-FULL/Clause/index.html        |   2 +
 .../module-type-FULL/St/Atom/index.html       |   2 +
 .../module-type-FULL/St/Clause/index.html     |   2 +
 .../module-type-FULL/St/Formula/index.html    |   2 +
 .../module-type-FULL/St/Var/index.html        |   2 +
 .../module-type-FULL/St/index.html            |   2 +
 .../module-type-FULL/index.html               |   2 +
 .../module-type-S/Atom/index.html             |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/index.html                  |   2 +
 .../Sidekick_sat__Res_intf/.jbuilder-keep     |   0
 sidekick/Sidekick_sat__Res_intf/index.html    |   2 +
 .../module-type-FULL/Atom/index.html          |   2 +
 .../module-type-FULL/Clause/index.html        |   2 +
 .../module-type-FULL/St/Atom/index.html       |   2 +
 .../module-type-FULL/St/Clause/index.html     |   2 +
 .../module-type-FULL/St/Formula/index.html    |   2 +
 .../module-type-FULL/St/Var/index.html        |   2 +
 .../module-type-FULL/St/index.html            |   2 +
 .../module-type-FULL/index.html               |   2 +
 .../module-type-S/Atom/index.html             |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/index.html                  |   2 +
 sidekick/Sidekick_sat__Solver/.jbuilder-keep  |   0
 .../Make/Clause/index.html                    |   2 +
 .../Make/Formula/index.html                   |   2 +
 .../Sidekick_sat__Solver/Make/Lit/index.html  |   2 +
 .../Make/Proof/Atom/index.html                |   2 +
 .../Make/Proof/Clause/index.html              |   2 +
 .../Make/Proof/index.html                     |   2 +
 .../Make/argument-1-St/Atom/index.html        |   2 +
 .../Make/argument-1-St/Clause/index.html      |   2 +
 .../Make/argument-1-St/Formula/index.html     |   2 +
 .../Make/argument-1-St/Var/index.html         |   2 +
 .../Make/argument-1-St/index.html             |   2 +
 .../Make/argument-2-Th/Form/index.html        |   2 +
 .../Make/argument-2-Th/index.html             |   2 +
 sidekick/Sidekick_sat__Solver/Make/index.html |   2 +
 sidekick/Sidekick_sat__Solver/index.html      |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/Formula/index.html          |   2 +
 .../module-type-S/Lit/index.html              |   2 +
 .../module-type-S/Proof/Atom/index.html       |   2 +
 .../module-type-S/Proof/Clause/index.html     |   2 +
 .../module-type-S/Proof/index.html            |   2 +
 .../module-type-S/index.html                  |   2 +
 .../Sidekick_sat__Solver_intf/.jbuilder-keep  |   0
 sidekick/Sidekick_sat__Solver_intf/index.html |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/Formula/index.html          |   2 +
 .../module-type-S/Lit/index.html              |   2 +
 .../module-type-S/Proof/Atom/index.html       |   2 +
 .../module-type-S/Proof/Clause/index.html     |   2 +
 .../module-type-S/Proof/index.html            |   2 +
 .../module-type-S/index.html                  |   2 +
 .../Sidekick_sat__Solver_types/.jbuilder-keep |   0
 .../Make/Atom/index.html                      |   2 +
 .../Make/Clause/index.html                    |   2 +
 .../Make/Formula/index.html                   |   2 +
 .../Make/Var/index.html                       |   2 +
 .../Make/argument-1-E/Form/index.html         |   2 +
 .../Make/argument-1-E/index.html              |   2 +
 .../Make/index.html                           |   2 +
 .../Sidekick_sat__Solver_types/index.html     |   2 +
 .../module-type-S/Atom/index.html             |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/Formula/index.html          |   2 +
 .../module-type-S/Var/index.html              |   2 +
 .../module-type-S/index.html                  |   2 +
 .../.jbuilder-keep                            |   0
 .../C_fields/index.html                       |   2 +
 .../Var_fields/index.html                     |   2 +
 .../index.html                                |   2 +
 .../module-type-S/Atom/index.html             |   2 +
 .../module-type-S/Clause/index.html           |   2 +
 .../module-type-S/Formula/index.html          |   2 +
 .../module-type-S/Var/index.html              |   2 +
 .../module-type-S/index.html                  |   2 +
 .../Sidekick_sat__Theory_intf/.jbuilder-keep  |   0
 sidekick/Sidekick_sat__Theory_intf/index.html |   2 +
 .../module-type-S/Form/index.html             |   2 +
 .../module-type-S/index.html                  |   2 +
 sidekick/Sidekick_smt/.jbuilder-keep          |   0
 sidekick/Sidekick_smt/Ast/index.html          |   2 +
 sidekick/Sidekick_smt/Bag/index.html          |   2 +
 sidekick/Sidekick_smt/Config/index.html       |   2 +
 .../Congruence_closure/index.html             |   2 +
 sidekick/Sidekick_smt/Cst/index.html          |   2 +
 sidekick/Sidekick_smt/Equiv_class/index.html  |   2 +
 .../Sidekick_smt/Explanation/Set/index.html   |   2 +
 sidekick/Sidekick_smt/Explanation/index.html  |   2 +
 sidekick/Sidekick_smt/Hash/index.html         |   2 +
 sidekick/Sidekick_smt/Het_map/index.html      |   2 +
 sidekick/Sidekick_smt/Lit/index.html          |   2 +
 sidekick/Sidekick_smt/Model/index.html        |   2 +
 sidekick/Sidekick_smt/Solver/index.html       |   2 +
 sidekick/Sidekick_smt/Solver_types/index.html |   2 +
 sidekick/Sidekick_smt/Stat/index.html         |   2 +
 sidekick/Sidekick_smt/Term/index.html         |   2 +
 .../Term_cell/Make_eq/argument-1-X/index.html |   2 +
 .../Sidekick_smt/Term_cell/Make_eq/index.html |   2 +
 sidekick/Sidekick_smt/Term_cell/index.html    |   2 +
 .../Term_cell/module-type-ARG/index.html      |   2 +
 .../Sidekick_smt/Theory/Clause/index.html     |   2 +
 sidekick/Sidekick_smt/Theory/index.html       |   2 +
 .../Sidekick_smt/Theory_combine/index.html    |   2 +
 sidekick/Sidekick_smt/Ty/index.html           |   2 +
 sidekick/Sidekick_smt/Ty_card/index.html      |   2 +
 sidekick/Sidekick_smt/index.html              |   2 +
 sidekick/Sidekick_smt__Ast/.jbuilder-keep     |   0
 sidekick/Sidekick_smt__Ast/Ty/index.html      |   2 +
 sidekick/Sidekick_smt__Ast/Var/index.html     |   2 +
 sidekick/Sidekick_smt__Ast/index.html         |   2 +
 sidekick/Sidekick_smt__Bag/.jbuilder-keep     |   0
 sidekick/Sidekick_smt__Bag/index.html         |   2 +
 sidekick/Sidekick_smt__Config/.jbuilder-keep  |   0
 sidekick/Sidekick_smt__Config/Key/index.html  |   2 +
 sidekick/Sidekick_smt__Config/index.html      |   2 +
 .../.jbuilder-keep                            |   0
 .../index.html                                |   2 +
 sidekick/Sidekick_smt__Cst/.jbuilder-keep     |   0
 sidekick/Sidekick_smt__Cst/index.html         |   2 +
 .../Sidekick_smt__Equiv_class/.jbuilder-keep  |   0
 sidekick/Sidekick_smt__Equiv_class/index.html |   2 +
 .../Sidekick_smt__Explanation/.jbuilder-keep  |   0
 .../Sidekick_smt__Explanation/Set/index.html  |   2 +
 sidekick/Sidekick_smt__Explanation/index.html |   2 +
 sidekick/Sidekick_smt__Hash/.jbuilder-keep    |   0
 sidekick/Sidekick_smt__Hash/index.html        |   2 +
 sidekick/Sidekick_smt__Het_map/.jbuilder-keep |   0
 sidekick/Sidekick_smt__Het_map/Key/index.html |   2 +
 sidekick/Sidekick_smt__Het_map/Map/index.html |   2 +
 sidekick/Sidekick_smt__Het_map/Tbl/index.html |   2 +
 sidekick/Sidekick_smt__Het_map/index.html     |   2 +
 sidekick/Sidekick_smt__Lit/.jbuilder-keep     |   0
 sidekick/Sidekick_smt__Lit/index.html         |   2 +
 sidekick/Sidekick_smt__Model/.jbuilder-keep   |   0
 sidekick/Sidekick_smt__Model/index.html       |   2 +
 sidekick/Sidekick_smt__Solver/.jbuilder-keep  |   0
 .../Sidekick_smt__Solver/Proof/index.html     |   2 +
 .../Sat_solver/Clause/index.html              |   2 +
 .../Sat_solver/Formula/index.html             |   2 +
 .../Sat_solver/Lit/index.html                 |   2 +
 .../Sat_solver/Proof/Atom/index.html          |   2 +
 .../Sat_solver/Proof/Clause/index.html        |   2 +
 .../Sat_solver/Proof/index.html               |   2 +
 .../Sat_solver/index.html                     |   2 +
 sidekick/Sidekick_smt__Solver/index.html      |   2 +
 .../Sidekick_smt__Solver_types/.jbuilder-keep |   0
 .../Sidekick_smt__Solver_types/index.html     |   2 +
 sidekick/Sidekick_smt__Stat/.jbuilder-keep    |   0
 sidekick/Sidekick_smt__Stat/index.html        |   2 +
 sidekick/Sidekick_smt__Term/.jbuilder-keep    |   0
 sidekick/Sidekick_smt__Term/index.html        |   2 +
 .../Sidekick_smt__Term_cell/.jbuilder-keep    |   0
 .../Make_eq/argument-1-X/index.html           |   2 +
 .../Make_eq/index.html                        |   2 +
 sidekick/Sidekick_smt__Term_cell/index.html   |   2 +
 .../module-type-ARG/index.html                |   2 +
 sidekick/Sidekick_smt__Theory/.jbuilder-keep  |   0
 .../Sidekick_smt__Theory/Clause/index.html    |   2 +
 sidekick/Sidekick_smt__Theory/index.html      |   2 +
 .../.jbuilder-keep                            |   0
 .../Form/index.html                           |   2 +
 .../Proof/index.html                          |   2 +
 .../Sidekick_smt__Theory_combine/index.html   |   2 +
 sidekick/Sidekick_smt__Ty/.jbuilder-keep      |   0
 sidekick/Sidekick_smt__Ty/index.html          |   2 +
 sidekick/Sidekick_smt__Ty_card/.jbuilder-keep |   0
 sidekick/Sidekick_smt__Ty_card/index.html     |   2 +
 sidekick/Sidekick_smtlib/.jbuilder-keep       |   0
 sidekick/Sidekick_smtlib/Process/index.html   |   2 +
 sidekick/Sidekick_smtlib/index.html           |   2 +
 sidekick/Sidekick_smtlib__/.jbuilder-keep     |   0
 sidekick/Sidekick_smtlib__/Lexer/index.html   |   2 +
 .../Sidekick_smtlib__/Locations/index.html    |   2 +
 .../Sidekick_smtlib__/Parse_ast/index.html    |   2 +
 sidekick/Sidekick_smtlib__/Parser/index.html  |   2 +
 sidekick/Sidekick_smtlib__/Process/index.html |   2 +
 .../Sidekick_smtlib__/Typecheck/index.html    |   2 +
 sidekick/Sidekick_smtlib__/index.html         |   2 +
 .../Sidekick_smtlib__Lexer/.jbuilder-keep     |   0
 sidekick/Sidekick_smtlib__Lexer/index.html    |   2 +
 .../Sidekick_smtlib__Locations/.jbuilder-keep |   0
 .../Sidekick_smtlib__Locations/index.html     |   2 +
 .../Sidekick_smtlib__Parse_ast/.jbuilder-keep |   0
 .../Sidekick_smtlib__Parse_ast/index.html     |   2 +
 .../Sidekick_smtlib__Parser/.jbuilder-keep    |   0
 sidekick/Sidekick_smtlib__Parser/index.html   |   2 +
 .../Sidekick_smtlib__Process/.jbuilder-keep   |   0
 sidekick/Sidekick_smtlib__Process/index.html  |   2 +
 .../Sidekick_smtlib__Typecheck/.jbuilder-keep |   0
 .../Sidekick_smtlib__Typecheck/Ctx/index.html |   2 +
 .../Sidekick_smtlib__Typecheck/index.html     |   2 +
 sidekick/Sidekick_th_bool/.jbuilder-keep      |   0
 sidekick/Sidekick_th_bool/Lit/index.html      |   2 +
 sidekick/Sidekick_th_bool/T_cell/index.html   |   2 +
 sidekick/Sidekick_th_bool/index.html          |   2 +
 sidekick/Sidekick_util/.jbuilder-keep         |   0
 sidekick/Sidekick_util/BitField/index.html    |   2 +
 .../Heap/Make/argument-1-X/index.html         |   2 +
 sidekick/Sidekick_util/Heap/Make/index.html   |   2 +
 sidekick/Sidekick_util/Heap/index.html        |   2 +
 .../Heap/module-type-RANKED/index.html        |   2 +
 .../Heap/module-type-S/index.html             |   2 +
 sidekick/Sidekick_util/Heap_intf/index.html   |   2 +
 .../Heap_intf/module-type-RANKED/index.html   |   2 +
 .../Heap_intf/module-type-S/index.html        |   2 +
 sidekick/Sidekick_util/IArray/index.html      |   2 +
 sidekick/Sidekick_util/ID/index.html          |   2 +
 sidekick/Sidekick_util/Intf/index.html        |   2 +
 .../Intf/module-type-EQ/index.html            |   2 +
 .../Intf/module-type-HASH/index.html          |   2 +
 .../Intf/module-type-ORD/index.html           |   2 +
 .../Intf/module-type-PRINT/index.html         |   2 +
 sidekick/Sidekick_util/Log/index.html         |   2 +
 sidekick/Sidekick_util/Util/index.html        |   2 +
 sidekick/Sidekick_util/Vec/index.html         |   2 +
 sidekick/Sidekick_util/index.html             |   2 +
 .../Sidekick_util__BitField/.jbuilder-keep    |   0
 .../Sidekick_util__BitField/Make/index.html   |   2 +
 sidekick/Sidekick_util__BitField/index.html   |  14 +
 .../module-type-S/index.html                  |   2 +
 sidekick/Sidekick_util__Heap/.jbuilder-keep   |   0
 .../Make/argument-1-X/index.html              |   2 +
 sidekick/Sidekick_util__Heap/Make/index.html  |   2 +
 sidekick/Sidekick_util__Heap/index.html       |   2 +
 .../module-type-RANKED/index.html             |   2 +
 .../module-type-S/index.html                  |   2 +
 .../Sidekick_util__Heap_intf/.jbuilder-keep   |   0
 sidekick/Sidekick_util__Heap_intf/index.html  |   2 +
 .../module-type-RANKED/index.html             |   2 +
 .../module-type-S/index.html                  |   2 +
 sidekick/Sidekick_util__IArray/.jbuilder-keep |   0
 sidekick/Sidekick_util__IArray/index.html     |   2 +
 sidekick/Sidekick_util__ID/.jbuilder-keep     |   0
 sidekick/Sidekick_util__ID/B/index.html       |   2 +
 sidekick/Sidekick_util__ID/index.html         |   2 +
 sidekick/Sidekick_util__Intf/.jbuilder-keep   |   0
 sidekick/Sidekick_util__Intf/index.html       |   2 +
 .../module-type-EQ/index.html                 |   2 +
 .../module-type-HASH/index.html               |   2 +
 .../module-type-ORD/index.html                |   2 +
 .../module-type-PRINT/index.html              |   2 +
 sidekick/Sidekick_util__Log/.jbuilder-keep    |   0
 sidekick/Sidekick_util__Log/index.html        |   2 +
 sidekick/Sidekick_util__Util/.jbuilder-keep   |   0
 sidekick/Sidekick_util__Util/index.html       |   2 +
 sidekick/Sidekick_util__Vec/.jbuilder-keep    |   0
 sidekick/Sidekick_util__Vec/index.html        |   2 +
 sidekick/index.html                           |   2 +
 579 files changed, 1321 insertions(+)
 create mode 100644 highlight.pack.js
 create mode 100644 index.html
 create mode 100644 odoc.css
 create mode 100644 sidekick/CDCL_tseitin/.jbuilder-keep
 create mode 100644 sidekick/CDCL_tseitin/Make/argument-1-A/Form/index.html
 create mode 100644 sidekick/CDCL_tseitin/Make/argument-1-A/index.html
 create mode 100644 sidekick/CDCL_tseitin/Make/index.html
 create mode 100644 sidekick/CDCL_tseitin/index.html
 create mode 100644 sidekick/CDCL_tseitin/module-type-Arg/Form/index.html
 create mode 100644 sidekick/CDCL_tseitin/module-type-Arg/index.html
 create mode 100644 sidekick/CDCL_tseitin/module-type-S/index.html
 create mode 100644 sidekick/CDCL_tseitin__/.jbuilder-keep
 create mode 100644 sidekick/CDCL_tseitin__/Tseitin_intf/index.html
 create mode 100644 sidekick/CDCL_tseitin__/Tseitin_intf/module-type-Arg/Form/index.html
 create mode 100644 sidekick/CDCL_tseitin__/Tseitin_intf/module-type-Arg/index.html
 create mode 100644 sidekick/CDCL_tseitin__/Tseitin_intf/module-type-S/index.html
 create mode 100644 sidekick/CDCL_tseitin__/index.html
 create mode 100644 sidekick/CDCL_tseitin__Tseitin_intf/.jbuilder-keep
 create mode 100644 sidekick/CDCL_tseitin__Tseitin_intf/index.html
 create mode 100644 sidekick/CDCL_tseitin__Tseitin_intf/module-type-Arg/Form/index.html
 create mode 100644 sidekick/CDCL_tseitin__Tseitin_intf/module-type-Arg/index.html
 create mode 100644 sidekick/CDCL_tseitin__Tseitin_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_backend/Backend_intf/index.html
 create mode 100644 sidekick/Sidekick_backend/Backend_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Make/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Make/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Make/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Make/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Make/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Simple/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Simple/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Simple/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Simple/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/Simple/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/module-type-Arg/index.html
 create mode 100644 sidekick/Sidekick_backend/Coq/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Dedukti/Make/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend/Dedukti/Make/index.html
 create mode 100644 sidekick/Sidekick_backend/Dedukti/index.html
 create mode 100644 sidekick/Sidekick_backend/Dedukti/module-type-Arg/index.html
 create mode 100644 sidekick/Sidekick_backend/Dedukti/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Formula/index.html
 create mode 100644 sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Var/index.html
 create mode 100644 sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/index.html
 create mode 100644 sidekick/Sidekick_backend/Dimacs/Make/index.html
 create mode 100644 sidekick/Sidekick_backend/Dimacs/index.html
 create mode 100644 sidekick/Sidekick_backend/Dimacs/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Default/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Default/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Default/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Default/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Make/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Make/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Make/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Make/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Make/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Simple/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Simple/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Simple/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Simple/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/Simple/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/module-type-Arg/index.html
 create mode 100644 sidekick/Sidekick_backend/Dot/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend/index.html
 create mode 100644 sidekick/Sidekick_backend__Backend_intf/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_backend__Backend_intf/index.html
 create mode 100644 sidekick/Sidekick_backend__Backend_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_backend__Coq/Make/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/Make/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/Make/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/Make/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/Make/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/Simple/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/Simple/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/Simple/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/Simple/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/Simple/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/module-type-Arg/index.html
 create mode 100644 sidekick/Sidekick_backend__Coq/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Dedukti/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Dedukti/Make/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend__Dedukti/Make/index.html
 create mode 100644 sidekick/Sidekick_backend__Dedukti/index.html
 create mode 100644 sidekick/Sidekick_backend__Dedukti/module-type-Arg/index.html
 create mode 100644 sidekick/Sidekick_backend__Dedukti/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Dimacs/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Formula/index.html
 create mode 100644 sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Var/index.html
 create mode 100644 sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/index.html
 create mode 100644 sidekick/Sidekick_backend__Dimacs/Make/index.html
 create mode 100644 sidekick/Sidekick_backend__Dimacs/index.html
 create mode 100644 sidekick/Sidekick_backend__Dimacs/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_backend__Dot/Default/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Default/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Default/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Default/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Make/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Make/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Make/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Make/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Make/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Simple/argument-1-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Simple/argument-1-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Simple/argument-1-S/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Simple/argument-2-A/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/Simple/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/module-type-Arg/index.html
 create mode 100644 sidekick/Sidekick_backend__Dot/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_dimacs/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_dimacs/index.html
 create mode 100644 sidekick/Sidekick_dimacs__/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_dimacs__/Lexer/index.html
 create mode 100644 sidekick/Sidekick_dimacs__/Parser/index.html
 create mode 100644 sidekick/Sidekick_dimacs__/index.html
 create mode 100644 sidekick/Sidekick_dimacs__Lexer/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_dimacs__Lexer/index.html
 create mode 100644 sidekick/Sidekick_dimacs__Parser/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_dimacs__Parser/index.html
 create mode 100644 sidekick/Sidekick_sat/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat/Make/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/Lit/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/Proof/Clause/Tbl/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/Proof/Tbl/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/argument-1-E/Form/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/argument-1-E/index.html
 create mode 100644 sidekick/Sidekick_sat/Make/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/Make/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/Make/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/Make/argument-1-St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/Make/argument-1-St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/Make/argument-1-St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/Make/argument-1-St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/Make/argument-1-St/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/Make/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-FULL/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-FULL/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-FULL/St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-FULL/St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-FULL/St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-FULL/St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-FULL/St/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-FULL/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/Res/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat/Solver_types_intf/C_fields/index.html
 create mode 100644 sidekick/Sidekick_sat/Solver_types_intf/Var_fields/index.html
 create mode 100644 sidekick/Sidekick_sat/Solver_types_intf/index.html
 create mode 100644 sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Var/index.html
 create mode 100644 sidekick/Sidekick_sat/Solver_types_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat/Theory_intf/index.html
 create mode 100644 sidekick/Sidekick_sat/Theory_intf/module-type-S/Form/index.html
 create mode 100644 sidekick/Sidekick_sat/Theory_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat/index.html
 create mode 100644 sidekick/Sidekick_sat/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat/module-type-S/Lit/index.html
 create mode 100644 sidekick/Sidekick_sat/module-type-S/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat/module-type-S/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat/module-type-S/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/H/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/Clause/Tbl/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/St/Clause/Tbl/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/St/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/Tbl/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/argument-1-St/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/argument-2-Th/Form/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/argument-2-Th/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/Make/index.html
 create mode 100644 sidekick/Sidekick_sat__/Internal/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/Make/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/Make/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/Make/argument-1-St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/Make/argument-1-St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/Make/argument-1-St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/Make/argument-1-St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/Make/argument-1-St/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/Make/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-FULL/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-FULL/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-FULL/St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-FULL/St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-FULL/St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-FULL/St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-FULL/St/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-FULL/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-FULL/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-FULL/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-FULL/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Res_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/Lit/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/argument-1-St/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/argument-2-Th/Form/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/argument-2-Th/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/Make/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/module-type-S/Lit/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/module-type-S/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/module-type-S/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/module-type-S/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_intf/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_intf/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_intf/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_intf/module-type-S/Lit/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/Make/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/Make/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/Make/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/Make/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/Make/argument-1-E/Form/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/Make/argument-1-E/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/Make/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/module-type-S/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types_intf/C_fields/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types_intf/Var_fields/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types_intf/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__/Theory_intf/index.html
 create mode 100644 sidekick/Sidekick_sat__/Theory_intf/module-type-S/Form/index.html
 create mode 100644 sidekick/Sidekick_sat__/Theory_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/H/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/Clause/Tbl/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/St/Clause/Tbl/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/St/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/Tbl/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/argument-1-St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/argument-1-St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/argument-1-St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/argument-1-St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/argument-1-St/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/argument-2-Th/Form/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/argument-2-Th/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/Make/index.html
 create mode 100644 sidekick/Sidekick_sat__Internal/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat__Res/Make/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/Make/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/Make/argument-1-St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/Make/argument-1-St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/Make/argument-1-St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/Make/argument-1-St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/Make/argument-1-St/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/Make/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-FULL/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-FULL/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-FULL/St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-FULL/St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-FULL/St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-FULL/St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-FULL/St/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-FULL/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Res/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat__Res_intf/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-FULL/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-FULL/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-FULL/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Res_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/Lit/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/argument-1-St/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/argument-1-St/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/argument-1-St/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/argument-1-St/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/argument-1-St/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/argument-2-Th/Form/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/argument-2-Th/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/Make/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/module-type-S/Lit/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/module-type-S/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/module-type-S/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/module-type-S/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_intf/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat__Solver_intf/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_intf/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_intf/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_intf/module-type-S/Lit/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat__Solver_types/Make/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/Make/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/Make/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/Make/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/Make/argument-1-E/Form/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/Make/argument-1-E/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/Make/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/module-type-S/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types_intf/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat__Solver_types_intf/C_fields/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types_intf/Var_fields/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types_intf/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Atom/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Clause/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Formula/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Var/index.html
 create mode 100644 sidekick/Sidekick_sat__Solver_types_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_sat__Theory_intf/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_sat__Theory_intf/index.html
 create mode 100644 sidekick/Sidekick_sat__Theory_intf/module-type-S/Form/index.html
 create mode 100644 sidekick/Sidekick_sat__Theory_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_smt/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt/Ast/index.html
 create mode 100644 sidekick/Sidekick_smt/Bag/index.html
 create mode 100644 sidekick/Sidekick_smt/Config/index.html
 create mode 100644 sidekick/Sidekick_smt/Congruence_closure/index.html
 create mode 100644 sidekick/Sidekick_smt/Cst/index.html
 create mode 100644 sidekick/Sidekick_smt/Equiv_class/index.html
 create mode 100644 sidekick/Sidekick_smt/Explanation/Set/index.html
 create mode 100644 sidekick/Sidekick_smt/Explanation/index.html
 create mode 100644 sidekick/Sidekick_smt/Hash/index.html
 create mode 100644 sidekick/Sidekick_smt/Het_map/index.html
 create mode 100644 sidekick/Sidekick_smt/Lit/index.html
 create mode 100644 sidekick/Sidekick_smt/Model/index.html
 create mode 100644 sidekick/Sidekick_smt/Solver/index.html
 create mode 100644 sidekick/Sidekick_smt/Solver_types/index.html
 create mode 100644 sidekick/Sidekick_smt/Stat/index.html
 create mode 100644 sidekick/Sidekick_smt/Term/index.html
 create mode 100644 sidekick/Sidekick_smt/Term_cell/Make_eq/argument-1-X/index.html
 create mode 100644 sidekick/Sidekick_smt/Term_cell/Make_eq/index.html
 create mode 100644 sidekick/Sidekick_smt/Term_cell/index.html
 create mode 100644 sidekick/Sidekick_smt/Term_cell/module-type-ARG/index.html
 create mode 100644 sidekick/Sidekick_smt/Theory/Clause/index.html
 create mode 100644 sidekick/Sidekick_smt/Theory/index.html
 create mode 100644 sidekick/Sidekick_smt/Theory_combine/index.html
 create mode 100644 sidekick/Sidekick_smt/Ty/index.html
 create mode 100644 sidekick/Sidekick_smt/Ty_card/index.html
 create mode 100644 sidekick/Sidekick_smt/index.html
 create mode 100644 sidekick/Sidekick_smt__Ast/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Ast/Ty/index.html
 create mode 100644 sidekick/Sidekick_smt__Ast/Var/index.html
 create mode 100644 sidekick/Sidekick_smt__Ast/index.html
 create mode 100644 sidekick/Sidekick_smt__Bag/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Bag/index.html
 create mode 100644 sidekick/Sidekick_smt__Config/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Config/Key/index.html
 create mode 100644 sidekick/Sidekick_smt__Config/index.html
 create mode 100644 sidekick/Sidekick_smt__Congruence_closure/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Congruence_closure/index.html
 create mode 100644 sidekick/Sidekick_smt__Cst/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Cst/index.html
 create mode 100644 sidekick/Sidekick_smt__Equiv_class/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Equiv_class/index.html
 create mode 100644 sidekick/Sidekick_smt__Explanation/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Explanation/Set/index.html
 create mode 100644 sidekick/Sidekick_smt__Explanation/index.html
 create mode 100644 sidekick/Sidekick_smt__Hash/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Hash/index.html
 create mode 100644 sidekick/Sidekick_smt__Het_map/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Het_map/Key/index.html
 create mode 100644 sidekick/Sidekick_smt__Het_map/Map/index.html
 create mode 100644 sidekick/Sidekick_smt__Het_map/Tbl/index.html
 create mode 100644 sidekick/Sidekick_smt__Het_map/index.html
 create mode 100644 sidekick/Sidekick_smt__Lit/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Lit/index.html
 create mode 100644 sidekick/Sidekick_smt__Model/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Model/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Solver/Proof/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver/Sat_solver/Clause/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver/Sat_solver/Formula/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver/Sat_solver/Lit/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver/Sat_solver/Proof/Atom/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver/Sat_solver/Proof/Clause/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver/Sat_solver/Proof/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver/Sat_solver/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver/index.html
 create mode 100644 sidekick/Sidekick_smt__Solver_types/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Solver_types/index.html
 create mode 100644 sidekick/Sidekick_smt__Stat/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Stat/index.html
 create mode 100644 sidekick/Sidekick_smt__Term/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Term/index.html
 create mode 100644 sidekick/Sidekick_smt__Term_cell/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Term_cell/Make_eq/argument-1-X/index.html
 create mode 100644 sidekick/Sidekick_smt__Term_cell/Make_eq/index.html
 create mode 100644 sidekick/Sidekick_smt__Term_cell/index.html
 create mode 100644 sidekick/Sidekick_smt__Term_cell/module-type-ARG/index.html
 create mode 100644 sidekick/Sidekick_smt__Theory/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Theory/Clause/index.html
 create mode 100644 sidekick/Sidekick_smt__Theory/index.html
 create mode 100644 sidekick/Sidekick_smt__Theory_combine/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Theory_combine/Form/index.html
 create mode 100644 sidekick/Sidekick_smt__Theory_combine/Proof/index.html
 create mode 100644 sidekick/Sidekick_smt__Theory_combine/index.html
 create mode 100644 sidekick/Sidekick_smt__Ty/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Ty/index.html
 create mode 100644 sidekick/Sidekick_smt__Ty_card/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smt__Ty_card/index.html
 create mode 100644 sidekick/Sidekick_smtlib/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smtlib/Process/index.html
 create mode 100644 sidekick/Sidekick_smtlib/index.html
 create mode 100644 sidekick/Sidekick_smtlib__/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smtlib__/Lexer/index.html
 create mode 100644 sidekick/Sidekick_smtlib__/Locations/index.html
 create mode 100644 sidekick/Sidekick_smtlib__/Parse_ast/index.html
 create mode 100644 sidekick/Sidekick_smtlib__/Parser/index.html
 create mode 100644 sidekick/Sidekick_smtlib__/Process/index.html
 create mode 100644 sidekick/Sidekick_smtlib__/Typecheck/index.html
 create mode 100644 sidekick/Sidekick_smtlib__/index.html
 create mode 100644 sidekick/Sidekick_smtlib__Lexer/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smtlib__Lexer/index.html
 create mode 100644 sidekick/Sidekick_smtlib__Locations/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smtlib__Locations/index.html
 create mode 100644 sidekick/Sidekick_smtlib__Parse_ast/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smtlib__Parse_ast/index.html
 create mode 100644 sidekick/Sidekick_smtlib__Parser/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smtlib__Parser/index.html
 create mode 100644 sidekick/Sidekick_smtlib__Process/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smtlib__Process/index.html
 create mode 100644 sidekick/Sidekick_smtlib__Typecheck/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_smtlib__Typecheck/Ctx/index.html
 create mode 100644 sidekick/Sidekick_smtlib__Typecheck/index.html
 create mode 100644 sidekick/Sidekick_th_bool/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_th_bool/Lit/index.html
 create mode 100644 sidekick/Sidekick_th_bool/T_cell/index.html
 create mode 100644 sidekick/Sidekick_th_bool/index.html
 create mode 100644 sidekick/Sidekick_util/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util/BitField/index.html
 create mode 100644 sidekick/Sidekick_util/Heap/Make/argument-1-X/index.html
 create mode 100644 sidekick/Sidekick_util/Heap/Make/index.html
 create mode 100644 sidekick/Sidekick_util/Heap/index.html
 create mode 100644 sidekick/Sidekick_util/Heap/module-type-RANKED/index.html
 create mode 100644 sidekick/Sidekick_util/Heap/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_util/Heap_intf/index.html
 create mode 100644 sidekick/Sidekick_util/Heap_intf/module-type-RANKED/index.html
 create mode 100644 sidekick/Sidekick_util/Heap_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_util/IArray/index.html
 create mode 100644 sidekick/Sidekick_util/ID/index.html
 create mode 100644 sidekick/Sidekick_util/Intf/index.html
 create mode 100644 sidekick/Sidekick_util/Intf/module-type-EQ/index.html
 create mode 100644 sidekick/Sidekick_util/Intf/module-type-HASH/index.html
 create mode 100644 sidekick/Sidekick_util/Intf/module-type-ORD/index.html
 create mode 100644 sidekick/Sidekick_util/Intf/module-type-PRINT/index.html
 create mode 100644 sidekick/Sidekick_util/Log/index.html
 create mode 100644 sidekick/Sidekick_util/Util/index.html
 create mode 100644 sidekick/Sidekick_util/Vec/index.html
 create mode 100644 sidekick/Sidekick_util/index.html
 create mode 100644 sidekick/Sidekick_util__BitField/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util__BitField/Make/index.html
 create mode 100644 sidekick/Sidekick_util__BitField/index.html
 create mode 100644 sidekick/Sidekick_util__BitField/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_util__Heap/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util__Heap/Make/argument-1-X/index.html
 create mode 100644 sidekick/Sidekick_util__Heap/Make/index.html
 create mode 100644 sidekick/Sidekick_util__Heap/index.html
 create mode 100644 sidekick/Sidekick_util__Heap/module-type-RANKED/index.html
 create mode 100644 sidekick/Sidekick_util__Heap/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_util__Heap_intf/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util__Heap_intf/index.html
 create mode 100644 sidekick/Sidekick_util__Heap_intf/module-type-RANKED/index.html
 create mode 100644 sidekick/Sidekick_util__Heap_intf/module-type-S/index.html
 create mode 100644 sidekick/Sidekick_util__IArray/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util__IArray/index.html
 create mode 100644 sidekick/Sidekick_util__ID/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util__ID/B/index.html
 create mode 100644 sidekick/Sidekick_util__ID/index.html
 create mode 100644 sidekick/Sidekick_util__Intf/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util__Intf/index.html
 create mode 100644 sidekick/Sidekick_util__Intf/module-type-EQ/index.html
 create mode 100644 sidekick/Sidekick_util__Intf/module-type-HASH/index.html
 create mode 100644 sidekick/Sidekick_util__Intf/module-type-ORD/index.html
 create mode 100644 sidekick/Sidekick_util__Intf/module-type-PRINT/index.html
 create mode 100644 sidekick/Sidekick_util__Log/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util__Log/index.html
 create mode 100644 sidekick/Sidekick_util__Util/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util__Util/index.html
 create mode 100644 sidekick/Sidekick_util__Vec/.jbuilder-keep
 create mode 100644 sidekick/Sidekick_util__Vec/index.html
 create mode 100644 sidekick/index.html

diff --git a/highlight.pack.js b/highlight.pack.js
new file mode 100644
index 00000000..40370e82
--- /dev/null
+++ b/highlight.pack.js
@@ -0,0 +1,2 @@
+/*! highlight.js v9.12.0 | BSD3 License | git.io/hljslicense */
+!function(e){var n="object"==typeof window&&window||"object"==typeof self&&self;"undefined"!=typeof exports?e(exports):n&&(n.hljs=e({}),"function"==typeof define&&define.amd&&define([],function(){return n.hljs}))}(function(e){function n(e){return e.replace(/&/g,"&amp;").replace(/</g,"&lt;").replace(/>/g,"&gt;")}function t(e){return e.nodeName.toLowerCase()}function r(e,n){var t=e&&e.exec(n);return t&&0===t.index}function a(e){return k.test(e)}function i(e){var n,t,r,i,o=e.className+" ";if(o+=e.parentNode?e.parentNode.className:"",t=B.exec(o))return w(t[1])?t[1]:"no-highlight";for(o=o.split(/\s+/),n=0,r=o.length;r>n;n++)if(i=o[n],a(i)||w(i))return i}function o(e){var n,t={},r=Array.prototype.slice.call(arguments,1);for(n in e)t[n]=e[n];return r.forEach(function(e){for(n in e)t[n]=e[n]}),t}function u(e){var n=[];return function r(e,a){for(var i=e.firstChild;i;i=i.nextSibling)3===i.nodeType?a+=i.nodeValue.length:1===i.nodeType&&(n.push({event:"start",offset:a,node:i}),a=r(i,a),t(i).match(/br|hr|img|input/)||n.push({event:"stop",offset:a,node:i}));return a}(e,0),n}function c(e,r,a){function i(){return e.length&&r.length?e[0].offset!==r[0].offset?e[0].offset<r[0].offset?e:r:"start"===r[0].event?e:r:e.length?e:r}function o(e){function r(e){return" "+e.nodeName+'="'+n(e.value).replace('"',"&quot;")+'"'}s+="<"+t(e)+E.map.call(e.attributes,r).join("")+">"}function u(e){s+="</"+t(e)+">"}function c(e){("start"===e.event?o:u)(e.node)}for(var l=0,s="",f=[];e.length||r.length;){var g=i();if(s+=n(a.substring(l,g[0].offset)),l=g[0].offset,g===e){f.reverse().forEach(u);do c(g.splice(0,1)[0]),g=i();while(g===e&&g.length&&g[0].offset===l);f.reverse().forEach(o)}else"start"===g[0].event?f.push(g[0].node):f.pop(),c(g.splice(0,1)[0])}return s+n(a.substr(l))}function l(e){return e.v&&!e.cached_variants&&(e.cached_variants=e.v.map(function(n){return o(e,{v:null},n)})),e.cached_variants||e.eW&&[o(e)]||[e]}function s(e){function n(e){return e&&e.source||e}function t(t,r){return new RegExp(n(t),"m"+(e.cI?"i":"")+(r?"g":""))}function r(a,i){if(!a.compiled){if(a.compiled=!0,a.k=a.k||a.bK,a.k){var o={},u=function(n,t){e.cI&&(t=t.toLowerCase()),t.split(" ").forEach(function(e){var t=e.split("|");o[t[0]]=[n,t[1]?Number(t[1]):1]})};"string"==typeof a.k?u("keyword",a.k):x(a.k).forEach(function(e){u(e,a.k[e])}),a.k=o}a.lR=t(a.l||/\w+/,!0),i&&(a.bK&&(a.b="\\b("+a.bK.split(" ").join("|")+")\\b"),a.b||(a.b=/\B|\b/),a.bR=t(a.b),a.e||a.eW||(a.e=/\B|\b/),a.e&&(a.eR=t(a.e)),a.tE=n(a.e)||"",a.eW&&i.tE&&(a.tE+=(a.e?"|":"")+i.tE)),a.i&&(a.iR=t(a.i)),null==a.r&&(a.r=1),a.c||(a.c=[]),a.c=Array.prototype.concat.apply([],a.c.map(function(e){return l("self"===e?a:e)})),a.c.forEach(function(e){r(e,a)}),a.starts&&r(a.starts,i);var c=a.c.map(function(e){return e.bK?"\\.?("+e.b+")\\.?":e.b}).concat([a.tE,a.i]).map(n).filter(Boolean);a.t=c.length?t(c.join("|"),!0):{exec:function(){return null}}}}r(e)}function f(e,t,a,i){function o(e,n){var t,a;for(t=0,a=n.c.length;a>t;t++)if(r(n.c[t].bR,e))return n.c[t]}function u(e,n){if(r(e.eR,n)){for(;e.endsParent&&e.parent;)e=e.parent;return e}return e.eW?u(e.parent,n):void 0}function c(e,n){return!a&&r(n.iR,e)}function l(e,n){var t=N.cI?n[0].toLowerCase():n[0];return e.k.hasOwnProperty(t)&&e.k[t]}function p(e,n,t,r){var a=r?"":I.classPrefix,i='<span class="'+a,o=t?"":C;return i+=e+'">',i+n+o}function h(){var e,t,r,a;if(!E.k)return n(k);for(a="",t=0,E.lR.lastIndex=0,r=E.lR.exec(k);r;)a+=n(k.substring(t,r.index)),e=l(E,r),e?(B+=e[1],a+=p(e[0],n(r[0]))):a+=n(r[0]),t=E.lR.lastIndex,r=E.lR.exec(k);return a+n(k.substr(t))}function d(){var e="string"==typeof E.sL;if(e&&!y[E.sL])return n(k);var t=e?f(E.sL,k,!0,x[E.sL]):g(k,E.sL.length?E.sL:void 0);return E.r>0&&(B+=t.r),e&&(x[E.sL]=t.top),p(t.language,t.value,!1,!0)}function b(){L+=null!=E.sL?d():h(),k=""}function v(e){L+=e.cN?p(e.cN,"",!0):"",E=Object.create(e,{parent:{value:E}})}function m(e,n){if(k+=e,null==n)return b(),0;var t=o(n,E);if(t)return t.skip?k+=n:(t.eB&&(k+=n),b(),t.rB||t.eB||(k=n)),v(t,n),t.rB?0:n.length;var r=u(E,n);if(r){var a=E;a.skip?k+=n:(a.rE||a.eE||(k+=n),b(),a.eE&&(k=n));do E.cN&&(L+=C),E.skip||(B+=E.r),E=E.parent;while(E!==r.parent);return r.starts&&v(r.starts,""),a.rE?0:n.length}if(c(n,E))throw new Error('Illegal lexeme "'+n+'" for mode "'+(E.cN||"<unnamed>")+'"');return k+=n,n.length||1}var N=w(e);if(!N)throw new Error('Unknown language: "'+e+'"');s(N);var R,E=i||N,x={},L="";for(R=E;R!==N;R=R.parent)R.cN&&(L=p(R.cN,"",!0)+L);var k="",B=0;try{for(var M,j,O=0;;){if(E.t.lastIndex=O,M=E.t.exec(t),!M)break;j=m(t.substring(O,M.index),M[0]),O=M.index+j}for(m(t.substr(O)),R=E;R.parent;R=R.parent)R.cN&&(L+=C);return{r:B,value:L,language:e,top:E}}catch(T){if(T.message&&-1!==T.message.indexOf("Illegal"))return{r:0,value:n(t)};throw T}}function g(e,t){t=t||I.languages||x(y);var r={r:0,value:n(e)},a=r;return t.filter(w).forEach(function(n){var t=f(n,e,!1);t.language=n,t.r>a.r&&(a=t),t.r>r.r&&(a=r,r=t)}),a.language&&(r.second_best=a),r}function p(e){return I.tabReplace||I.useBR?e.replace(M,function(e,n){return I.useBR&&"\n"===e?"<br>":I.tabReplace?n.replace(/\t/g,I.tabReplace):""}):e}function h(e,n,t){var r=n?L[n]:t,a=[e.trim()];return e.match(/\bhljs\b/)||a.push("hljs"),-1===e.indexOf(r)&&a.push(r),a.join(" ").trim()}function d(e){var n,t,r,o,l,s=i(e);a(s)||(I.useBR?(n=document.createElementNS("http://www.w3.org/1999/xhtml","div"),n.innerHTML=e.innerHTML.replace(/\n/g,"").replace(/<br[ \/]*>/g,"\n")):n=e,l=n.textContent,r=s?f(s,l,!0):g(l),t=u(n),t.length&&(o=document.createElementNS("http://www.w3.org/1999/xhtml","div"),o.innerHTML=r.value,r.value=c(t,u(o),l)),r.value=p(r.value),e.innerHTML=r.value,e.className=h(e.className,s,r.language),e.result={language:r.language,re:r.r},r.second_best&&(e.second_best={language:r.second_best.language,re:r.second_best.r}))}function b(e){I=o(I,e)}function v(){if(!v.called){v.called=!0;var e=document.querySelectorAll("pre code");E.forEach.call(e,d)}}function m(){addEventListener("DOMContentLoaded",v,!1),addEventListener("load",v,!1)}function N(n,t){var r=y[n]=t(e);r.aliases&&r.aliases.forEach(function(e){L[e]=n})}function R(){return x(y)}function w(e){return e=(e||"").toLowerCase(),y[e]||y[L[e]]}var E=[],x=Object.keys,y={},L={},k=/^(no-?highlight|plain|text)$/i,B=/\blang(?:uage)?-([\w-]+)\b/i,M=/((^(<[^>]+>|\t|)+|(?:\n)))/gm,C="</span>",I={classPrefix:"hljs-",tabReplace:null,useBR:!1,languages:void 0};return e.highlight=f,e.highlightAuto=g,e.fixMarkup=p,e.highlightBlock=d,e.configure=b,e.initHighlighting=v,e.initHighlightingOnLoad=m,e.registerLanguage=N,e.listLanguages=R,e.getLanguage=w,e.inherit=o,e.IR="[a-zA-Z]\\w*",e.UIR="[a-zA-Z_]\\w*",e.NR="\\b\\d+(\\.\\d+)?",e.CNR="(-?)(\\b0[xX][a-fA-F0-9]+|(\\b\\d+(\\.\\d*)?|\\.\\d+)([eE][-+]?\\d+)?)",e.BNR="\\b(0b[01]+)",e.RSR="!|!=|!==|%|%=|&|&&|&=|\\*|\\*=|\\+|\\+=|,|-|-=|/=|/|:|;|<<|<<=|<=|<|===|==|=|>>>=|>>=|>=|>>>|>>|>|\\?|\\[|\\{|\\(|\\^|\\^=|\\||\\|=|\\|\\||~",e.BE={b:"\\\\[\\s\\S]",r:0},e.ASM={cN:"string",b:"'",e:"'",i:"\\n",c:[e.BE]},e.QSM={cN:"string",b:'"',e:'"',i:"\\n",c:[e.BE]},e.PWM={b:/\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|they|like|more)\b/},e.C=function(n,t,r){var a=e.inherit({cN:"comment",b:n,e:t,c:[]},r||{});return a.c.push(e.PWM),a.c.push({cN:"doctag",b:"(?:TODO|FIXME|NOTE|BUG|XXX):",r:0}),a},e.CLCM=e.C("//","$"),e.CBCM=e.C("/\\*","\\*/"),e.HCM=e.C("#","$"),e.NM={cN:"number",b:e.NR,r:0},e.CNM={cN:"number",b:e.CNR,r:0},e.BNM={cN:"number",b:e.BNR,r:0},e.CSSNM={cN:"number",b:e.NR+"(%|em|ex|ch|rem|vw|vh|vmin|vmax|cm|mm|in|pt|pc|px|deg|grad|rad|turn|s|ms|Hz|kHz|dpi|dpcm|dppx)?",r:0},e.RM={cN:"regexp",b:/\//,e:/\/[gimuy]*/,i:/\n/,c:[e.BE,{b:/\[/,e:/\]/,r:0,c:[e.BE]}]},e.TM={cN:"title",b:e.IR,r:0},e.UTM={cN:"title",b:e.UIR,r:0},e.METHOD_GUARD={b:"\\.\\s*"+e.UIR,r:0},e});hljs.registerLanguage("ocaml",function(e){return{aliases:["ml"],k:{keyword:"and as assert asr begin class constraint do done downto else end exception external for fun function functor if in include inherit! inherit initializer land lazy let lor lsl lsr lxor match method!|10 method mod module mutable new object of open! open or private rec sig struct then to try type val! val virtual when while with parser value",built_in:"array bool bytes char exn|5 float int int32 int64 list lazy_t|5 nativeint|5 string unit in_channel out_channel ref",literal:"true false"},i:/\/\/|>>/,l:"[a-z_]\\w*!?",c:[{cN:"literal",b:"\\[(\\|\\|)?\\]|\\(\\)",r:0},e.C("\\(\\*","\\*\\)",{c:["self"]}),{cN:"symbol",b:"'[A-Za-z_](?!')[\\w']*"},{cN:"type",b:"`[A-Z][\\w']*"},{cN:"type",b:"\\b[A-Z][\\w']*",r:0},{b:"[a-z_]\\w*'[\\w']*",r:0},e.inherit(e.ASM,{cN:"string",r:0}),e.inherit(e.QSM,{i:null}),{cN:"number",b:"\\b(0[xX][a-fA-F0-9_]+[Lln]?|0[oO][0-7_]+[Lln]?|0[bB][01_]+[Lln]?|[0-9][0-9_]*([Lln]|(\\.[0-9_]*)?([eE][-+]?[0-9_]+)?)?)",r:0},{b:/[-=]>/}]}});
\ No newline at end of file
diff --git a/index.html b/index.html
new file mode 100644
index 00000000..d0792f55
--- /dev/null
+++ b/index.html
@@ -0,0 +1,18 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml">
+  <head>
+    <title>index</title>
+    <link rel="stylesheet" href="./odoc.css"/>
+    <meta charset="utf-8"/>
+    <meta name="viewport" content="width=device-width,initial-scale=1.0"/>
+  </head>
+  <body>
+    <div class="by-name">
+    <h2>OCaml package documentation</h2>
+    <ol>
+    <li><a href="msat_test/index.html">msat_test</a> <span class="version">dev</span></li>
+    <li><a href="sidekick/index.html">sidekick</a> <span class="version">dev</span></li>
+    </ol>
+    </div>
+  </body>
+</html>
\ No newline at end of file
diff --git a/odoc.css b/odoc.css
new file mode 100644
index 00000000..d84a27de
--- /dev/null
+++ b/odoc.css
@@ -0,0 +1,263 @@
+@charset "UTF-8";
+/* Copyright (c) 2016 Daniel C. Bünzli. All rights reserved.
+   Distributed under the ISC license, see terms at the end of the file.
+   %%NAME%% %%VERSION%% */
+
+/* Reset a few things. */
+
+html,body,div,span,applet,object,iframe,h1,h2,h3,h4,h5,h6,p,blockquote,pre,
+a,abbr,acronym,address,big,cite,code,del,dfn,em,img,ins,kbd,q,s,samp,
+small,strike,strong,sub,sup,tt,var,b,u,i,center,dl,dt,dd,ol,ul,li,
+fieldset,form,label,legend,table,caption,tbody,tfoot,thead,tr,th,td,
+article,aside,canvas,details,embed,figure,figcaption,footer,header,hgroup,
+menu,nav,output,ruby,section,summary,time,mark,audio,video
+{ margin:0; padding:0; border:0; /* outline: 0; */
+  font-size:100%; font: inherit; line-height:inherit; vertical-align:baseline;
+  text-align: inherit; color: inherit; background: transparent; }
+
+table { border-collapse: collapse; border-spacing: 0; }
+*,  *:before,  *:after { box-sizing: border-box; }
+
+body
+{ font-family: Helvetica, "DejaVu Sans", Arial, sans-serif;
+  font-weight: normal;
+  font-size: 14px;
+  line-height:20px;
+  text-align: left;
+  min-width: 40ex;
+  max-width: 78ex;
+  padding: 20px;
+  margin-left: 60px;
+  color: #222; background: #FAFAFA; }
+
+/* Basic markup elements */
+
+b, strong { font-weight: bold; }
+i, em { font-style: italic; }
+
+sup { vertical-align: super; }
+sub { vertical-align: sub; }
+sup, sub { font-size : 12px; line-height: 0; margin-left: 0.2ex; }
+
+p, div, img { margin-top: 20px; }
+
+ul, ol
+{ margin-top: 10px; margin-bottom: 10px; list-style-position: outside }
+
+ul { list-style-type: square }
+ul > li { margin-left: 22px; }
+ol > li { margin-left: 27.2px; }
+li > *:first-child { margin-top: 0 }
+
+/* Text alignements, this should be forbidden. */
+
+.left { text-align: left; }
+.right { text-align: right; }
+.center { text-align: center; }
+
+/* Links and anchors */
+
+a { text-decoration:none; color:#2C5CBD; }
+a:hover { box-shadow:0 1px 0 0 #2C5CBD; }
+*:target /* Linked highlight */
+{ background-color: #FFF8E5;
+  box-shadow: 0 0 0 2px #FFF8E5, 0 0 0 3px #DDD; }
+
+*:hover > a.anchor {
+    visibility: visible;
+}
+
+a.anchor:before { content: "#" }
+a.anchor:hover {  box-shadow: none; text-decoration: underline }
+a.anchor
+{ visibility: hidden; position: absolute; /* top: 0px; */
+  margin-left: -3ex;
+  font-weight: normal;
+  font-style: normal;
+  padding-right: 1ex; padding-left: 1ex; /* To remain selectable */
+  color: #AAA; }
+
+.xref-unresolved { box-shadow:0 1px 0 0 red }
+
+/* Section and document divisions.
+   Until at least 4.03 many of the modules of the stdlib start at .h7,
+   we restart the sequence there like h2  */
+
+h1, h2, h3, h4, h5, h6, .h7, .h8, .h9, .h10
+{ font-weight: bold; margin-top: 20px; }
+
+h1 + *, h2 + *, .h7 + * { margin-top: 10px; }
+
+h1, h2, .h7
+{ font-size: 20px;
+  line-height: 39px;
+  padding-top: 10px;
+  border-top: solid;
+  border-width: 1px;
+  border-color: #DDD; }
+
+h3 { font-size: 18px; }
+
+h2 + h3, .h7 + .h8 { margin-top: 10px; }
+
+/* Preformatted and code */
+
+tt, code, pre
+{ font-family: Menlo, "DejaVu Sans Mono", "Bitstream Vera Sans Mono",
+  monospace;
+  font-weight: normal;
+  font-size: 12px; }
+
+pre
+{ padding-left: 4px; padding-right: 4px;
+  margin-left: -4px; margin-right: -4px;
+  padding-top: 5px; padding-bottom: 5px;
+  margin-top: 20px; /*  margin-bottom: 0.625rem; */
+  line-height: 19px;
+  background: #F1F1F1; }
+
+h1 tt, h1 code, h2 tt, h2 code, .h7 tt, .h7 code { font-size: 18px }
+h3 tt, h3 code { font-size: 16px }
+
+/* Code lexemes */
+
+.keyword { font-weight: bold; }
+
+/* Module member specification */
+
+div.def { margin-top: 0; text-indent: -2ex; padding-left: 2ex; }
+div.def + div.doc { margin-left: 1ex; margin-top: 2.5px }
+div.doc > *:first-child { margin-top: 0; }
+
+/* The elements other than heading should be wrapped in <aside> elements. */
+heading, body > p, body > ul, body > ol, h3, h4, body > pre {
+    margin-bottom: 16px;
+}
+
+dd {
+    margin-left: 8px;
+    margin-bottom: 16px;
+}
+
+dd > :first-child {
+    margin-top: 0;
+}
+
+/* Collapsible inlined include and module */
+
+details
+{ border-radius: 8px;
+  border-left: 1.6px solid;
+  border-color: #FAFAFA /* Background */;
+  margin-left: -24px;
+  padding-left: 20.8px;
+  padding-bottom: 10px; }
+
+details[open] { border-color: #AAA; }
+
+/* Records and variants FIXME */
+
+div.def table { text-indent: 0em; padding:0; margin-left: -2ex; }
+td.def { padding-right: 2ex }
+.record td.def { padding-left:2ex; }
+td.doc *:first-child { margin-top: 0em }
+
+/* @ tags */
+
+ul.at-tag { list-style-type: none; margin-left: 0; padding: 0; }
+ul.at-tag li { margin-left:0; padding:0; }
+ul.at-tag li p:first-child { margin-top: 0 } /* FIXME remove */
+span.at-tag { font-weight: bold }
+.at-tag.deprecated { font-weight: normal; color: crimson }
+.at-tag.raise { font-weight: bold; }
+
+/* FIXME random other things to review. */
+
+.heading
+{ margin-top: 10px;
+  border-top: solid;
+  border-width: 1px;
+  border-color: #DDD;
+  text-align: right;
+  font-weight: normal;
+  font-style: italic; }
+
+.heading + .sig { margin-top: -20px; }
+.heading + .parameters { margin-top: -20px; }
+
+/* Odig package index */
+
+.by-name ol, .by-tag ol, .errors ol { list-style-type: none; margin-left:0; }
+.by-name ol ol, .by-tag ol ol { margin-top:0; margin-bottom: 0 }
+.by-name li, .by-tag li, .errors li { margin-left:0; }
+
+.by-name .version { font-size: 10px; color: #AAA }
+.by-name nav { margin-bottom: 10px }
+.by-name nav a
+{ text-transform: uppercase; font-size: 18px;
+  margin-right:1ex; color: #222; display: inline-block; }
+
+.by-tag nav a { margin-right:1ex; color: #222; display: inline-block; }
+.by-tag > ol > li { margin-top: 10px; }
+.by-tag > ol > li > span,
+.by-tag > ol > li > ol,
+.by-tag > ol > li > ol > li { display: inline-block; margin-right: 1ex; }
+
+/* Odig package page */
+
+.package nav { display: inline; font-size: 14px; font-weight: normal; }
+.package .version { font-size: 14px; }
+
+h1 + .modules, h1 + .sel { margin-top: 10px }
+.sel { font-weight: normal; font-style: italic;
+       font-size:14px; margin-top:20px; }
+.sel + .modules { margin-top:10px;
+                  margin-bottom: 20px; margin-left: 1ex; }
+
+.modules { margin:0; }
+.modules .module { min-width:8ex; padding-right: 2ex }
+
+.package.info { margin: 0;}
+.package.info td:first-child { font-style: italic; padding-right: 2ex; }
+.package.info ul { list-style-type: none; display: inline; margin:0; }
+.package.info li { display: inline-block; margin:0; margin-right:1ex; }
+#info-authors li, #info-maintainers li { display:block; }
+
+/* Mobile adjustements. */
+
+@media only screen and (max-width: 78ex)
+{ body { margin: auto; } }
+
+/* Print adjustements. */
+
+@media print
+{ body { color: black; background: white; }
+  body nav:first-child { visibility: hidden; }}
+
+.hljs-keyword {
+    font-weight: bold;
+}
+
+.hljs-literal {
+    opacity: 0.8;
+}
+
+.hljs-comment {
+    opacity: 0.5;
+}
+
+/*---------------------------------------------------------------------------
+   Copyright (c) 2016 Daniel C. Bünzli
+
+   Permission to use, copy, modify, and/or distribute this software for any
+   purpose with or without fee is hereby granted, provided that the above
+   copyright notice and this permission notice appear in all copies.
+
+   THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+   WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+   MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+   ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+   WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+   ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+   OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+  ---------------------------------------------------------------------------*/
diff --git a/sidekick/CDCL_tseitin/.jbuilder-keep b/sidekick/CDCL_tseitin/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/CDCL_tseitin/Make/argument-1-A/Form/index.html b/sidekick/CDCL_tseitin/Make/argument-1-A/Form/index.html
new file mode 100644
index 00000000..ea0c6b68
--- /dev/null
+++ b/sidekick/CDCL_tseitin/Make/argument-1-A/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.CDCL_tseitin.Make.1-A.Form)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>CDCL_tseitin.Make.1-A.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Type of atomic formulas.</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Negation of atomic formulas.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the given formula.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin/Make/argument-1-A/index.html b/sidekick/CDCL_tseitin/Make/argument-1-A/index.html
new file mode 100644
index 00000000..d451c9c4
--- /dev/null
+++ b/sidekick/CDCL_tseitin/Make/argument-1-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-A (sidekick.CDCL_tseitin.Make.1-A)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>CDCL_tseitin.Make.1-A</code></h1></header><aside><p>Formulas</p><p>This defines what is needed of formulas in order to implement Tseitin's CNF conversion.</p></aside><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State</p></dd></dl><dl><dt id="val-fresh"><a href="#val-fresh" class="anchor"></a><code><span class="keyword">val </span>fresh : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="Form/index.html#type-t">Form.t</a></code></dt><dd><p>Generate fresh formulas (that are different from any other).</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin/Make/index.html b/sidekick/CDCL_tseitin/Make/index.html
new file mode 100644
index 00000000..bf8e4c8e
--- /dev/null
+++ b/sidekick/CDCL_tseitin/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.CDCL_tseitin.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>CDCL_tseitin.Make</code></h1></header><div class="doc"><p>This functor provides an implementation of Tseitin's CNF conversion.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a></code></dl><h3 class="heading">Signature</h3><aside><p>CNF conversion</p><p>This modules allows to convert arbitrary boolean formulas into CNF.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="argument-1-A/Form/index.html#type-t">A.Form.t</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of arbitrary boolean formulas. Arbitrary boolean formulas can be built using functions in this module, and then converted to a CNF, which is a list of clauses that only use atomic formulas.</p></dd></dl><dl><dt id="val-f_true"><a href="#val-f_true" class="anchor"></a><code><span class="keyword">val </span>f_true : <a href="index.html#type-t">t</a></code></dt><dd><p>The <code>true</code> formula, i.e a formula that is always satisfied.</p></dd></dl><dl><dt id="val-f_false"><a href="#val-f_false" class="anchor"></a><code><span class="keyword">val </span>f_false : <a href="index.html#type-t">t</a></code></dt><dd><p>The <code>false</code> formula, i.e a formula that cannot be satisfied.</p></dd></dl><dl><dt id="val-make_atom"><a href="#val-make_atom" class="anchor"></a><code><span class="keyword">val </span>make_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_atom p</code> builds the boolean formula equivalent to the atomic formula <code>p</code>.</p></dd></dl><dl><dt id="val-make_not"><a href="#val-make_not" class="anchor"></a><code><span class="keyword">val </span>make_not : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the negation of a boolean formula.</p></dd></dl><dl><dt id="val-make_and"><a href="#val-make_and" class="anchor"></a><code><span class="keyword">val </span>make_and : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the conjunction of a list of formulas. An empty conjunction is always satisfied.</p></dd></dl><dl><dt id="val-make_or"><a href="#val-make_or" class="anchor"></a><code><span class="keyword">val </span>make_or : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the disjunction of a list of formulas. An empty disjunction is never satisfied.</p></dd></dl><dl><dt id="val-make_xor"><a href="#val-make_xor" class="anchor"></a><code><span class="keyword">val </span>make_xor : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_xor p q</code> creates the boolean formula &quot;<code>p</code> xor <code>q</code>&quot;.</p></dd></dl><dl><dt id="val-make_imply"><a href="#val-make_imply" class="anchor"></a><code><span class="keyword">val </span>make_imply : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_imply p q</code> creates the boolean formula &quot;<code>p</code> implies <code>q</code>&quot;.</p></dd></dl><dl><dt id="val-make_equiv"><a href="#val-make_equiv" class="anchor"></a><code><span class="keyword">val </span>make_equiv : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_equiv p q</code> creates the boolena formula &quot;<code>p</code> is equivalent to <code>q</code>&quot;.</p></dd></dl><dl><dt id="type-fresh_state"><a href="#type-fresh_state" class="anchor"></a><code><span class="keyword">type </span>fresh_state</code><code><span class="keyword"> = </span><a href="argument-1-A/index.html#type-t">A.t</a></code><code></code></dt><dd><p>State used to produce fresh atoms</p></dd></dl><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code></code><code></code></dt><dd><p>State used for the Tseitin transformation</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : <a href="index.html#type-fresh_state">fresh_state</a> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></dt><dt id="val-make_cnf"><a href="#val-make_cnf" class="anchor"></a><code><span class="keyword">val </span>make_cnf : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list</code></dt><dd><p><code>make_cnf f</code> returns a conjunctive normal form of <code>f</code> under the form: a list (which is a conjunction) of lists (which are disjunctions) of atomic formulas.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>print fmt f</code> prints the formula on the formatter <code>fmt</code>.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin/index.html b/sidekick/CDCL_tseitin/index.html
new file mode 100644
index 00000000..5ffd9dea
--- /dev/null
+++ b/sidekick/CDCL_tseitin/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>CDCL_tseitin (sidekick.CDCL_tseitin)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>CDCL_tseitin</code></h1><p>Tseitin CNF conversion</p><p>This modules implements Tseitin's Conjunctive Normal Form conversion, i.e. the ability to transform an arbitrary boolean formula into an equi-satisfiable CNF, that can then be fed to a SAT/SMT/McSat solver.</p></header><article id="module-type-Arg"><a href="#module-type-Arg" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-Arg/index.html">Arg</a> = <a href="../CDCL_tseitin__/Tseitin_intf/index.html#module-type-Arg">CDCL_tseitin__.Tseitin_intf.Arg</a></code></article><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../CDCL_tseitin__/Tseitin_intf/index.html#module-type-S">CDCL_tseitin__.Tseitin_intf.S</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-atom">atom</a><span class="keyword"> = </span><a href="Make/argument-1-A/Form/index.html#type-t">A.Form.t</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-fresh_state">fresh_state</a><span class="keyword"> = </span><a href="Make/argument-1-A/index.html#type-t">A.t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin/module-type-Arg/Form/index.html b/sidekick/CDCL_tseitin/module-type-Arg/Form/index.html
new file mode 100644
index 00000000..10f08be7
--- /dev/null
+++ b/sidekick/CDCL_tseitin/module-type-Arg/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.CDCL_tseitin.Arg.Form)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>CDCL_tseitin.Arg.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Type of atomic formulas.</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Negation of atomic formulas.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the given formula.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin/module-type-Arg/index.html b/sidekick/CDCL_tseitin/module-type-Arg/index.html
new file mode 100644
index 00000000..e2098af7
--- /dev/null
+++ b/sidekick/CDCL_tseitin/module-type-Arg/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Arg (sidekick.CDCL_tseitin.Arg)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>CDCL_tseitin.Arg</code></h1></header><div class="doc"><p>The implementation of formulas required to implement Tseitin's CNF conversion.</p></div><aside><p>Formulas</p><p>This defines what is needed of formulas in order to implement Tseitin's CNF conversion.</p></aside><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State</p></dd></dl><dl><dt id="val-fresh"><a href="#val-fresh" class="anchor"></a><code><span class="keyword">val </span>fresh : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="Form/index.html#type-t">Form.t</a></code></dt><dd><p>Generate fresh formulas (that are different from any other).</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin/module-type-S/index.html b/sidekick/CDCL_tseitin/module-type-S/index.html
new file mode 100644
index 00000000..c151b1b8
--- /dev/null
+++ b/sidekick/CDCL_tseitin/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.CDCL_tseitin.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>CDCL_tseitin.S</code></h1></header><div class="doc"><p>The exposed interface of Tseitin's CNF conversion.</p></div><aside><p>CNF conversion</p><p>This modules allows to convert arbitrary boolean formulas into CNF.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of arbitrary boolean formulas. Arbitrary boolean formulas can be built using functions in this module, and then converted to a CNF, which is a list of clauses that only use atomic formulas.</p></dd></dl><dl><dt id="val-f_true"><a href="#val-f_true" class="anchor"></a><code><span class="keyword">val </span>f_true : <a href="index.html#type-t">t</a></code></dt><dd><p>The <code>true</code> formula, i.e a formula that is always satisfied.</p></dd></dl><dl><dt id="val-f_false"><a href="#val-f_false" class="anchor"></a><code><span class="keyword">val </span>f_false : <a href="index.html#type-t">t</a></code></dt><dd><p>The <code>false</code> formula, i.e a formula that cannot be satisfied.</p></dd></dl><dl><dt id="val-make_atom"><a href="#val-make_atom" class="anchor"></a><code><span class="keyword">val </span>make_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_atom p</code> builds the boolean formula equivalent to the atomic formula <code>p</code>.</p></dd></dl><dl><dt id="val-make_not"><a href="#val-make_not" class="anchor"></a><code><span class="keyword">val </span>make_not : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the negation of a boolean formula.</p></dd></dl><dl><dt id="val-make_and"><a href="#val-make_and" class="anchor"></a><code><span class="keyword">val </span>make_and : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the conjunction of a list of formulas. An empty conjunction is always satisfied.</p></dd></dl><dl><dt id="val-make_or"><a href="#val-make_or" class="anchor"></a><code><span class="keyword">val </span>make_or : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the disjunction of a list of formulas. An empty disjunction is never satisfied.</p></dd></dl><dl><dt id="val-make_xor"><a href="#val-make_xor" class="anchor"></a><code><span class="keyword">val </span>make_xor : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_xor p q</code> creates the boolean formula &quot;<code>p</code> xor <code>q</code>&quot;.</p></dd></dl><dl><dt id="val-make_imply"><a href="#val-make_imply" class="anchor"></a><code><span class="keyword">val </span>make_imply : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_imply p q</code> creates the boolean formula &quot;<code>p</code> implies <code>q</code>&quot;.</p></dd></dl><dl><dt id="val-make_equiv"><a href="#val-make_equiv" class="anchor"></a><code><span class="keyword">val </span>make_equiv : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_equiv p q</code> creates the boolena formula &quot;<code>p</code> is equivalent to <code>q</code>&quot;.</p></dd></dl><dl><dt id="type-fresh_state"><a href="#type-fresh_state" class="anchor"></a><code><span class="keyword">type </span>fresh_state</code><code></code><code></code></dt><dd><p>State used to produce fresh atoms</p></dd></dl><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code></code><code></code></dt><dd><p>State used for the Tseitin transformation</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : <a href="index.html#type-fresh_state">fresh_state</a> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></dt><dt id="val-make_cnf"><a href="#val-make_cnf" class="anchor"></a><code><span class="keyword">val </span>make_cnf : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list</code></dt><dd><p><code>make_cnf f</code> returns a conjunctive normal form of <code>f</code> under the form: a list (which is a conjunction) of lists (which are disjunctions) of atomic formulas.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>print fmt f</code> prints the formula on the formatter <code>fmt</code>.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin__/.jbuilder-keep b/sidekick/CDCL_tseitin__/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/CDCL_tseitin__/Tseitin_intf/index.html b/sidekick/CDCL_tseitin__/Tseitin_intf/index.html
new file mode 100644
index 00000000..d9ca07b7
--- /dev/null
+++ b/sidekick/CDCL_tseitin__/Tseitin_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tseitin_intf (sidekick.CDCL_tseitin__.Tseitin_intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>CDCL_tseitin__.Tseitin_intf</code></h1></header><aside><p>Interfaces for Tseitin's CNF conversion</p></aside><article id="module-type-Arg"><a href="#module-type-Arg" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-Arg/index.html">Arg</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin__/Tseitin_intf/module-type-Arg/Form/index.html b/sidekick/CDCL_tseitin__/Tseitin_intf/module-type-Arg/Form/index.html
new file mode 100644
index 00000000..e92a75f9
--- /dev/null
+++ b/sidekick/CDCL_tseitin__/Tseitin_intf/module-type-Arg/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.CDCL_tseitin__.Tseitin_intf.Arg.Form)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>CDCL_tseitin__.Tseitin_intf.Arg.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Type of atomic formulas.</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Negation of atomic formulas.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the given formula.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin__/Tseitin_intf/module-type-Arg/index.html b/sidekick/CDCL_tseitin__/Tseitin_intf/module-type-Arg/index.html
new file mode 100644
index 00000000..734f5805
--- /dev/null
+++ b/sidekick/CDCL_tseitin__/Tseitin_intf/module-type-Arg/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Arg (sidekick.CDCL_tseitin__.Tseitin_intf.Arg)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>CDCL_tseitin__.Tseitin_intf.Arg</code></h1></header><aside><p>Formulas</p><p>This defines what is needed of formulas in order to implement Tseitin's CNF conversion.</p></aside><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State</p></dd></dl><dl><dt id="val-fresh"><a href="#val-fresh" class="anchor"></a><code><span class="keyword">val </span>fresh : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="Form/index.html#type-t">Form.t</a></code></dt><dd><p>Generate fresh formulas (that are different from any other).</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin__/Tseitin_intf/module-type-S/index.html b/sidekick/CDCL_tseitin__/Tseitin_intf/module-type-S/index.html
new file mode 100644
index 00000000..9a7d5ef5
--- /dev/null
+++ b/sidekick/CDCL_tseitin__/Tseitin_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.CDCL_tseitin__.Tseitin_intf.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>CDCL_tseitin__.Tseitin_intf.S</code></h1></header><aside><p>CNF conversion</p><p>This modules allows to convert arbitrary boolean formulas into CNF.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of arbitrary boolean formulas. Arbitrary boolean formulas can be built using functions in this module, and then converted to a CNF, which is a list of clauses that only use atomic formulas.</p></dd></dl><dl><dt id="val-f_true"><a href="#val-f_true" class="anchor"></a><code><span class="keyword">val </span>f_true : <a href="index.html#type-t">t</a></code></dt><dd><p>The <code>true</code> formula, i.e a formula that is always satisfied.</p></dd></dl><dl><dt id="val-f_false"><a href="#val-f_false" class="anchor"></a><code><span class="keyword">val </span>f_false : <a href="index.html#type-t">t</a></code></dt><dd><p>The <code>false</code> formula, i.e a formula that cannot be satisfied.</p></dd></dl><dl><dt id="val-make_atom"><a href="#val-make_atom" class="anchor"></a><code><span class="keyword">val </span>make_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_atom p</code> builds the boolean formula equivalent to the atomic formula <code>p</code>.</p></dd></dl><dl><dt id="val-make_not"><a href="#val-make_not" class="anchor"></a><code><span class="keyword">val </span>make_not : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the negation of a boolean formula.</p></dd></dl><dl><dt id="val-make_and"><a href="#val-make_and" class="anchor"></a><code><span class="keyword">val </span>make_and : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the conjunction of a list of formulas. An empty conjunction is always satisfied.</p></dd></dl><dl><dt id="val-make_or"><a href="#val-make_or" class="anchor"></a><code><span class="keyword">val </span>make_or : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the disjunction of a list of formulas. An empty disjunction is never satisfied.</p></dd></dl><dl><dt id="val-make_xor"><a href="#val-make_xor" class="anchor"></a><code><span class="keyword">val </span>make_xor : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_xor p q</code> creates the boolean formula &quot;<code>p</code> xor <code>q</code>&quot;.</p></dd></dl><dl><dt id="val-make_imply"><a href="#val-make_imply" class="anchor"></a><code><span class="keyword">val </span>make_imply : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_imply p q</code> creates the boolean formula &quot;<code>p</code> implies <code>q</code>&quot;.</p></dd></dl><dl><dt id="val-make_equiv"><a href="#val-make_equiv" class="anchor"></a><code><span class="keyword">val </span>make_equiv : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_equiv p q</code> creates the boolena formula &quot;<code>p</code> is equivalent to <code>q</code>&quot;.</p></dd></dl><dl><dt id="type-fresh_state"><a href="#type-fresh_state" class="anchor"></a><code><span class="keyword">type </span>fresh_state</code><code></code><code></code></dt><dd><p>State used to produce fresh atoms</p></dd></dl><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code></code><code></code></dt><dd><p>State used for the Tseitin transformation</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : <a href="index.html#type-fresh_state">fresh_state</a> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></dt><dt id="val-make_cnf"><a href="#val-make_cnf" class="anchor"></a><code><span class="keyword">val </span>make_cnf : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list</code></dt><dd><p><code>make_cnf f</code> returns a conjunctive normal form of <code>f</code> under the form: a list (which is a conjunction) of lists (which are disjunctions) of atomic formulas.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>print fmt f</code> prints the formula on the formatter <code>fmt</code>.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin__/index.html b/sidekick/CDCL_tseitin__/index.html
new file mode 100644
index 00000000..339fa4c2
--- /dev/null
+++ b/sidekick/CDCL_tseitin__/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>CDCL_tseitin__ (sidekick.CDCL_tseitin__)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>CDCL_tseitin__</code></h1></header><article id="module-CDCL_tseitin"><a href="#module-CDCL_tseitin" class="anchor"></a><code><span class="keyword">module </span>CDCL_tseitin = <a href="../CDCL_tseitin/index.html">CDCL_tseitin</a></code></article><article id="module-Tseitin_intf"><a href="#module-Tseitin_intf" class="anchor"></a><code><span class="keyword">module </span><a href="Tseitin_intf/index.html">Tseitin_intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin__Tseitin_intf/.jbuilder-keep b/sidekick/CDCL_tseitin__Tseitin_intf/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/CDCL_tseitin__Tseitin_intf/index.html b/sidekick/CDCL_tseitin__Tseitin_intf/index.html
new file mode 100644
index 00000000..fd0acfff
--- /dev/null
+++ b/sidekick/CDCL_tseitin__Tseitin_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>CDCL_tseitin__Tseitin_intf (sidekick.CDCL_tseitin__Tseitin_intf)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>CDCL_tseitin__Tseitin_intf</code></h1><p>Interfaces for Tseitin's CNF conversion</p></header><article id="module-type-Arg"><a href="#module-type-Arg" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-Arg/index.html">Arg</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin__Tseitin_intf/module-type-Arg/Form/index.html b/sidekick/CDCL_tseitin__Tseitin_intf/module-type-Arg/Form/index.html
new file mode 100644
index 00000000..40dca27a
--- /dev/null
+++ b/sidekick/CDCL_tseitin__Tseitin_intf/module-type-Arg/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.CDCL_tseitin__Tseitin_intf.Arg.Form)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>CDCL_tseitin__Tseitin_intf.Arg.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Type of atomic formulas.</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Negation of atomic formulas.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the given formula.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin__Tseitin_intf/module-type-Arg/index.html b/sidekick/CDCL_tseitin__Tseitin_intf/module-type-Arg/index.html
new file mode 100644
index 00000000..bcf4a3e7
--- /dev/null
+++ b/sidekick/CDCL_tseitin__Tseitin_intf/module-type-Arg/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Arg (sidekick.CDCL_tseitin__Tseitin_intf.Arg)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>CDCL_tseitin__Tseitin_intf.Arg</code></h1></header><aside><p>Formulas</p><p>This defines what is needed of formulas in order to implement Tseitin's CNF conversion.</p></aside><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State</p></dd></dl><dl><dt id="val-fresh"><a href="#val-fresh" class="anchor"></a><code><span class="keyword">val </span>fresh : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="Form/index.html#type-t">Form.t</a></code></dt><dd><p>Generate fresh formulas (that are different from any other).</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/CDCL_tseitin__Tseitin_intf/module-type-S/index.html b/sidekick/CDCL_tseitin__Tseitin_intf/module-type-S/index.html
new file mode 100644
index 00000000..e9fb8ad1
--- /dev/null
+++ b/sidekick/CDCL_tseitin__Tseitin_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.CDCL_tseitin__Tseitin_intf.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>CDCL_tseitin__Tseitin_intf.S</code></h1></header><aside><p>CNF conversion</p><p>This modules allows to convert arbitrary boolean formulas into CNF.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of arbitrary boolean formulas. Arbitrary boolean formulas can be built using functions in this module, and then converted to a CNF, which is a list of clauses that only use atomic formulas.</p></dd></dl><dl><dt id="val-f_true"><a href="#val-f_true" class="anchor"></a><code><span class="keyword">val </span>f_true : <a href="index.html#type-t">t</a></code></dt><dd><p>The <code>true</code> formula, i.e a formula that is always satisfied.</p></dd></dl><dl><dt id="val-f_false"><a href="#val-f_false" class="anchor"></a><code><span class="keyword">val </span>f_false : <a href="index.html#type-t">t</a></code></dt><dd><p>The <code>false</code> formula, i.e a formula that cannot be satisfied.</p></dd></dl><dl><dt id="val-make_atom"><a href="#val-make_atom" class="anchor"></a><code><span class="keyword">val </span>make_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_atom p</code> builds the boolean formula equivalent to the atomic formula <code>p</code>.</p></dd></dl><dl><dt id="val-make_not"><a href="#val-make_not" class="anchor"></a><code><span class="keyword">val </span>make_not : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the negation of a boolean formula.</p></dd></dl><dl><dt id="val-make_and"><a href="#val-make_and" class="anchor"></a><code><span class="keyword">val </span>make_and : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the conjunction of a list of formulas. An empty conjunction is always satisfied.</p></dd></dl><dl><dt id="val-make_or"><a href="#val-make_or" class="anchor"></a><code><span class="keyword">val </span>make_or : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Creates the disjunction of a list of formulas. An empty disjunction is never satisfied.</p></dd></dl><dl><dt id="val-make_xor"><a href="#val-make_xor" class="anchor"></a><code><span class="keyword">val </span>make_xor : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_xor p q</code> creates the boolean formula &quot;<code>p</code> xor <code>q</code>&quot;.</p></dd></dl><dl><dt id="val-make_imply"><a href="#val-make_imply" class="anchor"></a><code><span class="keyword">val </span>make_imply : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_imply p q</code> creates the boolean formula &quot;<code>p</code> implies <code>q</code>&quot;.</p></dd></dl><dl><dt id="val-make_equiv"><a href="#val-make_equiv" class="anchor"></a><code><span class="keyword">val </span>make_equiv : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_equiv p q</code> creates the boolena formula &quot;<code>p</code> is equivalent to <code>q</code>&quot;.</p></dd></dl><dl><dt id="type-fresh_state"><a href="#type-fresh_state" class="anchor"></a><code><span class="keyword">type </span>fresh_state</code><code></code><code></code></dt><dd><p>State used to produce fresh atoms</p></dd></dl><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code></code><code></code></dt><dd><p>State used for the Tseitin transformation</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : <a href="index.html#type-fresh_state">fresh_state</a> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></dt><dt id="val-make_cnf"><a href="#val-make_cnf" class="anchor"></a><code><span class="keyword">val </span>make_cnf : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list</code></dt><dd><p><code>make_cnf f</code> returns a conjunctive normal form of <code>f</code> under the form: a list (which is a conjunction) of lists (which are disjunctions) of atomic formulas.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>print fmt f</code> prints the formula on the formatter <code>fmt</code>.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/.jbuilder-keep b/sidekick/Sidekick_backend/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_backend/Backend_intf/index.html b/sidekick/Sidekick_backend/Backend_intf/index.html
new file mode 100644
index 00000000..980ab6d1
--- /dev/null
+++ b/sidekick/Sidekick_backend/Backend_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Backend_intf (sidekick.Sidekick_backend.Backend_intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Backend_intf</code></h1></header><aside><p>Backend interface</p><p>This modules defines the interface of the modules providing export of proofs.</p></aside><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Backend_intf/module-type-S/index.html b/sidekick/Sidekick_backend/Backend_intf/module-type-S/index.html
new file mode 100644
index 00000000..8c0d824e
--- /dev/null
+++ b/sidekick/Sidekick_backend/Backend_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend.Backend_intf.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend.Backend_intf.S</code></h1></header><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Make/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend/Coq/Make/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..ee7f8d86
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Make/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend.Coq.Make.1-S.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Coq.Make.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Make/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend/Coq/Make/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..448ab928
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Make/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend.Coq.Make.1-S.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Coq.Make.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Make/argument-1-S/index.html b/sidekick/Sidekick_backend/Coq/Make/argument-1-S/index.html
new file mode 100644
index 00000000..b00cabfa
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Make/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend.Coq.Make.1-S)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Coq.Make.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Make/argument-2-A/index.html b/sidekick/Sidekick_backend/Coq/Make/argument-2-A/index.html
new file mode 100644
index 00000000..e0f52476
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Make/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend.Coq.Make.2-A)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Coq.Make.2-A</code></h1></header><aside><p>Term printing for Coq</p></aside><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The types of hypotheses, lemmas, and assumptions</p></dd></dl><dl><dt id="val-prove_hyp"><a href="#val-prove_hyp" class="anchor"></a><code><span class="keyword">val </span>prove_hyp : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_lemma"><a href="#val-prove_lemma" class="anchor"></a><code><span class="keyword">val </span>prove_lemma : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_assumption"><a href="#val-prove_assumption" class="anchor"></a><code><span class="keyword">val </span>prove_assumption : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Proving function for hypotheses, lemmas and assumptions. <code>prove_x fmt name x</code> should prove <code>x</code>, and be such that after executing it, <code>x</code> is among the coq hypotheses under the name <code>name</code>. The hypothesis should be the encoding of the given clause, i.e for a clause <code>a \/ not b \/ c</code>, the proved hypothesis should be: <code> ~ a -&gt; ~ ~ b -&gt; ~ c -&gt; False </code>, keeping the same order as the one in the atoms array of the clause.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Make/index.html b/sidekick/Sidekick_backend/Coq/Make/index.html
new file mode 100644
index 00000000..a9e66a5d
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_backend.Coq.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Coq.Make</code></h1></header><div class="doc"><p>Base functor to output Coq proofs</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-hyp">hyp</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-assumption">assumption</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Simple/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend/Coq/Simple/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..426b9a37
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Simple/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend.Coq.Simple.1-S.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Coq.Simple.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Simple/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend/Coq/Simple/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..bf5f920e
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Simple/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend.Coq.Simple.1-S.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Coq.Simple.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Simple/argument-1-S/index.html b/sidekick/Sidekick_backend/Coq/Simple/argument-1-S/index.html
new file mode 100644
index 00000000..8852a97d
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Simple/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend.Coq.Simple.1-S)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Coq.Simple.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Simple/argument-2-A/index.html b/sidekick/Sidekick_backend/Coq/Simple/argument-2-A/index.html
new file mode 100644
index 00000000..5e98ce5a
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Simple/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend.Coq.Simple.2-A)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Coq.Simple.2-A</code></h1></header><aside><p>Term printing for Coq</p></aside><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code><span class="keyword"> = </span><a href="../argument-1-S/index.html#type-formula">S.formula</a> list</code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The types of hypotheses, lemmas, and assumptions</p></dd></dl><dl><dt id="val-prove_hyp"><a href="#val-prove_hyp" class="anchor"></a><code><span class="keyword">val </span>prove_hyp : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_lemma"><a href="#val-prove_lemma" class="anchor"></a><code><span class="keyword">val </span>prove_lemma : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_assumption"><a href="#val-prove_assumption" class="anchor"></a><code><span class="keyword">val </span>prove_assumption : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Proving function for hypotheses, lemmas and assumptions. <code>prove_x fmt name x</code> should prove <code>x</code>, and be such that after executing it, <code>x</code> is among the coq hypotheses under the name <code>name</code>. The hypothesis should be the encoding of the given clause, i.e for a clause <code>a \/ not b \/ c</code>, the proved hypothesis should be: <code> ~ a -&gt; ~ ~ b -&gt; ~ c -&gt; False </code>, keeping the same order as the one in the atoms array of the clause.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/Simple/index.html b/sidekick/Sidekick_backend/Coq/Simple/index.html
new file mode 100644
index 00000000..4bdc676c
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/Simple/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Simple (sidekick.Sidekick_backend.Coq.Simple)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Coq.Simple</code></h1></header><div class="doc"><p>Simple functo to output Coq proofs</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-hyp">hyp</a><span class="keyword"> = </span><a href="argument-1-S/index.html#type-formula">S.formula</a> list<span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-assumption">assumption</a> := <a href="argument-1-S/index.html#type-formula">S.formula</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/index.html b/sidekick/Sidekick_backend/Coq/index.html
new file mode 100644
index 00000000..b956aabe
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Coq (sidekick.Sidekick_backend.Coq)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Coq</code></h1></header><aside><p>Coq Backend</p><p>This module provides an easy way to produce coq scripts corresponding to the resolution proofs output by the sat solver.</p></aside><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Backend_intf/index.html#module-type-S">Backend_intf.S</a></code></article><article id="module-type-Arg"><a href="#module-type-Arg" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-Arg/index.html">Arg</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-hyp">hyp</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-lemma">lemma</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-assumption">assumption</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-t">t</a> := <a href="Make/argument-1-S/index.html#type-proof">S.proof</a></code></article><article id="module-Simple"><a href="#module-Simple" class="anchor"></a><code><span class="keyword">module </span><a href="Simple/index.html">Simple</a> : <span class="keyword">functor</span> (<a href="Simple/argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Simple/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Simple/index.html#type-hyp">hyp</a><span class="keyword"> = </span><a href="Simple/argument-1-S/index.html#type-formula">S.formula</a> list<span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-lemma">lemma</a> := <a href="Simple/argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-assumption">assumption</a> := <a href="Simple/argument-1-S/index.html#type-formula">S.formula</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Simple/index.html#type-t">t</a> := <a href="Simple/argument-1-S/index.html#type-proof">S.proof</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/module-type-Arg/index.html b/sidekick/Sidekick_backend/Coq/module-type-Arg/index.html
new file mode 100644
index 00000000..7060acb1
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/module-type-Arg/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Arg (sidekick.Sidekick_backend.Coq.Arg)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend.Coq.Arg</code></h1></header><aside><p>Term printing for Coq</p></aside><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The types of hypotheses, lemmas, and assumptions</p></dd></dl><dl><dt id="val-prove_hyp"><a href="#val-prove_hyp" class="anchor"></a><code><span class="keyword">val </span>prove_hyp : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_lemma"><a href="#val-prove_lemma" class="anchor"></a><code><span class="keyword">val </span>prove_lemma : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_assumption"><a href="#val-prove_assumption" class="anchor"></a><code><span class="keyword">val </span>prove_assumption : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Proving function for hypotheses, lemmas and assumptions. <code>prove_x fmt name x</code> should prove <code>x</code>, and be such that after executing it, <code>x</code> is among the coq hypotheses under the name <code>name</code>. The hypothesis should be the encoding of the given clause, i.e for a clause <code>a \/ not b \/ c</code>, the proved hypothesis should be: <code> ~ a -&gt; ~ ~ b -&gt; ~ c -&gt; False </code>, keeping the same order as the one in the atoms array of the clause.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Coq/module-type-S/index.html b/sidekick/Sidekick_backend/Coq/module-type-S/index.html
new file mode 100644
index 00000000..73819e77
--- /dev/null
+++ b/sidekick/Sidekick_backend/Coq/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend.Coq.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend.Coq.S</code></h1></header><div class="doc"><p>Interface for exporting proofs.</p></div><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..2850911e
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend.Dedukti.Make.1-S.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dedukti.Make.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..58ec94e3
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend.Dedukti.Make.1-S.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dedukti.Make.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/index.html b/sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/index.html
new file mode 100644
index 00000000..de562110
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dedukti/Make/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend.Dedukti.Make.1-S)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Dedukti.Make.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dedukti/Make/argument-2-A/index.html b/sidekick/Sidekick_backend/Dedukti/Make/argument-2-A/index.html
new file mode 100644
index 00000000..1449ed25
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dedukti/Make/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend.Dedukti.Make.2-A)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Dedukti.Make.2-A</code></h1></header><dl><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-formula">formula</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-context"><a href="#val-context" class="anchor"></a><code><span class="keyword">val </span>context : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dedukti/Make/index.html b/sidekick/Sidekick_backend/Dedukti/Make/index.html
new file mode 100644
index 00000000..6e2fbddc
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dedukti/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_backend.Dedukti.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dedukti.Make</code></h1></header><div class="doc"><p>Functor to generate a backend to output proofs for the dedukti type checker.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-formula">formula</a> := <a href="argument-1-S/index.html#type-formula">S.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-proof">proof</a> := <a href="argument-1-S/index.html#type-proof">S.proof</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dedukti/index.html b/sidekick/Sidekick_backend/Dedukti/index.html
new file mode 100644
index 00000000..40d233c5
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dedukti/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Dedukti (sidekick.Sidekick_backend.Dedukti)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dedukti</code></h1></header><aside><p>Deduki backend for proofs</p><p>Work in progress...</p></aside><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Backend_intf/index.html#module-type-S">Backend_intf.S</a></code></article><article id="module-type-Arg"><a href="#module-type-Arg" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-Arg/index.html">Arg</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a> := <a href="Make/argument-1-S/index.html#type-formula">S.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-lemma">lemma</a> := <a href="Make/argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-proof">proof</a> := <a href="Make/argument-1-S/index.html#type-proof">S.proof</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-t">t</a> := <a href="Make/argument-1-S/index.html#type-proof">S.proof</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dedukti/module-type-Arg/index.html b/sidekick/Sidekick_backend/Dedukti/module-type-Arg/index.html
new file mode 100644
index 00000000..b791b8f4
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dedukti/module-type-Arg/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Arg (sidekick.Sidekick_backend.Dedukti.Arg)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend.Dedukti.Arg</code></h1></header><dl><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-formula">formula</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-context"><a href="#val-context" class="anchor"></a><code><span class="keyword">val </span>context : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dedukti/module-type-S/index.html b/sidekick/Sidekick_backend/Dedukti/module-type-S/index.html
new file mode 100644
index 00000000..304a8cf2
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dedukti/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend.Dedukti.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend.Dedukti.S</code></h1></header><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Atom/index.html b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Atom/index.html
new file mode 100644
index 00000000..5b598990
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend.Dimacs.Make.1-St.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dimacs.Make.1-St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Clause/index.html b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Clause/index.html
new file mode 100644
index 00000000..6665d556
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend.Dimacs.Make.1-St.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dimacs.Make.1-St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Formula/index.html b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Formula/index.html
new file mode 100644
index 00000000..3ff72d94
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_backend.Dimacs.Make.1-St.Formula)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dimacs.Make.1-St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Var/index.html b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Var/index.html
new file mode 100644
index 00000000..ffd2f7e7
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_backend.Dimacs.Make.1-St.Var)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dimacs.Make.1-St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/index.html b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/index.html
new file mode 100644
index 00000000..09af1310
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dimacs/Make/argument-1-St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-St (sidekick.Sidekick_backend.Dimacs.Make.1-St)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Dimacs.Make.1-St</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dimacs/Make/index.html b/sidekick/Sidekick_backend/Dimacs/Make/index.html
new file mode 100644
index 00000000..27c5623b
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dimacs/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_backend.Dimacs.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dimacs.Make</code></h1></header><div class="doc"><p>Functor to create a module for exporting probems to the dimacs (&amp; iCNF) formats.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-St/index.html">St</a> : <a href="../../../Sidekick_sat/Solver_types_intf/index.html#module-type-S">Sidekick_sat.Solver_types_intf.S</a></code></dl><h3 class="heading">Signature</h3><dl><dt id="type-st"><a href="#type-st" class="anchor"></a><code><span class="keyword">type </span>st</code><code><span class="keyword"> = </span><a href="argument-1-St/index.html#type-t">St.t</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>The type of clauses</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-st">st</a> <span>&#8209;&gt;</span> Format.formatter <span>&#8209;&gt;</span> hyps:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> history:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> local:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-export_icnf"><a href="#val-export_icnf" class="anchor"></a><code><span class="keyword">val </span>export_icnf : Format.formatter <span>&#8209;&gt;</span> hyps:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> history:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> local:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dimacs/index.html b/sidekick/Sidekick_backend/Dimacs/index.html
new file mode 100644
index 00000000..069c1911
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dimacs/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Dimacs (sidekick.Sidekick_backend.Dimacs)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dimacs</code></h1></header><aside><p>Dimacs backend for problems</p><p>This module provides functiosn to export problems to the dimacs and iCNF formats.</p></aside><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-St/index.html">St</a> : <a href="../../Sidekick_sat/Solver_types_intf/index.html#module-type-S">Sidekick_sat.Solver_types_intf.S</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-clause">clause</a> := <a href="Make/argument-1-St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-st">st</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-t">St.t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dimacs/module-type-S/index.html b/sidekick/Sidekick_backend/Dimacs/module-type-S/index.html
new file mode 100644
index 00000000..44cff5a6
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dimacs/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend.Dimacs.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend.Dimacs.S</code></h1></header><dl><dt id="type-st"><a href="#type-st" class="anchor"></a><code><span class="keyword">type </span>st</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>The type of clauses</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-st">st</a> <span>&#8209;&gt;</span> Format.formatter <span>&#8209;&gt;</span> hyps:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> history:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> local:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-export_icnf"><a href="#val-export_icnf" class="anchor"></a><code><span class="keyword">val </span>export_icnf : Format.formatter <span>&#8209;&gt;</span> hyps:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> history:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> local:<a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Default/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend/Dot/Default/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..72ba9b11
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Default/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend.Dot.Default.1-S.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot.Default.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Default/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend/Dot/Default/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..7b6d162a
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Default/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend.Dot.Default.1-S.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot.Default.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Default/argument-1-S/index.html b/sidekick/Sidekick_backend/Dot/Default/argument-1-S/index.html
new file mode 100644
index 00000000..d58bee81
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Default/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend.Dot.Default.1-S)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Dot.Default.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Default/index.html b/sidekick/Sidekick_backend/Dot/Default/index.html
new file mode 100644
index 00000000..b48e08a8
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Default/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Default (sidekick.Sidekick_backend.Dot.Default)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot.Default</code></h1></header><div class="doc"><p>Provides a reasonnable default to instantiate the <code>Make</code> functor, assuming the original printing functions are compatible with DOT html labels.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-S/index.html">S</a> : <a href="../../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Term printing for DOT</p><p>This module defines what functions are required in order to export a proof to the DOT format.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formuals</p></dd></dl><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The type of theory-specifi proofs (also called lemmas).</p></dd></dl><dl><dt id="val-print_atom"><a href="#val-print_atom" class="anchor"></a><code><span class="keyword">val </span>print_atom : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on).</p></dd></dl><dl><dt id="val-hyp_info"><a href="#val-hyp_info" class="anchor"></a><code><span class="keyword">val </span>hyp_info : <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-lemma_info"><a href="#val-lemma_info" class="anchor"></a><code><span class="keyword">val </span>lemma_info : <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-assumption_info"><a href="#val-assumption_info" class="anchor"></a><code><span class="keyword">val </span>assumption_info : <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dd><p>Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet <code>(rule, color, l)</code>, such that:</p><ul><li><code>rule</code> is a name for the proof (arbitrary, does not need to be unique, but should rather be descriptive)</li><li><code>color</code> is a color name (optional) understood by DOT</li><li><code>l</code> is a list of printers that will be called to print some additional information</li></ul></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Make/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend/Dot/Make/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..51fa5e86
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Make/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend.Dot.Make.1-S.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot.Make.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Make/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend/Dot/Make/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..73eed18b
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Make/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend.Dot.Make.1-S.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot.Make.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Make/argument-1-S/index.html b/sidekick/Sidekick_backend/Dot/Make/argument-1-S/index.html
new file mode 100644
index 00000000..c03e872b
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Make/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend.Dot.Make.1-S)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Dot.Make.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Make/argument-2-A/index.html b/sidekick/Sidekick_backend/Dot/Make/argument-2-A/index.html
new file mode 100644
index 00000000..dc2ff17c
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Make/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend.Dot.Make.2-A)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Dot.Make.2-A</code></h1></header><aside><p>Term printing for DOT</p><p>This module defines what functions are required in order to export a proof to the DOT format.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formuals</p></dd></dl><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The type of theory-specifi proofs (also called lemmas).</p></dd></dl><dl><dt id="val-print_atom"><a href="#val-print_atom" class="anchor"></a><code><span class="keyword">val </span>print_atom : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on).</p></dd></dl><dl><dt id="val-hyp_info"><a href="#val-hyp_info" class="anchor"></a><code><span class="keyword">val </span>hyp_info : <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-lemma_info"><a href="#val-lemma_info" class="anchor"></a><code><span class="keyword">val </span>lemma_info : <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-assumption_info"><a href="#val-assumption_info" class="anchor"></a><code><span class="keyword">val </span>assumption_info : <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dd><p>Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet <code>(rule, color, l)</code>, such that:</p><ul><li><code>rule</code> is a name for the proof (arbitrary, does not need to be unique, but should rather be descriptive)</li><li><code>color</code> is a color name (optional) understood by DOT</li><li><code>l</code> is a list of printers that will be called to print some additional information</li></ul></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Make/index.html b/sidekick/Sidekick_backend/Dot/Make/index.html
new file mode 100644
index 00000000..d40fe7bf
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_backend.Dot.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot.Make</code></h1></header><div class="doc"><p>Functor for making a module to export proofs to the DOT format.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-atom">atom</a> := <a href="argument-1-S/index.html#type-atom">S.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-hyp">hyp</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-assumption">assumption</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Simple/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend/Dot/Simple/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..fa3ad350
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Simple/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend.Dot.Simple.1-S.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot.Simple.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Simple/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend/Dot/Simple/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..c0cc3b17
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Simple/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend.Dot.Simple.1-S.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot.Simple.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Simple/argument-1-S/index.html b/sidekick/Sidekick_backend/Dot/Simple/argument-1-S/index.html
new file mode 100644
index 00000000..0e9581a5
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Simple/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend.Dot.Simple.1-S)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Dot.Simple.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Simple/argument-2-A/index.html b/sidekick/Sidekick_backend/Dot/Simple/argument-2-A/index.html
new file mode 100644
index 00000000..61234cce
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Simple/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend.Dot.Simple.2-A)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend.Dot.Simple.2-A</code></h1></header><aside><p>Term printing for DOT</p><p>This module defines what functions are required in order to export a proof to the DOT format.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formuals</p></dd></dl><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code><span class="keyword"> = </span><a href="../argument-1-S/index.html#type-formula">S.formula</a> list</code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code><span class="keyword"> = </span><a href="../argument-1-S/index.html#type-formula">S.formula</a></code><code></code></dt><dd><p>The type of theory-specifi proofs (also called lemmas).</p></dd></dl><dl><dt id="val-print_atom"><a href="#val-print_atom" class="anchor"></a><code><span class="keyword">val </span>print_atom : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on).</p></dd></dl><dl><dt id="val-hyp_info"><a href="#val-hyp_info" class="anchor"></a><code><span class="keyword">val </span>hyp_info : <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-lemma_info"><a href="#val-lemma_info" class="anchor"></a><code><span class="keyword">val </span>lemma_info : <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-assumption_info"><a href="#val-assumption_info" class="anchor"></a><code><span class="keyword">val </span>assumption_info : <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dd><p>Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet <code>(rule, color, l)</code>, such that:</p><ul><li><code>rule</code> is a name for the proof (arbitrary, does not need to be unique, but should rather be descriptive)</li><li><code>color</code> is a color name (optional) understood by DOT</li><li><code>l</code> is a list of printers that will be called to print some additional information</li></ul></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/Simple/index.html b/sidekick/Sidekick_backend/Dot/Simple/index.html
new file mode 100644
index 00000000..6cc508eb
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/Simple/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Simple (sidekick.Sidekick_backend.Dot.Simple)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot.Simple</code></h1></header><div class="doc"><p>Functor for making a module to export proofs to the DOT format. The substitution of the hyp type is non-destructive due to a restriction of destructive substitutions on earlier versions of ocaml.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-atom">atom</a> := <a href="argument-1-S/index.html#type-formula">S.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-hyp">hyp</a><span class="keyword"> = </span><a href="argument-1-S/index.html#type-formula">S.formula</a> list<span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-assumption">assumption</a><span class="keyword"> = </span><a href="argument-1-S/index.html#type-formula">S.formula</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/index.html b/sidekick/Sidekick_backend/Dot/index.html
new file mode 100644
index 00000000..94520fd6
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Dot (sidekick.Sidekick_backend.Dot)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend.Dot</code></h1></header><aside><p>Dot backend for proofs</p><p>This module provides functions to export proofs into the dot graph format. Graphs in dot format can be used to generates images using the graphviz tool.</p></aside><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Backend_intf/index.html#module-type-S">Backend_intf.S</a></code></article><article id="module-type-Arg"><a href="#module-type-Arg" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-Arg/index.html">Arg</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Default"><a href="#module-Default" class="anchor"></a><code><span class="keyword">module </span><a href="Default/index.html">Default</a> : <span class="keyword">functor</span> (<a href="Default/argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Default/index.html#type-atom">atom</a> := <a href="Default/argument-1-S/index.html#type-atom">S.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Default/index.html#type-hyp">hyp</a> := <a href="Default/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Default/index.html#type-lemma">lemma</a> := <a href="Default/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Default/index.html#type-assumption">assumption</a> := <a href="Default/argument-1-S/index.html#type-clause">S.clause</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-atom">atom</a> := <a href="Make/argument-1-S/index.html#type-atom">S.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-hyp">hyp</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-lemma">lemma</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-assumption">assumption</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-t">t</a> := <a href="Make/argument-1-S/index.html#type-proof">S.proof</a></code></article><article id="module-Simple"><a href="#module-Simple" class="anchor"></a><code><span class="keyword">module </span><a href="Simple/index.html">Simple</a> : <span class="keyword">functor</span> (<a href="Simple/argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Simple/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Simple/index.html#type-atom">atom</a> := <a href="Simple/argument-1-S/index.html#type-formula">S.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-hyp">hyp</a><span class="keyword"> = </span><a href="Simple/argument-1-S/index.html#type-formula">S.formula</a> list<span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-lemma">lemma</a> := <a href="Simple/argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-assumption">assumption</a><span class="keyword"> = </span><a href="Simple/argument-1-S/index.html#type-formula">S.formula</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Simple/index.html#type-t">t</a> := <a href="Simple/argument-1-S/index.html#type-proof">S.proof</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/module-type-Arg/index.html b/sidekick/Sidekick_backend/Dot/module-type-Arg/index.html
new file mode 100644
index 00000000..76988fff
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/module-type-Arg/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Arg (sidekick.Sidekick_backend.Dot.Arg)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend.Dot.Arg</code></h1></header><aside><p>Term printing for DOT</p><p>This module defines what functions are required in order to export a proof to the DOT format.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formuals</p></dd></dl><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The type of theory-specifi proofs (also called lemmas).</p></dd></dl><dl><dt id="val-print_atom"><a href="#val-print_atom" class="anchor"></a><code><span class="keyword">val </span>print_atom : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on).</p></dd></dl><dl><dt id="val-hyp_info"><a href="#val-hyp_info" class="anchor"></a><code><span class="keyword">val </span>hyp_info : <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-lemma_info"><a href="#val-lemma_info" class="anchor"></a><code><span class="keyword">val </span>lemma_info : <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-assumption_info"><a href="#val-assumption_info" class="anchor"></a><code><span class="keyword">val </span>assumption_info : <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dd><p>Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet <code>(rule, color, l)</code>, such that:</p><ul><li><code>rule</code> is a name for the proof (arbitrary, does not need to be unique, but should rather be descriptive)</li><li><code>color</code> is a color name (optional) understood by DOT</li><li><code>l</code> is a list of printers that will be called to print some additional information</li></ul></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/Dot/module-type-S/index.html b/sidekick/Sidekick_backend/Dot/module-type-S/index.html
new file mode 100644
index 00000000..b7a4857c
--- /dev/null
+++ b/sidekick/Sidekick_backend/Dot/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend.Dot.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend.Dot.S</code></h1></header><div class="doc"><p>Interface for exporting proofs.</p></div><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend/index.html b/sidekick/Sidekick_backend/index.html
new file mode 100644
index 00000000..1401cf45
--- /dev/null
+++ b/sidekick/Sidekick_backend/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_backend (sidekick.Sidekick_backend)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend</code></h1></header><article id="module-Backend_intf"><a href="#module-Backend_intf" class="anchor"></a><code><span class="keyword">module </span><a href="Backend_intf/index.html">Backend_intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Coq"><a href="#module-Coq" class="anchor"></a><code><span class="keyword">module </span><a href="Coq/index.html">Coq</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Dedukti"><a href="#module-Dedukti" class="anchor"></a><code><span class="keyword">module </span><a href="Dedukti/index.html">Dedukti</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Dimacs"><a href="#module-Dimacs" class="anchor"></a><code><span class="keyword">module </span><a href="Dimacs/index.html">Dimacs</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Dot"><a href="#module-Dot" class="anchor"></a><code><span class="keyword">module </span><a href="Dot/index.html">Dot</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Backend_intf/.jbuilder-keep b/sidekick/Sidekick_backend__Backend_intf/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_backend__Backend_intf/index.html b/sidekick/Sidekick_backend__Backend_intf/index.html
new file mode 100644
index 00000000..7167b12c
--- /dev/null
+++ b/sidekick/Sidekick_backend__Backend_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_backend__Backend_intf (sidekick.Sidekick_backend__Backend_intf)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Backend_intf</code></h1><p>Backend interface</p><p>This modules defines the interface of the modules providing export of proofs.</p></header><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Backend_intf/module-type-S/index.html b/sidekick/Sidekick_backend__Backend_intf/module-type-S/index.html
new file mode 100644
index 00000000..1263545a
--- /dev/null
+++ b/sidekick/Sidekick_backend__Backend_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend__Backend_intf.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend__Backend_intf.S</code></h1></header><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/.jbuilder-keep b/sidekick/Sidekick_backend__Coq/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_backend__Coq/Make/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend__Coq/Make/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..d61f6998
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Make/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend__Coq.Make.1-S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Coq.Make.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/Make/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend__Coq/Make/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..139d49a3
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Make/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend__Coq.Make.1-S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Coq.Make.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/Make/argument-1-S/index.html b/sidekick/Sidekick_backend__Coq/Make/argument-1-S/index.html
new file mode 100644
index 00000000..076e33c1
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Make/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend__Coq.Make.1-S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Coq.Make.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/Make/argument-2-A/index.html b/sidekick/Sidekick_backend__Coq/Make/argument-2-A/index.html
new file mode 100644
index 00000000..26a69484
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Make/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend__Coq.Make.2-A)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Coq.Make.2-A</code></h1></header><aside><p>Term printing for Coq</p></aside><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The types of hypotheses, lemmas, and assumptions</p></dd></dl><dl><dt id="val-prove_hyp"><a href="#val-prove_hyp" class="anchor"></a><code><span class="keyword">val </span>prove_hyp : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_lemma"><a href="#val-prove_lemma" class="anchor"></a><code><span class="keyword">val </span>prove_lemma : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_assumption"><a href="#val-prove_assumption" class="anchor"></a><code><span class="keyword">val </span>prove_assumption : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Proving function for hypotheses, lemmas and assumptions. <code>prove_x fmt name x</code> should prove <code>x</code>, and be such that after executing it, <code>x</code> is among the coq hypotheses under the name <code>name</code>. The hypothesis should be the encoding of the given clause, i.e for a clause <code>a \/ not b \/ c</code>, the proved hypothesis should be: <code> ~ a -&gt; ~ ~ b -&gt; ~ c -&gt; False </code>, keeping the same order as the one in the atoms array of the clause.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/Make/index.html b/sidekick/Sidekick_backend__Coq/Make/index.html
new file mode 100644
index 00000000..b68c58d1
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_backend__Coq.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Coq.Make</code></h1></header><div class="doc"><p>Base functor to output Coq proofs</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-hyp">hyp</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-assumption">assumption</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/Simple/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend__Coq/Simple/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..64892010
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Simple/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend__Coq.Simple.1-S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Coq.Simple.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/Simple/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend__Coq/Simple/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..5a51673c
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Simple/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend__Coq.Simple.1-S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Coq.Simple.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/Simple/argument-1-S/index.html b/sidekick/Sidekick_backend__Coq/Simple/argument-1-S/index.html
new file mode 100644
index 00000000..f1f4a7f7
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Simple/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend__Coq.Simple.1-S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Coq.Simple.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/Simple/argument-2-A/index.html b/sidekick/Sidekick_backend__Coq/Simple/argument-2-A/index.html
new file mode 100644
index 00000000..a97de9fc
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Simple/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend__Coq.Simple.2-A)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Coq.Simple.2-A</code></h1></header><aside><p>Term printing for Coq</p></aside><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code><span class="keyword"> = </span><a href="../argument-1-S/index.html#type-formula">S.formula</a> list</code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The types of hypotheses, lemmas, and assumptions</p></dd></dl><dl><dt id="val-prove_hyp"><a href="#val-prove_hyp" class="anchor"></a><code><span class="keyword">val </span>prove_hyp : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_lemma"><a href="#val-prove_lemma" class="anchor"></a><code><span class="keyword">val </span>prove_lemma : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_assumption"><a href="#val-prove_assumption" class="anchor"></a><code><span class="keyword">val </span>prove_assumption : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Proving function for hypotheses, lemmas and assumptions. <code>prove_x fmt name x</code> should prove <code>x</code>, and be such that after executing it, <code>x</code> is among the coq hypotheses under the name <code>name</code>. The hypothesis should be the encoding of the given clause, i.e for a clause <code>a \/ not b \/ c</code>, the proved hypothesis should be: <code> ~ a -&gt; ~ ~ b -&gt; ~ c -&gt; False </code>, keeping the same order as the one in the atoms array of the clause.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/Simple/index.html b/sidekick/Sidekick_backend__Coq/Simple/index.html
new file mode 100644
index 00000000..6cbe428f
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/Simple/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Simple (sidekick.Sidekick_backend__Coq.Simple)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Coq.Simple</code></h1></header><div class="doc"><p>Simple functo to output Coq proofs</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-hyp">hyp</a><span class="keyword"> = </span><a href="argument-1-S/index.html#type-formula">S.formula</a> list<span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-assumption">assumption</a> := <a href="argument-1-S/index.html#type-formula">S.formula</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/index.html b/sidekick/Sidekick_backend__Coq/index.html
new file mode 100644
index 00000000..3efc2147
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_backend__Coq (sidekick.Sidekick_backend__Coq)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Coq</code></h1><p>Coq Backend</p><p>This module provides an easy way to produce coq scripts corresponding to the resolution proofs output by the sat solver.</p></header><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Sidekick_backend/Backend_intf/index.html#module-type-S">Sidekick_backend.Backend_intf.S</a></code></article><article id="module-type-Arg"><a href="#module-type-Arg" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-Arg/index.html">Arg</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-S/index.html">S</a> : <a href="../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-hyp">hyp</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-lemma">lemma</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-assumption">assumption</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-t">t</a> := <a href="Make/argument-1-S/index.html#type-proof">S.proof</a></code></article><article id="module-Simple"><a href="#module-Simple" class="anchor"></a><code><span class="keyword">module </span><a href="Simple/index.html">Simple</a> : <span class="keyword">functor</span> (<a href="Simple/argument-1-S/index.html">S</a> : <a href="../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Simple/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Simple/index.html#type-hyp">hyp</a><span class="keyword"> = </span><a href="Simple/argument-1-S/index.html#type-formula">S.formula</a> list<span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-lemma">lemma</a> := <a href="Simple/argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-assumption">assumption</a> := <a href="Simple/argument-1-S/index.html#type-formula">S.formula</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Simple/index.html#type-t">t</a> := <a href="Simple/argument-1-S/index.html#type-proof">S.proof</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/module-type-Arg/index.html b/sidekick/Sidekick_backend__Coq/module-type-Arg/index.html
new file mode 100644
index 00000000..25e96bc7
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/module-type-Arg/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Arg (sidekick.Sidekick_backend__Coq.Arg)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend__Coq.Arg</code></h1></header><aside><p>Term printing for Coq</p></aside><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The types of hypotheses, lemmas, and assumptions</p></dd></dl><dl><dt id="val-prove_hyp"><a href="#val-prove_hyp" class="anchor"></a><code><span class="keyword">val </span>prove_hyp : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_lemma"><a href="#val-prove_lemma" class="anchor"></a><code><span class="keyword">val </span>prove_lemma : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove_assumption"><a href="#val-prove_assumption" class="anchor"></a><code><span class="keyword">val </span>prove_assumption : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Proving function for hypotheses, lemmas and assumptions. <code>prove_x fmt name x</code> should prove <code>x</code>, and be such that after executing it, <code>x</code> is among the coq hypotheses under the name <code>name</code>. The hypothesis should be the encoding of the given clause, i.e for a clause <code>a \/ not b \/ c</code>, the proved hypothesis should be: <code> ~ a -&gt; ~ ~ b -&gt; ~ c -&gt; False </code>, keeping the same order as the one in the atoms array of the clause.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Coq/module-type-S/index.html b/sidekick/Sidekick_backend__Coq/module-type-S/index.html
new file mode 100644
index 00000000..1d5cfe58
--- /dev/null
+++ b/sidekick/Sidekick_backend__Coq/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend__Coq.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend__Coq.S</code></h1></header><div class="doc"><p>Interface for exporting proofs.</p></div><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dedukti/.jbuilder-keep b/sidekick/Sidekick_backend__Dedukti/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..51b7f9d9
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend__Dedukti.Make.1-S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dedukti.Make.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..29fd67eb
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend__Dedukti.Make.1-S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dedukti.Make.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/index.html b/sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/index.html
new file mode 100644
index 00000000..e04c3e1a
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dedukti/Make/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend__Dedukti.Make.1-S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Dedukti.Make.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dedukti/Make/argument-2-A/index.html b/sidekick/Sidekick_backend__Dedukti/Make/argument-2-A/index.html
new file mode 100644
index 00000000..79f8e4b8
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dedukti/Make/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend__Dedukti.Make.2-A)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Dedukti.Make.2-A</code></h1></header><dl><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-formula">formula</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-context"><a href="#val-context" class="anchor"></a><code><span class="keyword">val </span>context : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dedukti/Make/index.html b/sidekick/Sidekick_backend__Dedukti/Make/index.html
new file mode 100644
index 00000000..881c9d83
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dedukti/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_backend__Dedukti.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dedukti.Make</code></h1></header><div class="doc"><p>Functor to generate a backend to output proofs for the dedukti type checker.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-formula">formula</a> := <a href="argument-1-S/index.html#type-formula">S.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-proof">proof</a> := <a href="argument-1-S/index.html#type-proof">S.proof</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dedukti/index.html b/sidekick/Sidekick_backend__Dedukti/index.html
new file mode 100644
index 00000000..31b271a9
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dedukti/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_backend__Dedukti (sidekick.Sidekick_backend__Dedukti)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dedukti</code></h1><p>Deduki backend for proofs</p><p>Work in progress...</p></header><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Sidekick_backend/Backend_intf/index.html#module-type-S">Sidekick_backend.Backend_intf.S</a></code></article><article id="module-type-Arg"><a href="#module-type-Arg" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-Arg/index.html">Arg</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-S/index.html">S</a> : <a href="../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a> := <a href="Make/argument-1-S/index.html#type-formula">S.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-lemma">lemma</a> := <a href="Make/argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-proof">proof</a> := <a href="Make/argument-1-S/index.html#type-proof">S.proof</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-t">t</a> := <a href="Make/argument-1-S/index.html#type-proof">S.proof</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dedukti/module-type-Arg/index.html b/sidekick/Sidekick_backend__Dedukti/module-type-Arg/index.html
new file mode 100644
index 00000000..ea414288
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dedukti/module-type-Arg/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Arg (sidekick.Sidekick_backend__Dedukti.Arg)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend__Dedukti.Arg</code></h1></header><dl><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-formula">formula</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-context"><a href="#val-context" class="anchor"></a><code><span class="keyword">val </span>context : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dedukti/module-type-S/index.html b/sidekick/Sidekick_backend__Dedukti/module-type-S/index.html
new file mode 100644
index 00000000..13d768c0
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dedukti/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend__Dedukti.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend__Dedukti.S</code></h1></header><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dimacs/.jbuilder-keep b/sidekick/Sidekick_backend__Dimacs/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Atom/index.html b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Atom/index.html
new file mode 100644
index 00000000..89dca358
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend__Dimacs.Make.1-St.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dimacs.Make.1-St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Clause/index.html b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Clause/index.html
new file mode 100644
index 00000000..4ccc2072
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend__Dimacs.Make.1-St.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dimacs.Make.1-St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Formula/index.html b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Formula/index.html
new file mode 100644
index 00000000..5508b5a9
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_backend__Dimacs.Make.1-St.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dimacs.Make.1-St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Var/index.html b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Var/index.html
new file mode 100644
index 00000000..2995bf5c
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_backend__Dimacs.Make.1-St.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dimacs.Make.1-St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/index.html b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/index.html
new file mode 100644
index 00000000..9dc9f736
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dimacs/Make/argument-1-St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-St (sidekick.Sidekick_backend__Dimacs.Make.1-St)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Dimacs.Make.1-St</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dimacs/Make/index.html b/sidekick/Sidekick_backend__Dimacs/Make/index.html
new file mode 100644
index 00000000..e0eabaf0
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dimacs/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_backend__Dimacs.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dimacs.Make</code></h1></header><div class="doc"><p>Functor to create a module for exporting probems to the dimacs (&amp; iCNF) formats.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-St/index.html">St</a> : <a href="../../Sidekick_sat/Solver_types_intf/index.html#module-type-S">Sidekick_sat.Solver_types_intf.S</a></code></dl><h3 class="heading">Signature</h3><dl><dt id="type-st"><a href="#type-st" class="anchor"></a><code><span class="keyword">type </span>st</code><code><span class="keyword"> = </span><a href="argument-1-St/index.html#type-t">St.t</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>The type of clauses</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-st">st</a> <span>&#8209;&gt;</span> Format.formatter <span>&#8209;&gt;</span> hyps:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> history:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> local:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-export_icnf"><a href="#val-export_icnf" class="anchor"></a><code><span class="keyword">val </span>export_icnf : Format.formatter <span>&#8209;&gt;</span> hyps:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> history:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> local:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dimacs/index.html b/sidekick/Sidekick_backend__Dimacs/index.html
new file mode 100644
index 00000000..4845a064
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dimacs/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_backend__Dimacs (sidekick.Sidekick_backend__Dimacs)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dimacs</code></h1><p>Dimacs backend for problems</p><p>This module provides functiosn to export problems to the dimacs and iCNF formats.</p></header><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-St/index.html">St</a> : <a href="../Sidekick_sat/Solver_types_intf/index.html#module-type-S">Sidekick_sat.Solver_types_intf.S</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-clause">clause</a> := <a href="Make/argument-1-St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-st">st</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-t">St.t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dimacs/module-type-S/index.html b/sidekick/Sidekick_backend__Dimacs/module-type-S/index.html
new file mode 100644
index 00000000..9a38fe41
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dimacs/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend__Dimacs.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend__Dimacs.S</code></h1></header><dl><dt id="type-st"><a href="#type-st" class="anchor"></a><code><span class="keyword">type </span>st</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>The type of clauses</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-st">st</a> <span>&#8209;&gt;</span> Format.formatter <span>&#8209;&gt;</span> hyps:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> history:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> local:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-export_icnf"><a href="#val-export_icnf" class="anchor"></a><code><span class="keyword">val </span>export_icnf : Format.formatter <span>&#8209;&gt;</span> hyps:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> history:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> local:<a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_sat.Vec.t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/.jbuilder-keep b/sidekick/Sidekick_backend__Dot/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_backend__Dot/Default/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend__Dot/Default/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..ab423420
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Default/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend__Dot.Default.1-S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot.Default.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Default/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend__Dot/Default/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..1f00b82d
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Default/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend__Dot.Default.1-S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot.Default.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Default/argument-1-S/index.html b/sidekick/Sidekick_backend__Dot/Default/argument-1-S/index.html
new file mode 100644
index 00000000..2be211f9
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Default/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend__Dot.Default.1-S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Dot.Default.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Default/index.html b/sidekick/Sidekick_backend__Dot/Default/index.html
new file mode 100644
index 00000000..f10df12d
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Default/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Default (sidekick.Sidekick_backend__Dot.Default)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot.Default</code></h1></header><div class="doc"><p>Provides a reasonnable default to instantiate the <code>Make</code> functor, assuming the original printing functions are compatible with DOT html labels.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Term printing for DOT</p><p>This module defines what functions are required in order to export a proof to the DOT format.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formuals</p></dd></dl><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The type of theory-specifi proofs (also called lemmas).</p></dd></dl><dl><dt id="val-print_atom"><a href="#val-print_atom" class="anchor"></a><code><span class="keyword">val </span>print_atom : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on).</p></dd></dl><dl><dt id="val-hyp_info"><a href="#val-hyp_info" class="anchor"></a><code><span class="keyword">val </span>hyp_info : <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-lemma_info"><a href="#val-lemma_info" class="anchor"></a><code><span class="keyword">val </span>lemma_info : <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-assumption_info"><a href="#val-assumption_info" class="anchor"></a><code><span class="keyword">val </span>assumption_info : <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dd><p>Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet <code>(rule, color, l)</code>, such that:</p><ul><li><code>rule</code> is a name for the proof (arbitrary, does not need to be unique, but should rather be descriptive)</li><li><code>color</code> is a color name (optional) understood by DOT</li><li><code>l</code> is a list of printers that will be called to print some additional information</li></ul></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Make/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend__Dot/Make/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..f1a92c24
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Make/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend__Dot.Make.1-S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot.Make.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Make/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend__Dot/Make/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..737a0208
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Make/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend__Dot.Make.1-S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot.Make.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Make/argument-1-S/index.html b/sidekick/Sidekick_backend__Dot/Make/argument-1-S/index.html
new file mode 100644
index 00000000..5d0cc39c
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Make/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend__Dot.Make.1-S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Dot.Make.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Make/argument-2-A/index.html b/sidekick/Sidekick_backend__Dot/Make/argument-2-A/index.html
new file mode 100644
index 00000000..4db21f36
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Make/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend__Dot.Make.2-A)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Dot.Make.2-A</code></h1></header><aside><p>Term printing for DOT</p><p>This module defines what functions are required in order to export a proof to the DOT format.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formuals</p></dd></dl><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The type of theory-specifi proofs (also called lemmas).</p></dd></dl><dl><dt id="val-print_atom"><a href="#val-print_atom" class="anchor"></a><code><span class="keyword">val </span>print_atom : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on).</p></dd></dl><dl><dt id="val-hyp_info"><a href="#val-hyp_info" class="anchor"></a><code><span class="keyword">val </span>hyp_info : <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-lemma_info"><a href="#val-lemma_info" class="anchor"></a><code><span class="keyword">val </span>lemma_info : <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-assumption_info"><a href="#val-assumption_info" class="anchor"></a><code><span class="keyword">val </span>assumption_info : <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dd><p>Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet <code>(rule, color, l)</code>, such that:</p><ul><li><code>rule</code> is a name for the proof (arbitrary, does not need to be unique, but should rather be descriptive)</li><li><code>color</code> is a color name (optional) understood by DOT</li><li><code>l</code> is a list of printers that will be called to print some additional information</li></ul></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Make/index.html b/sidekick/Sidekick_backend__Dot/Make/index.html
new file mode 100644
index 00000000..064a6a5f
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_backend__Dot.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot.Make</code></h1></header><div class="doc"><p>Functor for making a module to export proofs to the DOT format.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-atom">atom</a> := <a href="argument-1-S/index.html#type-atom">S.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-hyp">hyp</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-assumption">assumption</a> := <a href="argument-1-S/index.html#type-clause">S.clause</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Simple/argument-1-S/Atom/index.html b/sidekick/Sidekick_backend__Dot/Simple/argument-1-S/Atom/index.html
new file mode 100644
index 00000000..53706e8a
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Simple/argument-1-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_backend__Dot.Simple.1-S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot.Simple.1-S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Simple/argument-1-S/Clause/index.html b/sidekick/Sidekick_backend__Dot/Simple/argument-1-S/Clause/index.html
new file mode 100644
index 00000000..e170d532
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Simple/argument-1-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_backend__Dot.Simple.1-S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot.Simple.1-S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Simple/argument-1-S/index.html b/sidekick/Sidekick_backend__Dot/Simple/argument-1-S/index.html
new file mode 100644
index 00000000..8e62e2ea
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Simple/argument-1-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-S (sidekick.Sidekick_backend__Dot.Simple.1-S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Dot.Simple.1-S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Simple/argument-2-A/index.html b/sidekick/Sidekick_backend__Dot/Simple/argument-2-A/index.html
new file mode 100644
index 00000000..e4123f98
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Simple/argument-2-A/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend__Dot.Simple.2-A)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_backend__Dot.Simple.2-A</code></h1></header><aside><p>Term printing for DOT</p><p>This module defines what functions are required in order to export a proof to the DOT format.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formuals</p></dd></dl><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code><span class="keyword"> = </span><a href="../argument-1-S/index.html#type-formula">S.formula</a> list</code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code><span class="keyword"> = </span><a href="../argument-1-S/index.html#type-formula">S.formula</a></code><code></code></dt><dd><p>The type of theory-specifi proofs (also called lemmas).</p></dd></dl><dl><dt id="val-print_atom"><a href="#val-print_atom" class="anchor"></a><code><span class="keyword">val </span>print_atom : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on).</p></dd></dl><dl><dt id="val-hyp_info"><a href="#val-hyp_info" class="anchor"></a><code><span class="keyword">val </span>hyp_info : <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-lemma_info"><a href="#val-lemma_info" class="anchor"></a><code><span class="keyword">val </span>lemma_info : <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-assumption_info"><a href="#val-assumption_info" class="anchor"></a><code><span class="keyword">val </span>assumption_info : <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dd><p>Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet <code>(rule, color, l)</code>, such that:</p><ul><li><code>rule</code> is a name for the proof (arbitrary, does not need to be unique, but should rather be descriptive)</li><li><code>color</code> is a color name (optional) understood by DOT</li><li><code>l</code> is a list of printers that will be called to print some additional information</li></ul></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/Simple/index.html b/sidekick/Sidekick_backend__Dot/Simple/index.html
new file mode 100644
index 00000000..31056887
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/Simple/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Simple (sidekick.Sidekick_backend__Dot.Simple)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot.Simple</code></h1></header><div class="doc"><p>Functor for making a module to export proofs to the DOT format. The substitution of the hyp type is non-destructive due to a restriction of destructive substitutions on earlier versions of ocaml.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-A/index.html">A</a> : <a href="../index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-atom">atom</a> := <a href="argument-1-S/index.html#type-formula">S.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-hyp">hyp</a><span class="keyword"> = </span><a href="argument-1-S/index.html#type-formula">S.formula</a> list<span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-lemma">lemma</a> := <a href="argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-A/index.html#type-assumption">assumption</a><span class="keyword"> = </span><a href="argument-1-S/index.html#type-formula">S.formula</a></code><code><a href="argument-1-S/index.html">S</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/index.html b/sidekick/Sidekick_backend__Dot/index.html
new file mode 100644
index 00000000..7caf4787
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_backend__Dot (sidekick.Sidekick_backend__Dot)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_backend__Dot</code></h1><p>Dot backend for proofs</p><p>This module provides functions to export proofs into the dot graph format. Graphs in dot format can be used to generates images using the graphviz tool.</p></header><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Sidekick_backend/Backend_intf/index.html#module-type-S">Sidekick_backend.Backend_intf.S</a></code></article><article id="module-type-Arg"><a href="#module-type-Arg" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-Arg/index.html">Arg</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Default"><a href="#module-Default" class="anchor"></a><code><span class="keyword">module </span><a href="Default/index.html">Default</a> : <span class="keyword">functor</span> (<a href="Default/argument-1-S/index.html">S</a> : <a href="../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Default/index.html#type-atom">atom</a> := <a href="Default/argument-1-S/index.html#type-atom">S.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Default/index.html#type-hyp">hyp</a> := <a href="Default/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Default/index.html#type-lemma">lemma</a> := <a href="Default/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Default/index.html#type-assumption">assumption</a> := <a href="Default/argument-1-S/index.html#type-clause">S.clause</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-S/index.html">S</a> : <a href="../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-atom">atom</a> := <a href="Make/argument-1-S/index.html#type-atom">S.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-hyp">hyp</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-lemma">lemma</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-assumption">assumption</a> := <a href="Make/argument-1-S/index.html#type-clause">S.clause</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-t">t</a> := <a href="Make/argument-1-S/index.html#type-proof">S.proof</a></code></article><article id="module-Simple"><a href="#module-Simple" class="anchor"></a><code><span class="keyword">module </span><a href="Simple/index.html">Simple</a> : <span class="keyword">functor</span> (<a href="Simple/argument-1-S/index.html">S</a> : <a href="../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Simple/argument-2-A/index.html">A</a> : <a href="index.html#module-type-Arg">Arg</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Simple/index.html#type-atom">atom</a> := <a href="Simple/argument-1-S/index.html#type-formula">S.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-hyp">hyp</a><span class="keyword"> = </span><a href="Simple/argument-1-S/index.html#type-formula">S.formula</a> list<span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-lemma">lemma</a> := <a href="Simple/argument-1-S/index.html#type-lemma">S.lemma</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Simple/index.html#type-assumption">assumption</a><span class="keyword"> = </span><a href="Simple/argument-1-S/index.html#type-formula">S.formula</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Simple/index.html#type-t">t</a> := <a href="Simple/argument-1-S/index.html#type-proof">S.proof</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/module-type-Arg/index.html b/sidekick/Sidekick_backend__Dot/module-type-Arg/index.html
new file mode 100644
index 00000000..7b25c2b8
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/module-type-Arg/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Arg (sidekick.Sidekick_backend__Dot.Arg)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend__Dot.Arg</code></h1></header><aside><p>Term printing for DOT</p><p>This module defines what functions are required in order to export a proof to the DOT format.</p></aside><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dd><p>The type of atomic formuals</p></dd></dl><dl><dt id="type-hyp"><a href="#type-hyp" class="anchor"></a><code><span class="keyword">type </span>hyp</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-assumption"><a href="#type-assumption" class="anchor"></a><code><span class="keyword">type </span>assumption</code><code></code><code></code></dt><dd><p>The type of theory-specifi proofs (also called lemmas).</p></dd></dl><dl><dt id="val-print_atom"><a href="#val-print_atom" class="anchor"></a><code><span class="keyword">val </span>print_atom : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Print the contents of the given atomic formulas. WARNING: this function should take care to escape and/or not output special reserved characters for the dot format (such as quotes and so on).</p></dd></dl><dl><dt id="val-hyp_info"><a href="#val-hyp_info" class="anchor"></a><code><span class="keyword">val </span>hyp_info : <a href="index.html#type-hyp">hyp</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-lemma_info"><a href="#val-lemma_info" class="anchor"></a><code><span class="keyword">val </span>lemma_info : <a href="index.html#type-lemma">lemma</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dt id="val-assumption_info"><a href="#val-assumption_info" class="anchor"></a><code><span class="keyword">val </span>assumption_info : <a href="index.html#type-assumption">assumption</a> <span>&#8209;&gt;</span> string<span class="keyword"> * </span>string option<span class="keyword"> * </span>(Format.formatter <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> unit) list</code></dt><dd><p>Generate some information about the leafs of the proof tree. Currently this backend print each lemma/assumption/hypothesis as a single leaf of the proof tree. These function should return a triplet <code>(rule, color, l)</code>, such that:</p><ul><li><code>rule</code> is a name for the proof (arbitrary, does not need to be unique, but should rather be descriptive)</li><li><code>color</code> is a color name (optional) understood by DOT</li><li><code>l</code> is a list of printers that will be called to print some additional information</li></ul></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_backend__Dot/module-type-S/index.html b/sidekick/Sidekick_backend__Dot/module-type-S/index.html
new file mode 100644
index 00000000..bf82e668
--- /dev/null
+++ b/sidekick/Sidekick_backend__Dot/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_backend__Dot.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_backend__Dot.S</code></h1></header><div class="doc"><p>Interface for exporting proofs.</p></div><aside><p>Proof exporting</p><p>Currently, exporting a proof means printing it into a file according to the conventions of a given format.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>The type of proofs.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>A function for printing proofs in the desired format.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_dimacs/.jbuilder-keep b/sidekick/Sidekick_dimacs/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_dimacs/index.html b/sidekick/Sidekick_dimacs/index.html
new file mode 100644
index 00000000..972bd694
--- /dev/null
+++ b/sidekick/Sidekick_dimacs/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_dimacs (sidekick.Sidekick_dimacs)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_dimacs</code></h1><h1 id="main-for-dimacs"><a href="#main-for-dimacs" class="anchor"></a>Main for dimacs</h1></header><aside><p>This library provides a parser for DIMACS files, to represent SAT problems.</p><p>http://www.satcompetition.org/2009/format-benchmarks2009.html</p></aside><dl><dt id="type-or_error"><a href="#type-or_error" class="anchor"></a><code><span class="keyword">type </span>'a or_error</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span>, string) CCResult.t</code><code></code></dt></dl><dl><dt id="val-parse"><a href="#val-parse" class="anchor"></a><code><span class="keyword">val </span>parse : string <span>&#8209;&gt;</span> int list list <a href="index.html#type-or_error">or_error</a></code></dt><dd><p>Parse a file into a list of clauses.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_dimacs__/.jbuilder-keep b/sidekick/Sidekick_dimacs__/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_dimacs__/Lexer/index.html b/sidekick/Sidekick_dimacs__/Lexer/index.html
new file mode 100644
index 00000000..dd796d23
--- /dev/null
+++ b/sidekick/Sidekick_dimacs__/Lexer/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lexer (sidekick.Sidekick_dimacs__.Lexer)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_dimacs__.Lexer</code></h1></header><dl><dt id="val-__ocaml_lex_tables"><a href="#val-__ocaml_lex_tables" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_tables : Lexing.lex_tables</code></dt><dt id="val-token"><a href="#val-token" class="anchor"></a><code><span class="keyword">val </span>token : Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Parser/index.html#type-token">Sidekick_dimacs__.Parser.token</a></code></dt><dt id="val-__ocaml_lex_token_rec"><a href="#val-__ocaml_lex_token_rec" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_token_rec : Lexing.lexbuf <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Parser/index.html#type-token">Sidekick_dimacs__.Parser.token</a></code></dt><dt id="val-comment"><a href="#val-comment" class="anchor"></a><code><span class="keyword">val </span>comment : Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Parser/index.html#type-token">Sidekick_dimacs__.Parser.token</a></code></dt><dt id="val-__ocaml_lex_comment_rec"><a href="#val-__ocaml_lex_comment_rec" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_comment_rec : Lexing.lexbuf <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Parser/index.html#type-token">Sidekick_dimacs__.Parser.token</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_dimacs__/Parser/index.html b/sidekick/Sidekick_dimacs__/Parser/index.html
new file mode 100644
index 00000000..2ae66b33
--- /dev/null
+++ b/sidekick/Sidekick_dimacs__/Parser/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Parser (sidekick.Sidekick_dimacs__.Parser)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_dimacs__.Parser</code></h1></header><dl><dt id="type-token"><a href="#type-token" class="anchor"></a><code><span class="keyword">type </span>token</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-token.ZERO" class="anchored"><td class="def constructor"><a href="#type-token.ZERO" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ZERO</span></code></td></tr><tr id="type-token.P" class="anchored"><td class="def constructor"><a href="#type-token.P" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">P</span></code></td></tr><tr id="type-token.LIT" class="anchored"><td class="def constructor"><a href="#type-token.LIT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LIT</span><span class="keyword"> of </span>int</code></td></tr><tr id="type-token.EOF" class="anchored"><td class="def constructor"><a href="#type-token.EOF" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EOF</span></code></td></tr><tr id="type-token.CNF" class="anchored"><td class="def constructor"><a href="#type-token.CNF" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">CNF</span></code></td></tr></table><code></code></dt></dl><dl><dt id="exception-Error"><a href="#exception-Error" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Error</span></code></dt></dl><dl><dt id="val-file"><a href="#val-file" class="anchor"></a><code><span class="keyword">val </span>file : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> int list list</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_dimacs__/index.html b/sidekick/Sidekick_dimacs__/index.html
new file mode 100644
index 00000000..92dacd69
--- /dev/null
+++ b/sidekick/Sidekick_dimacs__/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_dimacs__ (sidekick.Sidekick_dimacs__)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_dimacs__</code></h1></header><article id="module-Lexer"><a href="#module-Lexer" class="anchor"></a><code><span class="keyword">module </span><a href="Lexer/index.html">Lexer</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Parser"><a href="#module-Parser" class="anchor"></a><code><span class="keyword">module </span><a href="Parser/index.html">Parser</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Sidekick_dimacs"><a href="#module-Sidekick_dimacs" class="anchor"></a><code><span class="keyword">module </span>Sidekick_dimacs = <a href="../Sidekick_dimacs/index.html">Sidekick_dimacs</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_dimacs__Lexer/.jbuilder-keep b/sidekick/Sidekick_dimacs__Lexer/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_dimacs__Lexer/index.html b/sidekick/Sidekick_dimacs__Lexer/index.html
new file mode 100644
index 00000000..7fdc67d5
--- /dev/null
+++ b/sidekick/Sidekick_dimacs__Lexer/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_dimacs__Lexer (sidekick.Sidekick_dimacs__Lexer)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_dimacs__Lexer</code></h1></header><dl><dt id="val-__ocaml_lex_tables"><a href="#val-__ocaml_lex_tables" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_tables : Lexing.lex_tables</code></dt><dt id="val-token"><a href="#val-token" class="anchor"></a><code><span class="keyword">val </span>token : Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Sidekick_dimacs__/Parser/index.html#type-token">Sidekick_dimacs__.Parser.token</a></code></dt><dt id="val-__ocaml_lex_token_rec"><a href="#val-__ocaml_lex_token_rec" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_token_rec : Lexing.lexbuf <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Sidekick_dimacs__/Parser/index.html#type-token">Sidekick_dimacs__.Parser.token</a></code></dt><dt id="val-comment"><a href="#val-comment" class="anchor"></a><code><span class="keyword">val </span>comment : Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Sidekick_dimacs__/Parser/index.html#type-token">Sidekick_dimacs__.Parser.token</a></code></dt><dt id="val-__ocaml_lex_comment_rec"><a href="#val-__ocaml_lex_comment_rec" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_comment_rec : Lexing.lexbuf <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Sidekick_dimacs__/Parser/index.html#type-token">Sidekick_dimacs__.Parser.token</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_dimacs__Parser/.jbuilder-keep b/sidekick/Sidekick_dimacs__Parser/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_dimacs__Parser/index.html b/sidekick/Sidekick_dimacs__Parser/index.html
new file mode 100644
index 00000000..ba9df966
--- /dev/null
+++ b/sidekick/Sidekick_dimacs__Parser/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_dimacs__Parser (sidekick.Sidekick_dimacs__Parser)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_dimacs__Parser</code></h1></header><dl><dt id="type-token"><a href="#type-token" class="anchor"></a><code><span class="keyword">type </span>token</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-token.ZERO" class="anchored"><td class="def constructor"><a href="#type-token.ZERO" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ZERO</span></code></td></tr><tr id="type-token.P" class="anchored"><td class="def constructor"><a href="#type-token.P" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">P</span></code></td></tr><tr id="type-token.LIT" class="anchored"><td class="def constructor"><a href="#type-token.LIT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LIT</span><span class="keyword"> of </span>int</code></td></tr><tr id="type-token.EOF" class="anchored"><td class="def constructor"><a href="#type-token.EOF" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EOF</span></code></td></tr><tr id="type-token.CNF" class="anchored"><td class="def constructor"><a href="#type-token.CNF" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">CNF</span></code></td></tr></table><code></code></dt></dl><dl><dt id="exception-Error"><a href="#exception-Error" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Error</span></code></dt></dl><dl><dt id="val-file"><a href="#val-file" class="anchor"></a><code><span class="keyword">val </span>file : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> int list list</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/.jbuilder-keep b/sidekick/Sidekick_sat/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat/Make/Clause/index.html b/sidekick/Sidekick_sat/Make/Clause/index.html
new file mode 100644
index 00000000..08a6ba48
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.Make.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> array <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_atoms"><a href="#val-of_atoms" class="anchor"></a><code><span class="keyword">val </span>of_atoms : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/Formula/index.html b/sidekick/Sidekick_sat/Make/Formula/index.html
new file mode 100644
index 00000000..69de011e
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat.Make.Formula)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/Lit/index.html b/sidekick/Sidekick_sat/Make/Lit/index.html
new file mode 100644
index 00000000..a62cf62e
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_sat.Make.Lit)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-lit">lit</a></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/Proof/Atom/index.html b/sidekick/Sidekick_sat/Make/Proof/Atom/index.html
new file mode 100644
index 00000000..039378f2
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat.Make.Proof.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/Proof/Clause/Tbl/index.html b/sidekick/Sidekick_sat/Make/Proof/Clause/Tbl/index.html
new file mode 100644
index 00000000..8cebe689
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/Proof/Clause/Tbl/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tbl (sidekick.Sidekick_sat.Make.Proof.Clause.Tbl)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make.Proof.Clause.Tbl</code></h1></header><dl><dt id="type-key"><a href="#type-key" class="anchor"></a><code><span class="keyword">type </span>key</code><code><span class="keyword"> = </span><a href="../index.html#type-t">t</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../../../../../Sidekick_sat__Solver/Make/Proof/Clause/index.html#module-Tbl">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).Proof.Clause.Tbl</a>.t</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-reset"><a href="#val-reset" class="anchor"></a><code><span class="keyword">val </span>reset : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_all"><a href="#val-find_all" class="anchor"></a><code><span class="keyword">val </span>find_all : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-replace"><a href="#val-replace" class="anchor"></a><code><span class="keyword">val </span>replace : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter_map_inplace"><a href="#val-filter_map_inplace" class="anchor"></a><code><span class="keyword">val </span>filter_map_inplace : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-stats"><a href="#val-stats" class="anchor"></a><code><span class="keyword">val </span>stats : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> Hashtbl.statistics</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/Proof/Clause/index.html b/sidekick/Sidekick_sat/Make/Proof/Clause/index.html
new file mode 100644
index 00000000..00dffbb6
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.Make.Proof.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span><a href="Tbl/index.html">Tbl</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/Proof/Tbl/index.html b/sidekick/Sidekick_sat/Make/Proof/Tbl/index.html
new file mode 100644
index 00000000..dbfaab99
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/Proof/Tbl/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tbl (sidekick.Sidekick_sat.Make.Proof.Tbl)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make.Proof.Tbl</code></h1></header><dl><dt id="type-key"><a href="#type-key" class="anchor"></a><code><span class="keyword">type </span>key</code><code><span class="keyword"> = </span><a href="../index.html#type-proof">proof</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../../../../Sidekick_sat__Solver/Make/Proof/index.html#module-Tbl">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).Proof.Tbl</a>.t</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-reset"><a href="#val-reset" class="anchor"></a><code><span class="keyword">val </span>reset : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_all"><a href="#val-find_all" class="anchor"></a><code><span class="keyword">val </span>find_all : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-replace"><a href="#val-replace" class="anchor"></a><code><span class="keyword">val </span>replace : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter_map_inplace"><a href="#val-filter_map_inplace" class="anchor"></a><code><span class="keyword">val </span>filter_map_inplace : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-stats"><a href="#val-stats" class="anchor"></a><code><span class="keyword">val </span>stats : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> Hashtbl.statistics</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/Proof/index.html b/sidekick/Sidekick_sat/Make/Proof/index.html
new file mode 100644
index 00000000..28d65c12
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat.Make.Proof)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make.Proof</code></h1></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../../../Sidekick_sat__Solver/Make/Proof/index.html#type-formula">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).Proof.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="../../../Sidekick_sat__Solver/Make/Proof/index.html#type-atom">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).Proof.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="../../../Sidekick_sat__Solver_types/Make/index.html#type-proof">Sidekick_sat__.Solver_types.Make(E).proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="../../../Sidekick_sat__Solver/Make/Proof/index.html#type-proof">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).Proof.proof</a></code><code></code></dt><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code><span class="keyword"> = </span><a href="../../../Sidekick_sat__Solver/Make/Proof/index.html#type-proof_node">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).Proof.proof_node</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code><span class="keyword"> = </span><a href="../../../Sidekick_sat__Solver/Make/Proof/index.html#type-step">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).Proof.step</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td></tr></table><code></code></dt></dl><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span><a href="Tbl/index.html">Tbl</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/argument-1-E/Form/index.html b/sidekick/Sidekick_sat/Make/argument-1-E/Form/index.html
new file mode 100644
index 00000000..a8e999b6
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/argument-1-E/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat.Make.1-E.Form)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make.1-E.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../Theory_intf/index.html#type-negated">Theory_intf.negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/argument-1-E/index.html b/sidekick/Sidekick_sat/Make/argument-1-E/index.html
new file mode 100644
index 00000000..61d4b9ca
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/argument-1-E/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-E (sidekick.Sidekick_sat.Make.1-E)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat.Make.1-E</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../Theory_intf/index.html#type-actions">Theory_intf.actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../Theory_intf/index.html#type-slice_actions">Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../Theory_intf/index.html#type-res">Theory_intf.res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../Theory_intf/index.html#type-slice_actions">Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../Theory_intf/index.html#type-res">Theory_intf.res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Make/index.html b/sidekick/Sidekick_sat/Make/index.html
new file mode 100644
index 00000000..e889f4c2
--- /dev/null
+++ b/sidekick/Sidekick_sat/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Make</code></h1></header><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-E/index.html">E</a> : <a href="../Theory_intf/index.html#module-type-S">Theory_intf.S</a></code></dl><h3 class="heading">Signature</h3><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../../Sidekick_sat__Solver_types/Make/index.html#type-formula">Sidekick_sat__.Solver_types.Make(E).formula</a></code><code></code></dt><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code><span class="keyword"> = </span><a href="../../Sidekick_sat__Solver/Make/index.html#type-lit">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).lit</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../../Sidekick_sat__Solver_types/Make/index.html#type-clause">Sidekick_sat__.Solver_types.Make(E).clause</a></code><code></code></dt><dt id="type-theory"><a href="#type-theory" class="anchor"></a><code><span class="keyword">type </span>theory</code><code><span class="keyword"> = </span><a href="argument-1-E/index.html#type-t">E.t</a></code><code></code></dt></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../../Sidekick_sat__Solver/Make/index.html#type-t">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).t</a></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Big | `Small | `Tiny ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="index.html#type-formula">formula</a></code><code></code></dt><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code><span class="keyword"> = </span><a href="../../Sidekick_sat__Solver/Make/index.html#type-res">Sidekick_sat__Solver.Make(Sidekick_sat__.Solver_types.Make(E))(E).res</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="index.html#type-formula">formula</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-sat_state">Sidekick_sat__.Solver_intf.sat_state</a></code></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span>(<a href="index.html#type-clause">clause</a>, <a href="Proof/index.html#type-proof">Proof.proof</a>) <a href="../../Sidekick_sat__/Solver_intf/index.html#type-unsat_state">Sidekick_sat__.Solver_intf.unsat_state</a></code></td></tr></table><code></code></dt></dl><dl><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt></dl><dl><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-theory">theory</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : ?&#8288;permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list <span>&#8209;&gt;</span> unit</code></dt><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;assumptions:<a href="index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="Proof/index.html#type-proof">Proof.proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dt id="val-true_at_level0"><a href="#val-true_at_level0" class="anchor"></a><code><span class="keyword">val </span>true_at_level0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-get_tag"><a href="#val-get_tag" class="anchor"></a><code><span class="keyword">val </span>get_tag : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="Proof/index.html#type-lemma">Proof.lemma</a>) <a href="../Theory_intf/index.html#type-actions">Theory_intf.actions</a></code></dt><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-export">Sidekick_sat__.Solver_intf.export</a></code></dt></dl><dl><dt id="type-solver"><a href="#type-solver" class="anchor"></a><code><span class="keyword">type </span>solver</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/Make/Atom/index.html b/sidekick/Sidekick_sat/Res/Make/Atom/index.html
new file mode 100644
index 00000000..d7799395
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/Make/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat.Res.Make.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.Make.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/Make/Clause/index.html b/sidekick/Sidekick_sat/Res/Make/Clause/index.html
new file mode 100644
index 00000000..cba209f4
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/Make/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.Res.Make.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.Make.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/Make/argument-1-St/Atom/index.html b/sidekick/Sidekick_sat/Res/Make/argument-1-St/Atom/index.html
new file mode 100644
index 00000000..f4523af1
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/Make/argument-1-St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat.Res.Make.1-St.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.Make.1-St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/Make/argument-1-St/Clause/index.html b/sidekick/Sidekick_sat/Res/Make/argument-1-St/Clause/index.html
new file mode 100644
index 00000000..b2d4f622
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/Make/argument-1-St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.Res.Make.1-St.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.Make.1-St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/Make/argument-1-St/Formula/index.html b/sidekick/Sidekick_sat/Res/Make/argument-1-St/Formula/index.html
new file mode 100644
index 00000000..18c34e1d
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/Make/argument-1-St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat.Res.Make.1-St.Formula)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.Make.1-St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/Make/argument-1-St/Var/index.html b/sidekick/Sidekick_sat/Res/Make/argument-1-St/Var/index.html
new file mode 100644
index 00000000..e2fa487d
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/Make/argument-1-St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat.Res.Make.1-St.Var)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.Make.1-St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Theory_intf/index.html#type-negated">Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/Make/argument-1-St/index.html b/sidekick/Sidekick_sat/Res/Make/argument-1-St/index.html
new file mode 100644
index 00000000..0fc1c354
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/Make/argument-1-St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-St (sidekick.Sidekick_sat.Res.Make.1-St)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat.Res.Make.1-St</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Solver_types_intf/Var_fields/index.html#type-t">Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Solver_types_intf/C_fields/index.html#type-t">Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/Make/index.html b/sidekick/Sidekick_sat/Res/Make/index.html
new file mode 100644
index 00000000..5259a3f2
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat.Res.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.Make</code></h1></header><div class="doc"><p>Functor to create a module building proofs from a sat-solver unsat trace.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-St/index.html">St</a> : <a href="../../../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></dl><h3 class="heading">Signature</h3><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span>St = <a href="index.html#argument-1-St">St</a></code></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../../Sidekick_sat__/Res_intf/index.html#module-type-S">Sidekick_sat__.Res_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-atom">atom</a><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code></span></summary><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></details></div></div></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/index.html b/sidekick/Sidekick_sat/Res/index.html
new file mode 100644
index 00000000..1147af63
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Res (sidekick.Sidekick_sat.Res)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res</code></h1></header><div class="doc"><p>Resolution proofs</p><p>This modules defines functions to create and manipulate resolution proofs.</p></div><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../../Sidekick_sat__/Res_intf/index.html#module-type-S">Sidekick_sat__.Res_intf.S</a></code></article><article id="module-type-FULL"><a href="#module-type-FULL" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-FULL/index.html">FULL</a> = <a href="../../Sidekick_sat__/Res_intf/index.html#module-type-FULL">Sidekick_sat__.Res_intf.FULL</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-St/index.html">St</a> : <a href="../../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a>) -&gt; <a href="index.html#module-type-FULL">FULL</a><span class="keyword"> with </span><span class="keyword">module </span><a href="Make/St/index.html">St</a> = <a href="Make/index.html#argument-1-St">St</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-FULL/Atom/index.html b/sidekick/Sidekick_sat/Res/module-type-FULL/Atom/index.html
new file mode 100644
index 00000000..049138a4
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-FULL/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat.Res.FULL.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.FULL.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-FULL/Clause/index.html b/sidekick/Sidekick_sat/Res/module-type-FULL/Clause/index.html
new file mode 100644
index 00000000..2e2c9f30
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-FULL/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.Res.FULL.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.FULL.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-FULL/St/Atom/index.html b/sidekick/Sidekick_sat/Res/module-type-FULL/St/Atom/index.html
new file mode 100644
index 00000000..3dafd1e2
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-FULL/St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat.Res.FULL.St.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.FULL.St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-FULL/St/Clause/index.html b/sidekick/Sidekick_sat/Res/module-type-FULL/St/Clause/index.html
new file mode 100644
index 00000000..c53c96e9
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-FULL/St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.Res.FULL.St.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.FULL.St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-FULL/St/Formula/index.html b/sidekick/Sidekick_sat/Res/module-type-FULL/St/Formula/index.html
new file mode 100644
index 00000000..342cd93b
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-FULL/St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat.Res.FULL.St.Formula)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.FULL.St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Solver_types_intf/index.html#type-printer">Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-FULL/St/Var/index.html b/sidekick/Sidekick_sat/Res/module-type-FULL/St/Var/index.html
new file mode 100644
index 00000000..f012834f
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-FULL/St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat.Res.FULL.St.Var)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.FULL.St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Theory_intf/index.html#type-negated">Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-FULL/St/index.html b/sidekick/Sidekick_sat/Res/module-type-FULL/St/index.html
new file mode 100644
index 00000000..e5eb803e
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-FULL/St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>St (sidekick.Sidekick_sat.Res.FULL.St)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.FULL.St</code></h1></header><div class="doc"><p>Module defining atom and clauses</p></div><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Solver_types_intf/Var_fields/index.html#type-t">Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Solver_types_intf/C_fields/index.html#type-t">Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-FULL/index.html b/sidekick/Sidekick_sat/Res/module-type-FULL/index.html
new file mode 100644
index 00000000..893201df
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-FULL/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>FULL (sidekick.Sidekick_sat.Res.FULL)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat.Res.FULL</code></h1></header><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span><a href="St/index.html">St</a> : <a href="../../../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../../Sidekick_sat__/Res_intf/index.html#module-type-S">Sidekick_sat__.Res_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-atom">atom</a><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code></span></summary><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></details></div></div></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-S/Atom/index.html b/sidekick/Sidekick_sat/Res/module-type-S/Atom/index.html
new file mode 100644
index 00000000..3984b4c4
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat.Res.S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-S/Clause/index.html b/sidekick/Sidekick_sat/Res/module-type-S/Clause/index.html
new file mode 100644
index 00000000..60d42058
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.Res.S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Res.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Res/module-type-S/index.html b/sidekick/Sidekick_sat/Res/module-type-S/index.html
new file mode 100644
index 00000000..7d15c981
--- /dev/null
+++ b/sidekick/Sidekick_sat/Res/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat.Res.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat.Res.S</code></h1></header><div class="doc"><p>Interface for a module manipulating resolution proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Solver_types_intf/C_fields/index.html b/sidekick/Sidekick_sat/Solver_types_intf/C_fields/index.html
new file mode 100644
index 00000000..757c216a
--- /dev/null
+++ b/sidekick/Sidekick_sat/Solver_types_intf/C_fields/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>C_fields (sidekick.Sidekick_sat.Solver_types_intf.C_fields)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Solver_types_intf.C_fields</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><span class="keyword">private </span>int</code><code></code></dt><dd><p>Generative type of bitfields. Each instantiation of the functor should create a new, incompatible type</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>Empty bitfields (all bits 0)</p></dd></dl><dl><dt id="type-field"><a href="#type-field" class="anchor"></a><code><span class="keyword">type </span>field</code><code></code><code></code></dt></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Get the value of this field</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Set the value of this field</p></dd></dl><dl><dt id="val-mk_field"><a href="#val-mk_field" class="anchor"></a><code><span class="keyword">val </span>mk_field : unit <span>&#8209;&gt;</span> <a href="index.html#type-field">field</a></code></dt><dd><p>Make a new field</p></dd></dl><dl><dt id="val-freeze"><a href="#val-freeze" class="anchor"></a><code><span class="keyword">val </span>freeze : unit <span>&#8209;&gt;</span> unit</code></dt><dd><p>Prevent new fields from being added. From now on, creating a field will raise Frozen</p></dd></dl><dl><dt id="val-total_width"><a href="#val-total_width" class="anchor"></a><code><span class="keyword">val </span>total_width : unit <span>&#8209;&gt;</span> int</code></dt><dd><p>Current width of the bitfield</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Solver_types_intf/Var_fields/index.html b/sidekick/Sidekick_sat/Solver_types_intf/Var_fields/index.html
new file mode 100644
index 00000000..4fae0eb9
--- /dev/null
+++ b/sidekick/Sidekick_sat/Solver_types_intf/Var_fields/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var_fields (sidekick.Sidekick_sat.Solver_types_intf.Var_fields)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Solver_types_intf.Var_fields</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><span class="keyword">private </span>int</code><code></code></dt><dd><p>Generative type of bitfields. Each instantiation of the functor should create a new, incompatible type</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>Empty bitfields (all bits 0)</p></dd></dl><dl><dt id="type-field"><a href="#type-field" class="anchor"></a><code><span class="keyword">type </span>field</code><code></code><code></code></dt></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Get the value of this field</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Set the value of this field</p></dd></dl><dl><dt id="val-mk_field"><a href="#val-mk_field" class="anchor"></a><code><span class="keyword">val </span>mk_field : unit <span>&#8209;&gt;</span> <a href="index.html#type-field">field</a></code></dt><dd><p>Make a new field</p></dd></dl><dl><dt id="val-freeze"><a href="#val-freeze" class="anchor"></a><code><span class="keyword">val </span>freeze : unit <span>&#8209;&gt;</span> unit</code></dt><dd><p>Prevent new fields from being added. From now on, creating a field will raise Frozen</p></dd></dl><dl><dt id="val-total_width"><a href="#val-total_width" class="anchor"></a><code><span class="keyword">val </span>total_width : unit <span>&#8209;&gt;</span> int</code></dt><dd><p>Current width of the bitfield</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Solver_types_intf/index.html b/sidekick/Sidekick_sat/Solver_types_intf/index.html
new file mode 100644
index 00000000..8470d3d3
--- /dev/null
+++ b/sidekick/Sidekick_sat/Solver_types_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Solver_types_intf (sidekick.Sidekick_sat.Solver_types_intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Solver_types_intf</code></h1></header><div class="doc"><p>Internal types (interface)</p><p>This modules defines the interface of most of the internal types used in the core solver.</p></div><article id="module-Var_fields"><a href="#module-Var_fields" class="anchor"></a><code><span class="keyword">module </span><a href="Var_fields/index.html">Var_fields</a> : <a href="../../Sidekick_util__BitField/index.html#module-type-S">Sidekick_util__BitField.S</a></code></article><article id="module-C_fields"><a href="#module-C_fields" class="anchor"></a><code><span class="keyword">module </span><a href="C_fields/index.html">C_fields</a> : <a href="../../Sidekick_util__BitField/index.html#module-type-S">Sidekick_util__BitField.S</a></code></article><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Atom/index.html b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Atom/index.html
new file mode 100644
index 00000000..9bf4c2c1
--- /dev/null
+++ b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat.Solver_types_intf.S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Solver_types_intf.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Clause/index.html b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Clause/index.html
new file mode 100644
index 00000000..0bf39b34
--- /dev/null
+++ b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.Solver_types_intf.S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Solver_types_intf.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Formula/index.html b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Formula/index.html
new file mode 100644
index 00000000..f9edb5e6
--- /dev/null
+++ b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat.Solver_types_intf.S.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Solver_types_intf.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Var/index.html b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Var/index.html
new file mode 100644
index 00000000..e8d08c08
--- /dev/null
+++ b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat.Solver_types_intf.S.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Solver_types_intf.S.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../Theory_intf/index.html#type-negated">Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/index.html b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/index.html
new file mode 100644
index 00000000..6d5bf51a
--- /dev/null
+++ b/sidekick/Sidekick_sat/Solver_types_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat.Solver_types_intf.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat.Solver_types_intf.S</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../Var_fields/index.html#type-t">Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../C_fields/index.html#type-t">C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Theory_intf/index.html b/sidekick/Sidekick_sat/Theory_intf/index.html
new file mode 100644
index 00000000..99a6fec7
--- /dev/null
+++ b/sidekick/Sidekick_sat/Theory_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Theory_intf (sidekick.Sidekick_sat.Theory_intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Theory_intf</code></h1></header><div class="doc"><p>SMT Theory</p><p>This module defines what a theory must implement in order to be used in an SMT solver.</p></div><dl><dt id="type-negated"><a href="#type-negated" class="anchor"></a><code><span class="keyword">type </span>negated</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-negated.Negated" class="anchored"><td class="def constructor"><a href="#type-negated.Negated" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Negated</span></code></td><td class="doc"><p>changed sign</p></td></tr><tr id="type-negated.Same_sign" class="anchored"><td class="def constructor"><a href="#type-negated.Same_sign" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Same_sign</span></code></td><td class="doc"><p>kept sign</p></td></tr></table><code></code></dt><dd><p>This type is used during the normalisation of formulas. See <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.norm&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.norm</span> for more details.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>('formula, 'proof) res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span></code></td><td class="doc"><p>The current set of assumptions is satisfiable.</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span><span class="type-var">'formula</span> list<span class="keyword"> * </span><span class="type-var">'proof</span></code></td><td class="doc"><p>The current set of assumptions is *NOT* satisfiable, and here is a theory tautology (with its proof), for which every litteral is false under the current assumptions.</p></td></tr></table><code></code></dt><dd><p>Type returned by the theory. Formulas in the unsat clause must come from the current set of assumptions, i.e must have been encountered in a slice.</p></dd></dl><dl><dt id="type-actions"><a href="#type-actions" class="anchor"></a><code><span class="keyword">type </span>('form, 'proof) actions</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-actions.Actions" class="anchored"><td class="def constructor"><a href="#type-actions.Actions" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Actions</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-actions.push_persistent" class="anchored"><td class="def field"><a href="#type-actions.push_persistent" class="anchor"></a><code>push_persistent : <span class="type-var">'form</span> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Allows to add a persistent clause to the solver.</p></td></tr><tr id="type-actions.push_local" class="anchored"><td class="def field"><a href="#type-actions.push_local" class="anchor"></a><code>push_local : <span class="type-var">'form</span> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Allows to add a local clause to the solver. The clause will be removed after backtracking.</p></td></tr><tr id="type-actions.on_backtrack" class="anchored"><td class="def field"><a href="#type-actions.on_backtrack" class="anchor"></a><code>on_backtrack : (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p><code>on_backtrack f</code> calls <code>f</code> when the main solver backtracks</p></td></tr><tr id="type-actions.propagate" class="anchored"><td class="def field"><a href="#type-actions.propagate" class="anchor"></a><code>propagate : <span class="type-var">'form</span> <span>&#8209;&gt;</span> <span class="type-var">'form</span> list <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p><code>propagate lit causes proof</code> informs the solver to propagate <code>lit</code>, with the reason that the clause <code>causes =&gt; lit</code> is a theory tautology. It is faster than pushing the associated clause but the clause will not be remembered by the sat solver, i.e it will not be used by the solver to do boolean propagation.</p></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dd><p>Actions given to the theory during initialization, to be used at any time</p></dd></dl><dl><dt id="type-slice_actions"><a href="#type-slice_actions" class="anchor"></a><code><span class="keyword">type </span>('form, 'proof) slice_actions</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-slice_actions.Slice_acts" class="anchored"><td class="def constructor"><a href="#type-slice_actions.Slice_acts" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Slice_acts</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-slice_actions.slice_iter" class="anchored"><td class="def field"><a href="#type-slice_actions.slice_iter" class="anchor"></a><code>slice_iter : (<span class="type-var">'form</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>iterate on the slice of the trail</p></td></tr></table><code>}</code><code></code></td><td class="doc"><p>The type for a slice. Slices are some kind of view of the current propagation queue. They allow to look at the propagated literals, and to add new clauses to the solver.</p></td></tr></table><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Theory_intf/module-type-S/Form/index.html b/sidekick/Sidekick_sat/Theory_intf/module-type-S/Form/index.html
new file mode 100644
index 00000000..3a0e4810
--- /dev/null
+++ b/sidekick/Sidekick_sat/Theory_intf/module-type-S/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat.Theory_intf.S.Form)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.Theory_intf.S.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../index.html#type-negated">negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/Theory_intf/module-type-S/index.html b/sidekick/Sidekick_sat/Theory_intf/module-type-S/index.html
new file mode 100644
index 00000000..9db7cf3b
--- /dev/null
+++ b/sidekick/Sidekick_sat/Theory_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat.Theory_intf.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat.Theory_intf.S</code></h1></header><div class="doc"><h2 id="signature-for-theories-to-be-given-to-the-solver."><a href="#signature-for-theories-to-be-given-to-the-solver." class="anchor"></a>Signature for theories to be given to the Solver.</h2></div><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-actions">actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-slice_actions">slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-res">res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-slice_actions">slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-res">res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/index.html b/sidekick/Sidekick_sat/index.html
new file mode 100644
index 00000000..39c99dd6
--- /dev/null
+++ b/sidekick/Sidekick_sat/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat (sidekick.Sidekick_sat)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat</code></h1><p>Main API</p></header><article id="module-Theory_intf"><a href="#module-Theory_intf" class="anchor"></a><code><span class="keyword">module </span><a href="Theory_intf/index.html">Theory_intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Solver_types_intf"><a href="#module-Solver_types_intf" class="anchor"></a><code><span class="keyword">module </span><a href="Solver_types_intf/index.html">Solver_types_intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Res"><a href="#module-Res" class="anchor"></a><code><span class="keyword">module </span><a href="Res/index.html">Res</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Sidekick_sat__/Solver_intf/index.html#module-type-S">Sidekick_sat__.Solver_intf.S</a></code></article><dl><dt id="type-negated"><a href="#type-negated" class="anchor"></a><code><span class="keyword">type </span>negated</code><code><span class="keyword"> = </span><a href="Theory_intf/index.html#type-negated">Theory_intf.negated</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-negated.Negated" class="anchored"><td class="def constructor"><a href="#type-negated.Negated" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Negated</span></code></td></tr><tr id="type-negated.Same_sign" class="anchored"><td class="def constructor"><a href="#type-negated.Same_sign" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Same_sign</span></code></td></tr></table><code></code></dt><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>('formula, 'proof) res</code><code><span class="keyword"> = </span>(<span class="type-var">'formula</span>, <span class="type-var">'proof</span>) <a href="Theory_intf/index.html#type-res">Theory_intf.res</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span></code></td><td class="doc"><p>The current set of assumptions is satisfiable.</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span><span class="type-var">'formula</span> list<span class="keyword"> * </span><span class="type-var">'proof</span></code></td><td class="doc"><p>The current set of assumptions is *NOT* satisfiable, and here is a theory tautology (with its proof), for which every litteral is false under the current assumptions.</p></td></tr></table><code></code></dt><dd><p>Type returned by the theory. Formulas in the unsat clause must come from the current set of assumptions, i.e must have been encountered in a slice.</p></dd></dl><dl><dt id="type-sat_state"><a href="#type-sat_state" class="anchor"></a><code><span class="keyword">type </span>'form sat_state</code><code><span class="keyword"> = </span><span class="type-var">'form</span> <a href="../Sidekick_sat__/Solver_intf/index.html#type-sat_state">Sidekick_sat__.Solver_intf.sat_state</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-sat_state.Sat_state" class="anchored"><td class="def constructor"><a href="#type-sat_state.Sat_state" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat_state</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-sat_state.eval" class="anchored"><td class="def field"><a href="#type-sat_state.eval" class="anchor"></a><code>eval : <span class="type-var">'form</span> <span>&#8209;&gt;</span> bool;</code></td></tr><tr id="type-sat_state.eval_level" class="anchored"><td class="def field"><a href="#type-sat_state.eval_level" class="anchor"></a><code>eval_level : <span class="type-var">'form</span> <span>&#8209;&gt;</span> bool<span class="keyword"> * </span>int;</code></td></tr><tr id="type-sat_state.iter_trail" class="anchored"><td class="def field"><a href="#type-sat_state.iter_trail" class="anchor"></a><code>iter_trail : (<span class="type-var">'form</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-unsat_state"><a href="#type-unsat_state" class="anchor"></a><code><span class="keyword">type </span>('clause, 'proof) unsat_state</code><code><span class="keyword"> = </span>(<span class="type-var">'clause</span>, <span class="type-var">'proof</span>) <a href="../Sidekick_sat__/Solver_intf/index.html#type-unsat_state">Sidekick_sat__.Solver_intf.unsat_state</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-unsat_state.Unsat_state" class="anchored"><td class="def constructor"><a href="#type-unsat_state.Unsat_state" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat_state</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-unsat_state.unsat_conflict" class="anchored"><td class="def field"><a href="#type-unsat_state.unsat_conflict" class="anchor"></a><code>unsat_conflict : unit <span>&#8209;&gt;</span> <span class="type-var">'clause</span>;</code></td></tr><tr id="type-unsat_state.get_proof" class="anchored"><td class="def field"><a href="#type-unsat_state.get_proof" class="anchor"></a><code>get_proof : unit <span>&#8209;&gt;</span> <span class="type-var">'proof</span>;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-export"><a href="#type-export" class="anchor"></a><code><span class="keyword">type </span>'clause export</code><code><span class="keyword"> = </span><span class="type-var">'clause</span> <a href="../Sidekick_sat__/Solver_intf/index.html#type-export">Sidekick_sat__.Solver_intf.export</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-export.hyps" class="anchored"><td class="def field"><a href="#type-export.hyps" class="anchor"></a><code>hyps : <span class="type-var">'clause</span> <a href="../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-export.history" class="anchored"><td class="def field"><a href="#type-export.history" class="anchor"></a><code>history : <span class="type-var">'clause</span> <a href="../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-export.local" class="anchored"><td class="def field"><a href="#type-export.local" class="anchor"></a><code>local : <span class="type-var">'clause</span> <a href="../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-actions"><a href="#type-actions" class="anchor"></a><code><span class="keyword">type </span>('form, 'proof) actions</code><code><span class="keyword"> = </span>(<span class="type-var">'form</span>, <span class="type-var">'proof</span>) <a href="Theory_intf/index.html#type-actions">Theory_intf.actions</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-actions.Actions" class="anchored"><td class="def constructor"><a href="#type-actions.Actions" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Actions</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-actions.push_persistent" class="anchored"><td class="def field"><a href="#type-actions.push_persistent" class="anchor"></a><code>push_persistent : <span class="type-var">'form</span> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td></tr><tr id="type-actions.push_local" class="anchored"><td class="def field"><a href="#type-actions.push_local" class="anchor"></a><code>push_local : <span class="type-var">'form</span> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td></tr><tr id="type-actions.on_backtrack" class="anchored"><td class="def field"><a href="#type-actions.on_backtrack" class="anchor"></a><code>on_backtrack : (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td></tr><tr id="type-actions.propagate" class="anchored"><td class="def field"><a href="#type-actions.propagate" class="anchor"></a><code>propagate : <span class="type-var">'form</span> <span>&#8209;&gt;</span> <span class="type-var">'form</span> list <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-slice_actions"><a href="#type-slice_actions" class="anchor"></a><code><span class="keyword">type </span>('form, 'proof) slice_actions</code><code><span class="keyword"> = </span>(<span class="type-var">'form</span>, <span class="type-var">'proof</span>) <a href="Theory_intf/index.html#type-slice_actions">Theory_intf.slice_actions</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-slice_actions.Slice_acts" class="anchored"><td class="def constructor"><a href="#type-slice_actions.Slice_acts" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Slice_acts</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-slice_actions.slice_iter" class="anchored"><td class="def field"><a href="#type-slice_actions.slice_iter" class="anchor"></a><code>slice_iter : (<span class="type-var">'form</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt></dl><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-E/index.html">E</a> : <a href="Theory_intf/index.html#module-type-S">Theory_intf.S</a>) -&gt; <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/module-type-S/Clause/index.html b/sidekick/Sidekick_sat/module-type-S/Clause/index.html
new file mode 100644
index 00000000..8f74f45a
--- /dev/null
+++ b/sidekick/Sidekick_sat/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.S.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> array <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Make a clause from this array of SAT literals. The array's ownership is transferred to the clause, do not mutate it</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_atoms"><a href="#val-of_atoms" class="anchor"></a><code><span class="keyword">val </span>of_atoms : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/module-type-S/Formula/index.html b/sidekick/Sidekick_sat/module-type-S/Formula/index.html
new file mode 100644
index 00000000..ef1a2e92
--- /dev/null
+++ b/sidekick/Sidekick_sat/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat.S.Formula)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/module-type-S/Lit/index.html b/sidekick/Sidekick_sat/module-type-S/Lit/index.html
new file mode 100644
index 00000000..a50b62e8
--- /dev/null
+++ b/sidekick/Sidekick_sat/module-type-S/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_sat.S.Lit)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.S.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-lit">lit</a></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/module-type-S/Proof/Atom/index.html b/sidekick/Sidekick_sat/module-type-S/Proof/Atom/index.html
new file mode 100644
index 00000000..d779a881
--- /dev/null
+++ b/sidekick/Sidekick_sat/module-type-S/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat.S.Proof.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.S.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/module-type-S/Proof/Clause/index.html b/sidekick/Sidekick_sat/module-type-S/Proof/Clause/index.html
new file mode 100644
index 00000000..b65cd27f
--- /dev/null
+++ b/sidekick/Sidekick_sat/module-type-S/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat.S.Proof.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.S.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/module-type-S/Proof/index.html b/sidekick/Sidekick_sat/module-type-S/Proof/index.html
new file mode 100644
index 00000000..960695e8
--- /dev/null
+++ b/sidekick/Sidekick_sat/module-type-S/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat.S.Proof)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat.S.Proof</code></h1></header><div class="doc"><p>A module to manipulate proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat/module-type-S/index.html b/sidekick/Sidekick_sat/module-type-S/index.html
new file mode 100644
index 00000000..5de5d9a3
--- /dev/null
+++ b/sidekick/Sidekick_sat/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat.S</code></h1></header><section><header><h2 id="internal-modules"><a href="#internal-modules" class="anchor"></a>Internal modules</h2><p>These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.</p></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>user formulas</p></dd></dl><dl><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code></code></dt><dd><p>SAT solver literals</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>SAT solver clauses</p></dd></dl><dl><dt id="type-theory"><a href="#type-theory" class="anchor"></a><code><span class="keyword">type </span>theory</code><code></code><code></code></dt><dd><p>user theory</p></dd></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <a href="../Res/index.html#module-type-S">Res.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Res/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="index.html#type-clause">clause</a></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Main solver type, containing all state for solving.</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create new solver</p><dl><dt>parameter size</dt><dd><p>the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.</p></dd></dl></dd></dl></section><section><header><h2 id="types"><a href="#types" class="anchor"></a>Types</h2></header><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atoms given by the module argument for formulas. An atom is a user-defined atomic formula whose truth value is picked by Msat.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="index.html#type-formula">formula</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-sat_state">Sidekick_sat__.Solver_intf.sat_state</a></code></td><td class="doc"><p>Returned when the solver reaches SAT, with a model</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span>(<a href="index.html#type-clause">clause</a>, <a href="Proof/index.html#type-proof">Proof.proof</a>) <a href="../../Sidekick_sat__/Solver_intf/index.html#type-unsat_state">Sidekick_sat__.Solver_intf.unsat_state</a></code></td><td class="doc"><p>Returned when the solver reaches UNSAT, with a proof</p></td></tr></table><code></code></dt><dd><p>Result type for the solver</p></dd></dl><dl><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dd><p>Exception raised by the evaluating functions when a literal has not yet been assigned a value.</p></dd></dl></section><section><header><h2 id="base-operations"><a href="#base-operations" class="anchor"></a>Base operations</h2></header><dl><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-theory">theory</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : ?&#8288;permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking (default true)</p></dd></dl></dd></dl><dl><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Lower level addition of clauses. See <a href="Clause/index.html"><code>Clause</code></a> to create clauses.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;assumptions:<a href="index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dd><p>Try and solves the current set of clauses.</p><dl><dt>parameter assumptions</dt><dd><p>additional atomic assumptions to be temporarily added. The assumptions are just used for this call to <code>solve</code>, they are not saved in the solver's state.</p></dd></dl></dd></dl><dl><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a new atom (i.e propositional formula) to the solver. This formula will be decided on at some point during solving, whether it appears in clauses or not.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="Proof/index.html#type-proof">Proof.proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat core of a given proof, ie a subset of all the added clauses that is sufficient to establish unsatisfiability.</p></dd></dl><dl><dt id="val-true_at_level0"><a href="#val-true_at_level0" class="anchor"></a><code><span class="keyword">val </span>true_at_level0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p><code>true_at_level0 a</code> returns <code>true</code> if <code>a</code> was proved at level0, i.e. it must hold in all models</p></dd></dl><dl><dt id="val-get_tag"><a href="#val-get_tag" class="anchor"></a><code><span class="keyword">val </span>get_tag : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> int option</code></dt><dd><p>Recover tag from a clause, if any</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Push a new save point. Clauses added after this call to <code>push</code> will be added as normal, but the corresponding call to <code>pop</code> will remove these clauses.</p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Return to last save point, discarding clauses added since last call to <code>push</code></p></dd></dl><dl><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="Proof/index.html#type-lemma">Proof.lemma</a>) <a href="../Theory_intf/index.html#type-actions">Theory_intf.actions</a></code></dt><dd><p>Obtain actions</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-export">Sidekick_sat__.Solver_intf.export</a></code></dt></dl></section><section><header><h2 id="re-export-some-functions"><a href="#re-export-some-functions" class="anchor"></a>Re-export some functions</h2></header><dl><dt id="type-solver"><a href="#type-solver" class="anchor"></a><code><span class="keyword">type </span>solver</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/.jbuilder-keep b/sidekick/Sidekick_sat__/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat__/Internal/Make/H/index.html b/sidekick/Sidekick_sat__/Internal/Make/H/index.html
new file mode 100644
index 00000000..37f21170
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/H/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>H (sidekick.Sidekick_sat__.Internal.Make.H)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.H</code></h1></header><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-var">St.var</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-decrease"><a href="#val-decrease" class="anchor"></a><code><span class="keyword">val </span>decrease : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-insert"><a href="#val-insert" class="anchor"></a><code><span class="keyword">val </span>insert : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove_min"><a href="#val-remove_min" class="anchor"></a><code><span class="keyword">val </span>remove_min : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/Atom/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/Atom/index.html
new file mode 100644
index 00000000..9c253bd3
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Internal.Make.Proof.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/Clause/Tbl/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/Clause/Tbl/index.html
new file mode 100644
index 00000000..bb1a7a77
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/Clause/Tbl/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tbl (sidekick.Sidekick_sat__.Internal.Make.Proof.Clause.Tbl)</title><link rel="stylesheet" href="../../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.Clause.Tbl</code></h1></header><dl><dt id="type-key"><a href="#type-key" class="anchor"></a><code><span class="keyword">type </span>key</code><code><span class="keyword"> = </span><a href="../index.html#type-t">t</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../../../../../../Sidekick_sat__Res/Make/Clause/index.html#module-Tbl">Sidekick_sat__Res.Make(St).Clause.Tbl</a>.t</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-reset"><a href="#val-reset" class="anchor"></a><code><span class="keyword">val </span>reset : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_all"><a href="#val-find_all" class="anchor"></a><code><span class="keyword">val </span>find_all : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-replace"><a href="#val-replace" class="anchor"></a><code><span class="keyword">val </span>replace : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter_map_inplace"><a href="#val-filter_map_inplace" class="anchor"></a><code><span class="keyword">val </span>filter_map_inplace : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-stats"><a href="#val-stats" class="anchor"></a><code><span class="keyword">val </span>stats : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> Hashtbl.statistics</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/Clause/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/Clause/index.html
new file mode 100644
index 00000000..e117bc5b
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Internal.Make.Proof.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span><a href="Tbl/index.html">Tbl</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Atom/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Atom/index.html
new file mode 100644
index 00000000..0370a114
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Internal.Make.Proof.St.Atom)</title><link rel="stylesheet" href="../../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Clause/Tbl/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Clause/Tbl/index.html
new file mode 100644
index 00000000..77c65800
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Clause/Tbl/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tbl (sidekick.Sidekick_sat__.Internal.Make.Proof.St.Clause.Tbl)</title><link rel="stylesheet" href="../../../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.St.Clause.Tbl</code></h1></header><dl><dt id="type-key"><a href="#type-key" class="anchor"></a><code><span class="keyword">type </span>key</code><code><span class="keyword"> = </span><a href="../index.html#type-t">t</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../../../../argument-1-St/Clause/index.html#module-Tbl">St.Clause.Tbl</a>.t</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-reset"><a href="#val-reset" class="anchor"></a><code><span class="keyword">val </span>reset : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_all"><a href="#val-find_all" class="anchor"></a><code><span class="keyword">val </span>find_all : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-replace"><a href="#val-replace" class="anchor"></a><code><span class="keyword">val </span>replace : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter_map_inplace"><a href="#val-filter_map_inplace" class="anchor"></a><code><span class="keyword">val </span>filter_map_inplace : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-stats"><a href="#val-stats" class="anchor"></a><code><span class="keyword">val </span>stats : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> Hashtbl.statistics</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Clause/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Clause/index.html
new file mode 100644
index 00000000..7d0dff2e
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Internal.Make.Proof.St.Clause)</title><link rel="stylesheet" href="../../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span><a href="Tbl/index.html">Tbl</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Formula/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Formula/index.html
new file mode 100644
index 00000000..e2368029
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Internal.Make.Proof.St.Formula)</title><link rel="stylesheet" href="../../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Var/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Var/index.html
new file mode 100644
index 00000000..d070c759
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__.Internal.Make.Proof.St.Var)</title><link rel="stylesheet" href="../../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/St/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/index.html
new file mode 100644
index 00000000..784afd06
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>St (sidekick.Sidekick_sat__.Internal.Make.Proof.St)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.St</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-t">St.t</a></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Big | `Small | `Tiny ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-var">St.var</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-atom">St.atom</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-clause">St.clause</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-reason">St.reason</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td></tr></table><code></code></dt><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-premise">St.premise</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td></tr></table><code></code></dt></dl><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt></dl><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/Tbl/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/Tbl/index.html
new file mode 100644
index 00000000..64081aa7
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/Tbl/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tbl (sidekick.Sidekick_sat__.Internal.Make.Proof.Tbl)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof.Tbl</code></h1></header><dl><dt id="type-key"><a href="#type-key" class="anchor"></a><code><span class="keyword">type </span>key</code><code><span class="keyword"> = </span><a href="../index.html#type-proof">proof</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../../../../../Sidekick_sat__Res/Make/index.html#module-Tbl">Sidekick_sat__Res.Make(St).Tbl</a>.t</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-reset"><a href="#val-reset" class="anchor"></a><code><span class="keyword">val </span>reset : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_all"><a href="#val-find_all" class="anchor"></a><code><span class="keyword">val </span>find_all : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-replace"><a href="#val-replace" class="anchor"></a><code><span class="keyword">val </span>replace : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter_map_inplace"><a href="#val-filter_map_inplace" class="anchor"></a><code><span class="keyword">val </span>filter_map_inplace : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-stats"><a href="#val-stats" class="anchor"></a><code><span class="keyword">val </span>stats : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> Hashtbl.statistics</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/Proof/index.html b/sidekick/Sidekick_sat__/Internal/Make/Proof/index.html
new file mode 100644
index 00000000..65d91130
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat__.Internal.Make.Proof)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.Proof</code></h1></header><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span><a href="St/index.html">St</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="../../../../Sidekick_sat__Res/Make/index.html#type-proof">Sidekick_sat__Res.Make(St).proof</a></code><code></code></dt><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code><span class="keyword"> = </span><a href="../../../../Sidekick_sat__Res/Make/index.html#type-proof_node">Sidekick_sat__Res.Make(St).proof_node</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code><span class="keyword"> = </span><a href="../../../../Sidekick_sat__Res/Make/index.html#type-step">Sidekick_sat__Res.Make(St).step</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td></tr></table><code></code></dt></dl><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span><a href="Tbl/index.html">Tbl</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Atom/index.html b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Atom/index.html
new file mode 100644
index 00000000..39f8b43a
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Internal.Make.1-St.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.1-St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Clause/index.html b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Clause/index.html
new file mode 100644
index 00000000..2a9a08cd
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Internal.Make.1-St.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.1-St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Formula/index.html b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Formula/index.html
new file mode 100644
index 00000000..8ffa3d94
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Internal.Make.1-St.Formula)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.1-St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Var/index.html b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Var/index.html
new file mode 100644
index 00000000..d8c4953c
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__.Internal.Make.1-St.Var)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.1-St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/index.html b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/index.html
new file mode 100644
index 00000000..c1d4a334
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/argument-1-St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-St (sidekick.Sidekick_sat__.Internal.Make.1-St)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__.Internal.Make.1-St</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/argument-2-Th/Form/index.html b/sidekick/Sidekick_sat__/Internal/Make/argument-2-Th/Form/index.html
new file mode 100644
index 00000000..5e949476
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/argument-2-Th/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat__.Internal.Make.2-Th.Form)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make.2-Th.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/argument-2-Th/index.html b/sidekick/Sidekick_sat__/Internal/Make/argument-2-Th/index.html
new file mode 100644
index 00000000..57b57f63
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/argument-2-Th/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-Th (sidekick.Sidekick_sat__.Internal.Make.2-Th)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__.Internal.Make.2-Th</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-formula">St.formula</a></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-proof">St.proof</a></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/Make/index.html b/sidekick/Sidekick_sat__/Internal/Make/index.html
new file mode 100644
index 00000000..500b7953
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat__.Internal.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal.Make</code></h1></header><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-Th/index.html">Th</a> : <a href="../../../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-Th/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-Th/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-proof">St.proof</a></code><code><a href="argument-1-St/index.html">St</a> : <a href="../../Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></dl><h3 class="heading">Signature</h3><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-H"><a href="#module-H" class="anchor"></a><code><span class="keyword">module </span><a href="H/index.html">H</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="exception-Sat"><a href="#exception-Sat" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Sat</span></code></dt><dt id="exception-Unsat"><a href="#exception-Unsat" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Unsat</span></code></dt><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dt id="exception-Restart"><a href="#exception-Restart" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Restart</span></code></dt><dt id="exception-Conflict"><a href="#exception-Conflict" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Conflict</span><span class="keyword"> of </span><a href="argument-1-St/index.html#type-clause">St.clause</a></code></dt></dl><dl><dt id="val-var_decay"><a href="#val-var_decay" class="anchor"></a><code><span class="keyword">val </span>var_decay : float</code></dt><dt id="val-clause_decay"><a href="#val-clause_decay" class="anchor"></a><code><span class="keyword">val </span>clause_decay : float</code></dt><dt id="val-restart_first"><a href="#val-restart_first" class="anchor"></a><code><span class="keyword">val </span>restart_first : int</code></dt><dt id="val-learntsize_factor"><a href="#val-learntsize_factor" class="anchor"></a><code><span class="keyword">val </span>learntsize_factor : float</code></dt><dt id="val-restart_inc"><a href="#val-restart_inc" class="anchor"></a><code><span class="keyword">val </span>restart_inc : float</code></dt><dt id="val-learntsize_inc"><a href="#val-learntsize_inc" class="anchor"></a><code><span class="keyword">val </span>learntsize_inc : float</code></dt></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.st" class="anchored"><td class="def field"><a href="#type-t.st" class="anchor"></a><code>st : <a href="argument-1-St/index.html#type-t">St.t</a>;</code></td></tr><tr id="type-t.th" class="anchored"><td class="def field"><a href="#type-t.th" class="anchor"></a><code>th : <a href="argument-2-Th/index.html#type-t">Th.t</a> lazy_t;</code></td></tr><tr id="type-t.clauses_hyps" class="anchored"><td class="def field"><a href="#type-t.clauses_hyps" class="anchor"></a><code>clauses_hyps : <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.clauses_learnt" class="anchored"><td class="def field"><a href="#type-t.clauses_learnt" class="anchor"></a><code>clauses_learnt : <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.clauses_temp" class="anchored"><td class="def field"><a href="#type-t.clauses_temp" class="anchor"></a><code>clauses_temp : <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.unsat_conflict" class="anchored"><td class="def field"><a href="#type-t.unsat_conflict" class="anchor"></a><code><span class="keyword">mutable </span>unsat_conflict : <a href="argument-1-St/index.html#type-clause">St.clause</a> option;</code></td></tr><tr id="type-t.next_decision" class="anchored"><td class="def field"><a href="#type-t.next_decision" class="anchor"></a><code><span class="keyword">mutable </span>next_decision : <a href="argument-1-St/index.html#type-atom">St.atom</a> option;</code></td></tr><tr id="type-t.trail" class="anchored"><td class="def field"><a href="#type-t.trail" class="anchor"></a><code>trail : <a href="argument-1-St/index.html#type-atom">St.atom</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.elt_levels" class="anchored"><td class="def field"><a href="#type-t.elt_levels" class="anchor"></a><code>elt_levels : int <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.user_levels" class="anchored"><td class="def field"><a href="#type-t.user_levels" class="anchor"></a><code>user_levels : int <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.backtrack_levels" class="anchored"><td class="def field"><a href="#type-t.backtrack_levels" class="anchor"></a><code>backtrack_levels : int <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.backtrack" class="anchored"><td class="def field"><a href="#type-t.backtrack" class="anchor"></a><code>backtrack : (unit <span>&#8209;&gt;</span> unit) <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>Actions to call when backtracking</p></td></tr><tr id="type-t.to_redo_after_backtrack" class="anchored"><td class="def field"><a href="#type-t.to_redo_after_backtrack" class="anchor"></a><code>to_redo_after_backtrack : (unit <span>&#8209;&gt;</span> unit) <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>Actions to re-do after backtracking</p></td></tr><tr id="type-t.th_head" class="anchored"><td class="def field"><a href="#type-t.th_head" class="anchor"></a><code><span class="keyword">mutable </span>th_head : int;</code></td></tr><tr id="type-t.elt_head" class="anchored"><td class="def field"><a href="#type-t.elt_head" class="anchor"></a><code><span class="keyword">mutable </span>elt_head : int;</code></td></tr><tr id="type-t.order" class="anchored"><td class="def field"><a href="#type-t.order" class="anchor"></a><code>order : <a href="H/index.html#type-t">H.t</a>;</code></td></tr><tr id="type-t.var_incr" class="anchored"><td class="def field"><a href="#type-t.var_incr" class="anchor"></a><code><span class="keyword">mutable </span>var_incr : float;</code></td></tr><tr id="type-t.clause_incr" class="anchored"><td class="def field"><a href="#type-t.clause_incr" class="anchor"></a><code><span class="keyword">mutable </span>clause_incr : float;</code></td></tr><tr id="type-t.to_add" class="anchored"><td class="def field"><a href="#type-t.to_add" class="anchor"></a><code>to_add : (bool<span class="keyword"> * </span><a href="argument-1-St/index.html#type-clause">St.clause</a>) CCVector.vector;</code></td></tr><tr id="type-t.dirty" class="anchored"><td class="def field"><a href="#type-t.dirty" class="anchor"></a><code><span class="keyword">mutable </span>dirty : bool;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-create_"><a href="#val-create_" class="anchor"></a><code><span class="keyword">val </span>create_ : st:<a href="argument-1-St/index.html#type-t">St.t</a> <span>&#8209;&gt;</span> size_trail:int <span>&#8209;&gt;</span> size_lvl:int <span>&#8209;&gt;</span> <a href="argument-2-Th/index.html#type-t">Th.t</a> lazy_t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-2-Th/index.html#type-t">Th.t</a></code></dt><dt id="val-at_level_0"><a href="#val-at_level_0" class="anchor"></a><code><span class="keyword">val </span>at_level_0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-on_backtrack"><a href="#val-on_backtrack" class="anchor"></a><code><span class="keyword">val </span>on_backtrack : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dt id="val-st"><a href="#val-st" class="anchor"></a><code><span class="keyword">val </span>st : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-t">St.t</a></code></dt><dt id="val-nb_clauses"><a href="#val-nb_clauses" class="anchor"></a><code><span class="keyword">val </span>nb_clauses : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-decision_level"><a href="#val-decision_level" class="anchor"></a><code><span class="keyword">val </span>decision_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-base_level"><a href="#val-base_level" class="anchor"></a><code><span class="keyword">val </span>base_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-redo_down_to_level_0"><a href="#val-redo_down_to_level_0" class="anchor"></a><code><span class="keyword">val </span>redo_down_to_level_0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dt id="val-to_float"><a href="#val-to_float" class="anchor"></a><code><span class="keyword">val </span>to_float : int <span>&#8209;&gt;</span> float</code></dt><dt id="val-to_int"><a href="#val-to_int" class="anchor"></a><code><span class="keyword">val </span>to_int : float <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_unsat"><a href="#val-is_unsat" class="anchor"></a><code><span class="keyword">val </span>is_unsat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-insert_var_order"><a href="#val-insert_var_order" class="anchor"></a><code><span class="keyword">val </span>insert_var_order : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-var">St.var</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a></code></dt><dt id="val-var_decay_activity"><a href="#val-var_decay_activity" class="anchor"></a><code><span class="keyword">val </span>var_decay_activity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-clause_decay_activity"><a href="#val-clause_decay_activity" class="anchor"></a><code><span class="keyword">val </span>clause_decay_activity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-var_bump_activity"><a href="#val-var_bump_activity" class="anchor"></a><code><span class="keyword">val </span>var_bump_activity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="H/index.html#type-elt">H.elt</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-clause_bump_activity"><a href="#val-clause_bump_activity" class="anchor"></a><code><span class="keyword">val </span>clause_bump_activity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt></dl><dl><dt id="exception-Trivial"><a href="#exception-Trivial" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Trivial</span></code></dt></dl><dl><dt id="val-arr_to_list"><a href="#val-arr_to_list" class="anchor"></a><code><span class="keyword">val </span>arr_to_list : <span class="type-var">'a</span> array <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-eliminate_duplicates"><a href="#val-eliminate_duplicates" class="anchor"></a><code><span class="keyword">val </span>eliminate_duplicates : <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a></code></dt><dt id="val-partition"><a href="#val-partition" class="anchor"></a><code><span class="keyword">val </span>partition : <a href="argument-1-St/index.html#type-atom">St.atom</a> array <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> list<span class="keyword"> * </span><a href="argument-1-St/index.html#type-clause">St.clause</a> list</code></dt><dt id="val-new_decision_level"><a href="#val-new_decision_level" class="anchor"></a><code><span class="keyword">val </span>new_decision_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-attach_clause"><a href="#val-attach_clause" class="anchor"></a><code><span class="keyword">val </span>attach_clause : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-backtrack_down_to"><a href="#val-backtrack_down_to" class="anchor"></a><code><span class="keyword">val </span>backtrack_down_to : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-cancel_until"><a href="#val-cancel_until" class="anchor"></a><code><span class="keyword">val </span>cancel_until : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-report_unsat"><a href="#val-report_unsat" class="anchor"></a><code><span class="keyword">val </span>report_unsat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-simpl_reason"><a href="#val-simpl_reason" class="anchor"></a><code><span class="keyword">val </span>simpl_reason : <a href="argument-1-St/index.html#type-reason">St.reason</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-reason">St.reason</a></code></dt><dt id="val-enqueue_bool"><a href="#val-enqueue_bool" class="anchor"></a><code><span class="keyword">val </span>enqueue_bool : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Atom/index.html#type-t">St.Atom.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-reason">St.reason</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-swap_arr"><a href="#val-swap_arr" class="anchor"></a><code><span class="keyword">val </span>swap_arr : <span class="type-var">'a</span> array <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-put_high_level_atoms_first"><a href="#val-put_high_level_atoms_first" class="anchor"></a><code><span class="keyword">val </span>put_high_level_atoms_first : <a href="argument-1-St/index.html#type-atom">St.atom</a> array <span>&#8209;&gt;</span> unit</code></dt><dt id="val-backtrack_lvl"><a href="#val-backtrack_lvl" class="anchor"></a><code><span class="keyword">val </span>backtrack_lvl : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> list <span>&#8209;&gt;</span> int<span class="keyword"> * </span>bool</code></dt></dl><dl><dt id="type-conflict_res"><a href="#type-conflict_res" class="anchor"></a><code><span class="keyword">type </span>conflict_res</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-conflict_res.cr_backtrack_lvl" class="anchored"><td class="def field"><a href="#type-conflict_res.cr_backtrack_lvl" class="anchor"></a><code>cr_backtrack_lvl : int;</code></td></tr><tr id="type-conflict_res.cr_learnt" class="anchored"><td class="def field"><a href="#type-conflict_res.cr_learnt" class="anchor"></a><code>cr_learnt : <a href="argument-1-St/index.html#type-atom">St.atom</a> list;</code></td></tr><tr id="type-conflict_res.cr_history" class="anchored"><td class="def field"><a href="#type-conflict_res.cr_history" class="anchor"></a><code>cr_history : <a href="argument-1-St/index.html#type-clause">St.clause</a> list;</code></td></tr><tr id="type-conflict_res.cr_is_uip" class="anchored"><td class="def field"><a href="#type-conflict_res.cr_is_uip" class="anchor"></a><code>cr_is_uip : bool;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-get_atom"><a href="#val-get_atom" class="anchor"></a><code><span class="keyword">val </span>get_atom : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a></code></dt><dt id="val-analyze_sat"><a href="#val-analyze_sat" class="anchor"></a><code><span class="keyword">val </span>analyze_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-conflict_res">conflict_res</a></code></dt><dt id="val-analyze"><a href="#val-analyze" class="anchor"></a><code><span class="keyword">val </span>analyze : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-conflict_res">conflict_res</a></code></dt><dt id="val-record_learnt_clause"><a href="#val-record_learnt_clause" class="anchor"></a><code><span class="keyword">val </span>record_learnt_clause : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-conflict_res">conflict_res</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-add_boolean_conflict"><a href="#val-add_boolean_conflict" class="anchor"></a><code><span class="keyword">val </span>add_boolean_conflict : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-clause_vector"><a href="#val-clause_vector" class="anchor"></a><code><span class="keyword">val </span>clause_vector : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt><dt id="val-add_clause_permanent"><a href="#val-add_clause_permanent" class="anchor"></a><code><span class="keyword">val </span>add_clause_permanent : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> list <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-add_clause_user"><a href="#val-add_clause_user" class="anchor"></a><code><span class="keyword">val </span>add_clause_user : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt></dl><dl><dt id="type-watch_res"><a href="#type-watch_res" class="anchor"></a><code><span class="keyword">type </span>watch_res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-watch_res.Watch_kept" class="anchored"><td class="def constructor"><a href="#type-watch_res.Watch_kept" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Watch_kept</span></code></td></tr><tr id="type-watch_res.Watch_removed" class="anchored"><td class="def constructor"><a href="#type-watch_res.Watch_removed" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Watch_removed</span></code></td></tr></table><code></code></dt></dl><dl><dt id="exception-Exn_remove_watch"><a href="#exception-Exn_remove_watch" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Exn_remove_watch</span></code></dt></dl><dl><dt id="val-propagate_in_clause"><a href="#val-propagate_in_clause" class="anchor"></a><code><span class="keyword">val </span>propagate_in_clause : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-watch_res">watch_res</a></code></dt><dt id="val-propagate_atom"><a href="#val-propagate_atom" class="anchor"></a><code><span class="keyword">val </span>propagate_atom : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-slice_iter"><a href="#val-slice_iter" class="anchor"></a><code><span class="keyword">val </span>slice_iter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> (<a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dt id="val-act_push_"><a href="#val-act_push_" class="anchor"></a><code><span class="keyword">val </span>act_push_ : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-proof">St.proof</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-act_push_local"><a href="#val-act_push_local" class="anchor"></a><code><span class="keyword">val </span>act_push_local : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-proof">St.proof</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-act_push_persistent"><a href="#val-act_push_persistent" class="anchor"></a><code><span class="keyword">val </span>act_push_persistent : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-proof">St.proof</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-act_propagate"><a href="#val-act_propagate" class="anchor"></a><code><span class="keyword">val </span>act_propagate : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> list <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-proof">St.proof</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-current_slice"><a href="#val-current_slice" class="anchor"></a><code><span class="keyword">val </span>current_slice : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> (<a href="argument-1-St/index.html#type-formula">St.formula</a>, <span class="type-var">'a</span>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a></code></dt><dt id="val-full_slice"><a href="#val-full_slice" class="anchor"></a><code><span class="keyword">val </span>full_slice : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="argument-1-St/index.html#type-formula">St.formula</a>, <span class="type-var">'a</span>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a></code></dt><dt id="val-act_at_level_0"><a href="#val-act_at_level_0" class="anchor"></a><code><span class="keyword">val </span>act_at_level_0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> bool</code></dt><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="argument-1-St/index.html#type-formula">St.formula</a>, <a href="argument-1-St/index.html#type-proof">St.proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a></code></dt><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Big | `Small | `Tiny ] <span>&#8209;&gt;</span> ?&#8288;st:<a href="argument-1-St/index.html#type-t">St.t</a> <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-propagation_fixpoint"><a href="#val-propagation_fixpoint" class="anchor"></a><code><span class="keyword">val </span>propagation_fixpoint : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-theory_propagate"><a href="#val-theory_propagate" class="anchor"></a><code><span class="keyword">val </span>theory_propagate : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> option</code></dt><dt id="val-propagate"><a href="#val-propagate" class="anchor"></a><code><span class="keyword">val </span>propagate : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> option</code></dt><dt id="val-reduce_db"><a href="#val-reduce_db" class="anchor"></a><code><span class="keyword">val </span>reduce_db : unit <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pick_branch_aux"><a href="#val-pick_branch_aux" class="anchor"></a><code><span class="keyword">val </span>pick_branch_aux : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Atom/index.html#type-t">St.Atom.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pick_branch_lit"><a href="#val-pick_branch_lit" class="anchor"></a><code><span class="keyword">val </span>pick_branch_lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-search"><a href="#val-search" class="anchor"></a><code><span class="keyword">val </span>search : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-eval_level"><a href="#val-eval_level" class="anchor"></a><code><span class="keyword">val </span>eval_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> bool<span class="keyword"> * </span>int</code></dt><dt id="val-eval"><a href="#val-eval" class="anchor"></a><code><span class="keyword">val </span>eval : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-unsat_conflict"><a href="#val-unsat_conflict" class="anchor"></a><code><span class="keyword">val </span>unsat_conflict : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> option</code></dt><dt id="val-pp_trail"><a href="#val-pp_trail" class="anchor"></a><code><span class="keyword">val </span>pp_trail : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> list list <span>&#8209;&gt;</span> unit</code></dt><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-local"><a href="#val-local" class="anchor"></a><code><span class="keyword">val </span>local : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> list <span>&#8209;&gt;</span> unit</code></dt><dt id="val-check_clause"><a href="#val-check_clause" class="anchor"></a><code><span class="keyword">val </span>check_clause : <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-check_vec"><a href="#val-check_vec" class="anchor"></a><code><span class="keyword">val </span>check_vec : <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-check_stack"><a href="#val-check_stack" class="anchor"></a><code><span class="keyword">val </span>check_stack : <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> Stack.t <span>&#8209;&gt;</span> bool</code></dt><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hyps"><a href="#val-hyps" class="anchor"></a><code><span class="keyword">val </span>hyps : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt><dt id="val-history"><a href="#val-history" class="anchor"></a><code><span class="keyword">val </span>history : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt><dt id="val-temp"><a href="#val-temp" class="anchor"></a><code><span class="keyword">val </span>temp : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt><dt id="val-trail"><a href="#val-trail" class="anchor"></a><code><span class="keyword">val </span>trail : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Internal/index.html b/sidekick/Sidekick_sat__/Internal/index.html
new file mode 100644
index 00000000..0a806118
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Internal/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Internal (sidekick.Sidekick_sat__.Internal)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Internal</code></h1></header><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-St/index.html">St</a> : <a href="../Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-Th/index.html">Th</a> : <a href="../../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-proof">St.proof</a>) -&gt; <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/Make/Atom/index.html b/sidekick/Sidekick_sat__/Res/Make/Atom/index.html
new file mode 100644
index 00000000..2a81d8c1
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/Make/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Res.Make.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.Make.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/Make/Clause/index.html b/sidekick/Sidekick_sat__/Res/Make/Clause/index.html
new file mode 100644
index 00000000..499b020c
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/Make/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Res.Make.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.Make.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Atom/index.html b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Atom/index.html
new file mode 100644
index 00000000..aa0f9ce5
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Res.Make.1-St.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.Make.1-St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Clause/index.html b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Clause/index.html
new file mode 100644
index 00000000..afd888e1
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Res.Make.1-St.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.Make.1-St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Formula/index.html b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Formula/index.html
new file mode 100644
index 00000000..d22961cb
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Res.Make.1-St.Formula)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.Make.1-St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Var/index.html b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Var/index.html
new file mode 100644
index 00000000..43df7ad6
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__.Res.Make.1-St.Var)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.Make.1-St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/Make/argument-1-St/index.html b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/index.html
new file mode 100644
index 00000000..847d54d3
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/Make/argument-1-St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-St (sidekick.Sidekick_sat__.Res.Make.1-St)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__.Res.Make.1-St</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/Make/index.html b/sidekick/Sidekick_sat__/Res/Make/index.html
new file mode 100644
index 00000000..1c13a75f
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat__.Res.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.Make</code></h1></header><div class="doc"><p>Functor to create a module building proofs from a sat-solver unsat trace.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-St/index.html">St</a> : <a href="../../Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></dl><h3 class="heading">Signature</h3><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span>St = <a href="index.html#argument-1-St">St</a></code></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../Res_intf/index.html#module-type-S">Sidekick_sat__.Res_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Res_intf/module-type-S/index.html#type-atom">atom</a><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Res_intf/module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Res_intf/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Res_intf/module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code></span></summary><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></details></div></div></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/index.html b/sidekick/Sidekick_sat__/Res/index.html
new file mode 100644
index 00000000..ecf2aba5
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Res (sidekick.Sidekick_sat__.Res)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res</code></h1></header><aside><p>Resolution proofs</p><p>This modules defines functions to create and manipulate resolution proofs.</p></aside><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Res_intf/index.html#module-type-S">Sidekick_sat__.Res_intf.S</a></code></article><article id="module-type-FULL"><a href="#module-type-FULL" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-FULL/index.html">FULL</a> = <a href="../Res_intf/index.html#module-type-FULL">Sidekick_sat__.Res_intf.FULL</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-St/index.html">St</a> : <a href="../Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a>) -&gt; <a href="index.html#module-type-FULL">FULL</a><span class="keyword"> with </span><span class="keyword">module </span><a href="Make/St/index.html">St</a> = <a href="Make/index.html#argument-1-St">St</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-FULL/Atom/index.html b/sidekick/Sidekick_sat__/Res/module-type-FULL/Atom/index.html
new file mode 100644
index 00000000..b9bf94e1
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-FULL/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Res.FULL.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.FULL.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-FULL/Clause/index.html b/sidekick/Sidekick_sat__/Res/module-type-FULL/Clause/index.html
new file mode 100644
index 00000000..5c75825b
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-FULL/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Res.FULL.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.FULL.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Atom/index.html b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Atom/index.html
new file mode 100644
index 00000000..7655165b
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Res.FULL.St.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.FULL.St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Clause/index.html b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Clause/index.html
new file mode 100644
index 00000000..c0c88cb1
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Res.FULL.St.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.FULL.St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Formula/index.html b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Formula/index.html
new file mode 100644
index 00000000..e32ffbc0
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Res.FULL.St.Formula)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.FULL.St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Var/index.html b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Var/index.html
new file mode 100644
index 00000000..4b76f8e4
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__.Res.FULL.St.Var)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.FULL.St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-FULL/St/index.html b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/index.html
new file mode 100644
index 00000000..fdca0839
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-FULL/St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>St (sidekick.Sidekick_sat__.Res.FULL.St)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.FULL.St</code></h1></header><div class="doc"><p>Module defining atom and clauses</p></div><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-FULL/index.html b/sidekick/Sidekick_sat__/Res/module-type-FULL/index.html
new file mode 100644
index 00000000..4c8a92a0
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-FULL/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>FULL (sidekick.Sidekick_sat__.Res.FULL)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__.Res.FULL</code></h1></header><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span><a href="St/index.html">St</a> : <a href="../../Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../Res_intf/index.html#module-type-S">Sidekick_sat__.Res_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Res_intf/module-type-S/index.html#type-atom">atom</a><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Res_intf/module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Res_intf/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Res_intf/module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code></span></summary><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></details></div></div></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-S/Atom/index.html b/sidekick/Sidekick_sat__/Res/module-type-S/Atom/index.html
new file mode 100644
index 00000000..5e10acda
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Res.S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__/Res/module-type-S/Clause/index.html
new file mode 100644
index 00000000..607082f5
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Res.S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res/module-type-S/index.html b/sidekick/Sidekick_sat__/Res/module-type-S/index.html
new file mode 100644
index 00000000..a5ea8705
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__.Res.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__.Res.S</code></h1></header><div class="doc"><p>Interface for a module manipulating resolution proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/index.html b/sidekick/Sidekick_sat__/Res_intf/index.html
new file mode 100644
index 00000000..254b19fb
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Res_intf (sidekick.Sidekick_sat__.Res_intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf</code></h1></header><aside><p>Interface for proofs</p></aside><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-FULL"><a href="#module-type-FULL" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-FULL/index.html">FULL</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/Atom/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/Atom/index.html
new file mode 100644
index 00000000..dc9a0787
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Res_intf.FULL.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf.FULL.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/Clause/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/Clause/index.html
new file mode 100644
index 00000000..891fce36
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Res_intf.FULL.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf.FULL.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Atom/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Atom/index.html
new file mode 100644
index 00000000..48fa6dc1
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Res_intf.FULL.St.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf.FULL.St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Clause/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Clause/index.html
new file mode 100644
index 00000000..bbfdd659
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Res_intf.FULL.St.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf.FULL.St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Formula/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Formula/index.html
new file mode 100644
index 00000000..5b8f4060
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Res_intf.FULL.St.Formula)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf.FULL.St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Var/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Var/index.html
new file mode 100644
index 00000000..eec2d16e
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__.Res_intf.FULL.St.Var)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf.FULL.St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/index.html
new file mode 100644
index 00000000..5febcc29
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>St (sidekick.Sidekick_sat__.Res_intf.FULL.St)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf.FULL.St</code></h1></header><div class="doc"><p>Module defining atom and clauses</p></div><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/index.html
new file mode 100644
index 00000000..b9bd99c0
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-FULL/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>FULL (sidekick.Sidekick_sat__.Res_intf.FULL)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__.Res_intf.FULL</code></h1></header><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span><a href="St/index.html">St</a> : <a href="../../Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../module-type-S/index.html#type-atom">atom</a><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code></span></summary><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></details></div></div></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-S/Atom/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-S/Atom/index.html
new file mode 100644
index 00000000..8971d2ad
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Res_intf.S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-S/Clause/index.html
new file mode 100644
index 00000000..8791b996
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Res_intf.S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Res_intf.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Res_intf/module-type-S/index.html b/sidekick/Sidekick_sat__/Res_intf/module-type-S/index.html
new file mode 100644
index 00000000..c7a2fd56
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Res_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__.Res_intf.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__.Res_intf.S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/Clause/index.html b/sidekick/Sidekick_sat__/Solver/Make/Clause/index.html
new file mode 100644
index 00000000..9a8b377a
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver.Make.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <a href="../../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> array <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Make a clause from this array of SAT literals. The array's ownership is transferred to the clause, do not mutate it</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_atoms"><a href="#val-of_atoms" class="anchor"></a><code><span class="keyword">val </span>of_atoms : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/Formula/index.html b/sidekick/Sidekick_sat__/Solver/Make/Formula/index.html
new file mode 100644
index 00000000..0a5b127e
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Solver.Make.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/Lit/index.html b/sidekick/Sidekick_sat__/Solver/Make/Lit/index.html
new file mode 100644
index 00000000..5631056a
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_sat__.Solver.Make.Lit)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-lit">lit</a></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/Proof/Atom/index.html b/sidekick/Sidekick_sat__/Solver/Make/Proof/Atom/index.html
new file mode 100644
index 00000000..450e7e24
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Solver.Make.Proof.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/Proof/Clause/index.html b/sidekick/Sidekick_sat__/Solver/Make/Proof/Clause/index.html
new file mode 100644
index 00000000..44918d0d
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver.Make.Proof.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/Proof/index.html b/sidekick/Sidekick_sat__/Solver/Make/Proof/index.html
new file mode 100644
index 00000000..5b7f3a36
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat__.Solver.Make.Proof)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.Proof</code></h1></header><div class="doc"><p>A module to manipulate proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Atom/index.html b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Atom/index.html
new file mode 100644
index 00000000..58cf413f
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Solver.Make.1-St.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.1-St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Clause/index.html b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Clause/index.html
new file mode 100644
index 00000000..2d49b877
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver.Make.1-St.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.1-St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Formula/index.html b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Formula/index.html
new file mode 100644
index 00000000..63cec53c
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Solver.Make.1-St.Formula)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.1-St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Var/index.html b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Var/index.html
new file mode 100644
index 00000000..fcc9ca6e
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__.Solver.Make.1-St.Var)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.1-St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/index.html b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/index.html
new file mode 100644
index 00000000..651ccfb3
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/argument-1-St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-St (sidekick.Sidekick_sat__.Solver.Make.1-St)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__.Solver.Make.1-St</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/argument-2-Th/Form/index.html b/sidekick/Sidekick_sat__/Solver/Make/argument-2-Th/Form/index.html
new file mode 100644
index 00000000..8e849193
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/argument-2-Th/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat__.Solver.Make.2-Th.Form)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make.2-Th.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/argument-2-Th/index.html b/sidekick/Sidekick_sat__/Solver/Make/argument-2-Th/index.html
new file mode 100644
index 00000000..4f805804
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/argument-2-Th/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-Th (sidekick.Sidekick_sat__.Solver.Make.2-Th)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__.Solver.Make.2-Th</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-formula">St.formula</a></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-proof">St.proof</a></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/Make/index.html b/sidekick/Sidekick_sat__/Solver/Make/index.html
new file mode 100644
index 00000000..332ee117
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat__.Solver.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.Make</code></h1></header><div class="doc"><p>Functor to make a safe external interface.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-Th/index.html">Th</a> : <a href="../../../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-Th/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-Th/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-proof">St.proof</a></code><code><a href="argument-1-St/index.html">St</a> : <a href="../../Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></dl><h3 class="heading">Signature</h3><section><header><h2 id="internal-modules"><a href="#internal-modules" class="anchor"></a>Internal modules</h2><p>These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.</p></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="argument-1-St/index.html#type-formula">St.formula</a></code><code></code></dt><dd><p>user formulas</p></dd></dl><dl><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code></code></dt><dd><p>SAT solver literals</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="argument-1-St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>SAT solver clauses</p></dd></dl><dl><dt id="type-theory"><a href="#type-theory" class="anchor"></a><code><span class="keyword">type </span>theory</code><code><span class="keyword"> = </span><a href="argument-2-Th/index.html#type-t">Th.t</a></code><code></code></dt><dd><p>user theory</p></dd></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <a href="../../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../../Sidekick_sat/Res/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="index.html#type-clause">clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../../Sidekick_sat/Res/module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-proof">St.proof</a></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Main solver type, containing all state for solving.</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create new solver</p><dl><dt>parameter size</dt><dd><p>the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.</p></dd></dl></dd></dl></section><section><header><h2 id="types"><a href="#types" class="anchor"></a>Types</h2></header><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atoms given by the module argument for formulas. An atom is a user-defined atomic formula whose truth value is picked by Msat.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="index.html#type-formula">formula</a> <a href="../../Solver_intf/index.html#type-sat_state">Sidekick_sat__.Solver_intf.sat_state</a></code></td><td class="doc"><p>Returned when the solver reaches SAT, with a model</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span>(<a href="index.html#type-clause">clause</a>, <a href="Proof/index.html#type-proof">Proof.proof</a>) <a href="../../Solver_intf/index.html#type-unsat_state">Sidekick_sat__.Solver_intf.unsat_state</a></code></td><td class="doc"><p>Returned when the solver reaches UNSAT, with a proof</p></td></tr></table><code></code></dt><dd><p>Result type for the solver</p></dd></dl><dl><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dd><p>Exception raised by the evaluating functions when a literal has not yet been assigned a value.</p></dd></dl></section><section><header><h2 id="base-operations"><a href="#base-operations" class="anchor"></a>Base operations</h2></header><dl><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-theory">theory</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : ?&#8288;permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking (default true)</p></dd></dl></dd></dl><dl><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Lower level addition of clauses. See <a href="Clause/index.html"><code>Clause</code></a> to create clauses.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;assumptions:<a href="index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dd><p>Try and solves the current set of clauses.</p><dl><dt>parameter assumptions</dt><dd><p>additional atomic assumptions to be temporarily added. The assumptions are just used for this call to <code>solve</code>, they are not saved in the solver's state.</p></dd></dl></dd></dl><dl><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a new atom (i.e propositional formula) to the solver. This formula will be decided on at some point during solving, whether it appears in clauses or not.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="Proof/index.html#type-proof">Proof.proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat core of a given proof, ie a subset of all the added clauses that is sufficient to establish unsatisfiability.</p></dd></dl><dl><dt id="val-true_at_level0"><a href="#val-true_at_level0" class="anchor"></a><code><span class="keyword">val </span>true_at_level0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p><code>true_at_level0 a</code> returns <code>true</code> if <code>a</code> was proved at level0, i.e. it must hold in all models</p></dd></dl><dl><dt id="val-get_tag"><a href="#val-get_tag" class="anchor"></a><code><span class="keyword">val </span>get_tag : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> int option</code></dt><dd><p>Recover tag from a clause, if any</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Push a new save point. Clauses added after this call to <code>push</code> will be added as normal, but the corresponding call to <code>pop</code> will remove these clauses.</p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Return to last save point, discarding clauses added since last call to <code>push</code></p></dd></dl><dl><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="Proof/index.html#type-lemma">Proof.lemma</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a></code></dt><dd><p>Obtain actions</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <a href="../../Solver_intf/index.html#type-export">Sidekick_sat__.Solver_intf.export</a></code></dt></dl></section><section><header><h2 id="re-export-some-functions"><a href="#re-export-some-functions" class="anchor"></a>Re-export some functions</h2></header><dl><dt id="type-solver"><a href="#type-solver" class="anchor"></a><code><span class="keyword">type </span>solver</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/index.html b/sidekick/Sidekick_sat__/Solver/index.html
new file mode 100644
index 00000000..d9ba63a0
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Solver (sidekick.Sidekick_sat__.Solver)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver</code></h1></header><aside><p>SAT safe interface</p><p>This module defines a safe interface for the core solver. It is the basis of the <a href="index.html"><code>Solver</code></a> and <code>Mcsolver</code> modules.</p></aside><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Solver_intf/index.html#module-type-S">Sidekick_sat__.Solver_intf.S</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-St/index.html">St</a> : <a href="../Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-Th/index.html">Th</a> : <a href="../../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-proof">St.proof</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/Proof/index.html#type-lemma">Proof.lemma</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-theory">theory</a><span class="keyword"> = </span><a href="Make/argument-2-Th/index.html#type-t">Th.t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__/Solver/module-type-S/Clause/index.html
new file mode 100644
index 00000000..bbbc9fc6
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver.S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <a href="../../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> array <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Make a clause from this array of SAT literals. The array's ownership is transferred to the clause, do not mutate it</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_atoms"><a href="#val-of_atoms" class="anchor"></a><code><span class="keyword">val </span>of_atoms : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/module-type-S/Formula/index.html b/sidekick/Sidekick_sat__/Solver/module-type-S/Formula/index.html
new file mode 100644
index 00000000..0dee04f8
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Solver.S.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/module-type-S/Lit/index.html b/sidekick/Sidekick_sat__/Solver/module-type-S/Lit/index.html
new file mode 100644
index 00000000..73df745c
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/module-type-S/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_sat__.Solver.S.Lit)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.S.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-lit">lit</a></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/module-type-S/Proof/Atom/index.html b/sidekick/Sidekick_sat__/Solver/module-type-S/Proof/Atom/index.html
new file mode 100644
index 00000000..f09a133d
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/module-type-S/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Solver.S.Proof.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.S.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/module-type-S/Proof/Clause/index.html b/sidekick/Sidekick_sat__/Solver/module-type-S/Proof/Clause/index.html
new file mode 100644
index 00000000..ed60e90f
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/module-type-S/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver.S.Proof.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.S.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/module-type-S/Proof/index.html b/sidekick/Sidekick_sat__/Solver/module-type-S/Proof/index.html
new file mode 100644
index 00000000..294bc314
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/module-type-S/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat__.Solver.S.Proof)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver.S.Proof</code></h1></header><div class="doc"><p>A module to manipulate proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver/module-type-S/index.html b/sidekick/Sidekick_sat__/Solver/module-type-S/index.html
new file mode 100644
index 00000000..c2f15bc2
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__.Solver.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__.Solver.S</code></h1></header><div class="doc"><p>Safe external interface of solvers.</p></div><section><header><h2 id="internal-modules"><a href="#internal-modules" class="anchor"></a>Internal modules</h2><p>These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.</p></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>user formulas</p></dd></dl><dl><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code></code></dt><dd><p>SAT solver literals</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>SAT solver clauses</p></dd></dl><dl><dt id="type-theory"><a href="#type-theory" class="anchor"></a><code><span class="keyword">type </span>theory</code><code></code><code></code></dt><dd><p>user theory</p></dd></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <a href="../../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../../Sidekick_sat/Res/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="index.html#type-clause">clause</a></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Main solver type, containing all state for solving.</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create new solver</p><dl><dt>parameter size</dt><dd><p>the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.</p></dd></dl></dd></dl></section><section><header><h2 id="types"><a href="#types" class="anchor"></a>Types</h2></header><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atoms given by the module argument for formulas. An atom is a user-defined atomic formula whose truth value is picked by Msat.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="index.html#type-formula">formula</a> <a href="../../Solver_intf/index.html#type-sat_state">Sidekick_sat__.Solver_intf.sat_state</a></code></td><td class="doc"><p>Returned when the solver reaches SAT, with a model</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span>(<a href="index.html#type-clause">clause</a>, <a href="Proof/index.html#type-proof">Proof.proof</a>) <a href="../../Solver_intf/index.html#type-unsat_state">Sidekick_sat__.Solver_intf.unsat_state</a></code></td><td class="doc"><p>Returned when the solver reaches UNSAT, with a proof</p></td></tr></table><code></code></dt><dd><p>Result type for the solver</p></dd></dl><dl><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dd><p>Exception raised by the evaluating functions when a literal has not yet been assigned a value.</p></dd></dl></section><section><header><h2 id="base-operations"><a href="#base-operations" class="anchor"></a>Base operations</h2></header><dl><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-theory">theory</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : ?&#8288;permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking (default true)</p></dd></dl></dd></dl><dl><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Lower level addition of clauses. See <a href="Clause/index.html"><code>Clause</code></a> to create clauses.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;assumptions:<a href="index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dd><p>Try and solves the current set of clauses.</p><dl><dt>parameter assumptions</dt><dd><p>additional atomic assumptions to be temporarily added. The assumptions are just used for this call to <code>solve</code>, they are not saved in the solver's state.</p></dd></dl></dd></dl><dl><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a new atom (i.e propositional formula) to the solver. This formula will be decided on at some point during solving, whether it appears in clauses or not.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="Proof/index.html#type-proof">Proof.proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat core of a given proof, ie a subset of all the added clauses that is sufficient to establish unsatisfiability.</p></dd></dl><dl><dt id="val-true_at_level0"><a href="#val-true_at_level0" class="anchor"></a><code><span class="keyword">val </span>true_at_level0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p><code>true_at_level0 a</code> returns <code>true</code> if <code>a</code> was proved at level0, i.e. it must hold in all models</p></dd></dl><dl><dt id="val-get_tag"><a href="#val-get_tag" class="anchor"></a><code><span class="keyword">val </span>get_tag : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> int option</code></dt><dd><p>Recover tag from a clause, if any</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Push a new save point. Clauses added after this call to <code>push</code> will be added as normal, but the corresponding call to <code>pop</code> will remove these clauses.</p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Return to last save point, discarding clauses added since last call to <code>push</code></p></dd></dl><dl><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="Proof/index.html#type-lemma">Proof.lemma</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a></code></dt><dd><p>Obtain actions</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <a href="../../Solver_intf/index.html#type-export">Sidekick_sat__.Solver_intf.export</a></code></dt></dl></section><section><header><h2 id="re-export-some-functions"><a href="#re-export-some-functions" class="anchor"></a>Re-export some functions</h2></header><dl><dt id="type-solver"><a href="#type-solver" class="anchor"></a><code><span class="keyword">type </span>solver</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_intf/index.html b/sidekick/Sidekick_sat__/Solver_intf/index.html
new file mode 100644
index 00000000..027a5048
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Solver_intf (sidekick.Sidekick_sat__.Solver_intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_intf</code></h1></header><aside><p>Interface for Solvers</p><p>This modules defines the safe external interface for solvers. Solvers that implements this interface can be obtained using the <code>Make</code> functor in <a href="../Solver/index.html"><code>Solver</code></a> or <code>Mcsolver</code>.</p></aside><dl><dt id="type-sat_state"><a href="#type-sat_state" class="anchor"></a><code><span class="keyword">type </span>'form sat_state</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-sat_state.Sat_state" class="anchored"><td class="def constructor"><a href="#type-sat_state.Sat_state" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat_state</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-sat_state.eval" class="anchored"><td class="def field"><a href="#type-sat_state.eval" class="anchor"></a><code>eval : <span class="type-var">'form</span> <span>&#8209;&gt;</span> bool;</code></td><td class="doc"><p>Returns the valuation of a formula in the current state of the sat solver.</p><dl><dt>raises UndecidedLit</dt><dd><p>if the literal is not decided</p></dd></dl></td></tr><tr id="type-sat_state.eval_level" class="anchored"><td class="def field"><a href="#type-sat_state.eval_level" class="anchor"></a><code>eval_level : <span class="type-var">'form</span> <span>&#8209;&gt;</span> bool<span class="keyword"> * </span>int;</code></td><td class="doc"><p>Return the current assignement of the literals, as well as its decision level. If the level is 0, then it is necessary for the atom to have this value; otherwise it is due to choices that can potentially be backtracked.</p><dl><dt>raises UndecidedLit</dt><dd><p>if the literal is not decided</p></dd></dl></td></tr><tr id="type-sat_state.iter_trail" class="anchored"><td class="def field"><a href="#type-sat_state.iter_trail" class="anchor"></a><code>iter_trail : (<span class="type-var">'form</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Iter through the formulas and terms in order of decision/propagation (starting from the first propagation, to the last propagation).</p></td></tr></table><code>}</code><code></code></td><td class="doc"><p>The type of values returned when the solver reaches a SAT state.</p></td></tr></table><code></code></dt><dt id="type-unsat_state"><a href="#type-unsat_state" class="anchor"></a><code><span class="keyword">type </span>('clause, 'proof) unsat_state</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-unsat_state.Unsat_state" class="anchored"><td class="def constructor"><a href="#type-unsat_state.Unsat_state" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat_state</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-unsat_state.unsat_conflict" class="anchored"><td class="def field"><a href="#type-unsat_state.unsat_conflict" class="anchor"></a><code>unsat_conflict : unit <span>&#8209;&gt;</span> <span class="type-var">'clause</span>;</code></td><td class="doc"><p>Returns the unsat clause found at the toplevel</p></td></tr><tr id="type-unsat_state.get_proof" class="anchored"><td class="def field"><a href="#type-unsat_state.get_proof" class="anchor"></a><code>get_proof : unit <span>&#8209;&gt;</span> <span class="type-var">'proof</span>;</code></td><td class="doc"><p>returns a persistent proof of the empty clause from the Unsat result.</p></td></tr></table><code>}</code><code></code></td><td class="doc"><p>The type of values returned when the solver reaches an UNSAT state.</p></td></tr></table><code></code></dt><dt id="type-export"><a href="#type-export" class="anchor"></a><code><span class="keyword">type </span>'clause export</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-export.hyps" class="anchored"><td class="def field"><a href="#type-export.hyps" class="anchor"></a><code>hyps : <span class="type-var">'clause</span> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-export.history" class="anchored"><td class="def field"><a href="#type-export.history" class="anchor"></a><code>history : <span class="type-var">'clause</span> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-export.local" class="anchored"><td class="def field"><a href="#type-export.local" class="anchor"></a><code>local : <span class="type-var">'clause</span> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr></table><code>}</code><code></code></dt><dd><p>Export internal state</p></dd></dl><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Clause/index.html
new file mode 100644
index 00000000..25d312f2
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver_intf.S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_intf.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <a href="../../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> array <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Make a clause from this array of SAT literals. The array's ownership is transferred to the clause, do not mutate it</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_atoms"><a href="#val-of_atoms" class="anchor"></a><code><span class="keyword">val </span>of_atoms : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Formula/index.html b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Formula/index.html
new file mode 100644
index 00000000..e60d828c
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Solver_intf.S.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_intf.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Lit/index.html b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Lit/index.html
new file mode 100644
index 00000000..2a5978b1
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_sat__.Solver_intf.S.Lit)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_intf.S.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-lit">lit</a></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/Atom/index.html b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/Atom/index.html
new file mode 100644
index 00000000..b96f5197
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Solver_intf.S.Proof.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_intf.S.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/Clause/index.html b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/Clause/index.html
new file mode 100644
index 00000000..32c0ef4c
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver_intf.S.Proof.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_intf.S.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/index.html b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/index.html
new file mode 100644
index 00000000..6c80d63d
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat__.Solver_intf.S.Proof)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_intf.S.Proof</code></h1></header><div class="doc"><p>A module to manipulate proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_intf/module-type-S/index.html b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/index.html
new file mode 100644
index 00000000..bf7d8877
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__.Solver_intf.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__.Solver_intf.S</code></h1></header><div class="doc"><p>The external interface implemented by safe solvers, such as the one created by the <a href="../../Solver/Make/index.html"><code>Solver.Make</code></a> and <span class="xref-unresolved" title="unresolved reference to &quot;Mcsolver.Make&quot;"><code>Mcsolver</code>.Make</span> functors.</p></div><section><header><h2 id="internal-modules"><a href="#internal-modules" class="anchor"></a>Internal modules</h2><p>These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.</p></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>user formulas</p></dd></dl><dl><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code></code></dt><dd><p>SAT solver literals</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>SAT solver clauses</p></dd></dl><dl><dt id="type-theory"><a href="#type-theory" class="anchor"></a><code><span class="keyword">type </span>theory</code><code></code><code></code></dt><dd><p>user theory</p></dd></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <a href="../../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../../Sidekick_sat/Res/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="index.html#type-clause">clause</a></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Main solver type, containing all state for solving.</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create new solver</p><dl><dt>parameter size</dt><dd><p>the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.</p></dd></dl></dd></dl></section><section><header><h2 id="types"><a href="#types" class="anchor"></a>Types</h2></header><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atoms given by the module argument for formulas. An atom is a user-defined atomic formula whose truth value is picked by Msat.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="index.html#type-formula">formula</a> <a href="../index.html#type-sat_state">sat_state</a></code></td><td class="doc"><p>Returned when the solver reaches SAT, with a model</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span>(<a href="index.html#type-clause">clause</a>, <a href="Proof/index.html#type-proof">Proof.proof</a>) <a href="../index.html#type-unsat_state">unsat_state</a></code></td><td class="doc"><p>Returned when the solver reaches UNSAT, with a proof</p></td></tr></table><code></code></dt><dd><p>Result type for the solver</p></dd></dl><dl><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dd><p>Exception raised by the evaluating functions when a literal has not yet been assigned a value.</p></dd></dl></section><section><header><h2 id="base-operations"><a href="#base-operations" class="anchor"></a>Base operations</h2></header><dl><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-theory">theory</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : ?&#8288;permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking (default true)</p></dd></dl></dd></dl><dl><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Lower level addition of clauses. See <a href="Clause/index.html"><code>Clause</code></a> to create clauses.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;assumptions:<a href="index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dd><p>Try and solves the current set of clauses.</p><dl><dt>parameter assumptions</dt><dd><p>additional atomic assumptions to be temporarily added. The assumptions are just used for this call to <code>solve</code>, they are not saved in the solver's state.</p></dd></dl></dd></dl><dl><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a new atom (i.e propositional formula) to the solver. This formula will be decided on at some point during solving, whether it appears in clauses or not.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="Proof/index.html#type-proof">Proof.proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat core of a given proof, ie a subset of all the added clauses that is sufficient to establish unsatisfiability.</p></dd></dl><dl><dt id="val-true_at_level0"><a href="#val-true_at_level0" class="anchor"></a><code><span class="keyword">val </span>true_at_level0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p><code>true_at_level0 a</code> returns <code>true</code> if <code>a</code> was proved at level0, i.e. it must hold in all models</p></dd></dl><dl><dt id="val-get_tag"><a href="#val-get_tag" class="anchor"></a><code><span class="keyword">val </span>get_tag : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> int option</code></dt><dd><p>Recover tag from a clause, if any</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Push a new save point. Clauses added after this call to <code>push</code> will be added as normal, but the corresponding call to <code>pop</code> will remove these clauses.</p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Return to last save point, discarding clauses added since last call to <code>push</code></p></dd></dl><dl><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="Proof/index.html#type-lemma">Proof.lemma</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a></code></dt><dd><p>Obtain actions</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <a href="../index.html#type-export">export</a></code></dt></dl></section><section><header><h2 id="re-export-some-functions"><a href="#re-export-some-functions" class="anchor"></a>Re-export some functions</h2></header><dl><dt id="type-solver"><a href="#type-solver" class="anchor"></a><code><span class="keyword">type </span>solver</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/Make/Atom/index.html b/sidekick/Sidekick_sat__/Solver_types/Make/Atom/index.html
new file mode 100644
index 00000000..7e0d0e88
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/Make/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Solver_types.Make.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.Make.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/Make/Clause/index.html b/sidekick/Sidekick_sat__/Solver_types/Make/Clause/index.html
new file mode 100644
index 00000000..f763ef8c
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/Make/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver_types.Make.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.Make.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/Make/Formula/index.html b/sidekick/Sidekick_sat__/Solver_types/Make/Formula/index.html
new file mode 100644
index 00000000..ed623739
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/Make/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Solver_types.Make.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.Make.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/Make/Var/index.html b/sidekick/Sidekick_sat__/Solver_types/Make/Var/index.html
new file mode 100644
index 00000000..db5dda42
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/Make/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__.Solver_types.Make.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.Make.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/Make/argument-1-E/Form/index.html b/sidekick/Sidekick_sat__/Solver_types/Make/argument-1-E/Form/index.html
new file mode 100644
index 00000000..a6ae5f14
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/Make/argument-1-E/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat__.Solver_types.Make.1-E.Form)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.Make.1-E.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/Make/argument-1-E/index.html b/sidekick/Sidekick_sat__/Solver_types/Make/argument-1-E/index.html
new file mode 100644
index 00000000..b7937593
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/Make/argument-1-E/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-E (sidekick.Sidekick_sat__.Solver_types.Make.1-E)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__.Solver_types.Make.1-E</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/Make/index.html b/sidekick/Sidekick_sat__/Solver_types/Make/index.html
new file mode 100644
index 00000000..aac84916
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat__.Solver_types.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.Make</code></h1></header><div class="doc"><p>Functor to instantiate the types of clauses for a solver.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-E/index.html">E</a> : <a href="../../../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="argument-1-E/index.html#type-formula">E.formula</a></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="argument-1-E/index.html#type-proof">E.proof</a></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/index.html b/sidekick/Sidekick_sat__/Solver_types/index.html
new file mode 100644
index 00000000..3d939b5f
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Solver_types (sidekick.Sidekick_sat__.Solver_types)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types</code></h1></header><aside><p>Internal types (implementation)</p><p>This modules actually implements the internal types used by the solver. Since mutation is heavily used in the solver, it is really, really, *really* discouraged to direclty use the functions in this module if you don't know the inner working of mSAT perfectly as even the simplest change can have dramatic effects on the solver.</p></aside><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../../Sidekick_sat/Solver_types_intf/index.html#module-type-S">Sidekick_sat.Solver_types_intf.S</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-E/index.html">E</a> : <a href="../../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="Make/argument-1-E/index.html#type-formula">E.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="Make/argument-1-E/index.html#type-proof">E.proof</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/module-type-S/Atom/index.html b/sidekick/Sidekick_sat__/Solver_types/module-type-S/Atom/index.html
new file mode 100644
index 00000000..64e7c8bc
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Solver_types.S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__/Solver_types/module-type-S/Clause/index.html
new file mode 100644
index 00000000..b67ca24d
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver_types.S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/module-type-S/Formula/index.html b/sidekick/Sidekick_sat__/Solver_types/module-type-S/Formula/index.html
new file mode 100644
index 00000000..87494ccc
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Solver_types.S.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/module-type-S/Var/index.html b/sidekick/Sidekick_sat__/Solver_types/module-type-S/Var/index.html
new file mode 100644
index 00000000..d16263a1
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/module-type-S/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__.Solver_types.S.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types.S.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types/module-type-S/index.html b/sidekick/Sidekick_sat__/Solver_types/module-type-S/index.html
new file mode 100644
index 00000000..02a6d030
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__.Solver_types.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__.Solver_types.S</code></h1></header><div class="doc"><p>Interface for the internal types.</p></div><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types_intf/C_fields/index.html b/sidekick/Sidekick_sat__/Solver_types_intf/C_fields/index.html
new file mode 100644
index 00000000..a009de24
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types_intf/C_fields/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>C_fields (sidekick.Sidekick_sat__.Solver_types_intf.C_fields)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types_intf.C_fields</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><span class="keyword">private </span>int</code><code></code></dt><dd><p>Generative type of bitfields. Each instantiation of the functor should create a new, incompatible type</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>Empty bitfields (all bits 0)</p></dd></dl><dl><dt id="type-field"><a href="#type-field" class="anchor"></a><code><span class="keyword">type </span>field</code><code></code><code></code></dt></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Get the value of this field</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Set the value of this field</p></dd></dl><dl><dt id="val-mk_field"><a href="#val-mk_field" class="anchor"></a><code><span class="keyword">val </span>mk_field : unit <span>&#8209;&gt;</span> <a href="index.html#type-field">field</a></code></dt><dd><p>Make a new field</p></dd></dl><dl><dt id="val-freeze"><a href="#val-freeze" class="anchor"></a><code><span class="keyword">val </span>freeze : unit <span>&#8209;&gt;</span> unit</code></dt><dd><p>Prevent new fields from being added. From now on, creating a field will raise Frozen</p></dd></dl><dl><dt id="val-total_width"><a href="#val-total_width" class="anchor"></a><code><span class="keyword">val </span>total_width : unit <span>&#8209;&gt;</span> int</code></dt><dd><p>Current width of the bitfield</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types_intf/Var_fields/index.html b/sidekick/Sidekick_sat__/Solver_types_intf/Var_fields/index.html
new file mode 100644
index 00000000..f628a060
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types_intf/Var_fields/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var_fields (sidekick.Sidekick_sat__.Solver_types_intf.Var_fields)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types_intf.Var_fields</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><span class="keyword">private </span>int</code><code></code></dt><dd><p>Generative type of bitfields. Each instantiation of the functor should create a new, incompatible type</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>Empty bitfields (all bits 0)</p></dd></dl><dl><dt id="type-field"><a href="#type-field" class="anchor"></a><code><span class="keyword">type </span>field</code><code></code><code></code></dt></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Get the value of this field</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Set the value of this field</p></dd></dl><dl><dt id="val-mk_field"><a href="#val-mk_field" class="anchor"></a><code><span class="keyword">val </span>mk_field : unit <span>&#8209;&gt;</span> <a href="index.html#type-field">field</a></code></dt><dd><p>Make a new field</p></dd></dl><dl><dt id="val-freeze"><a href="#val-freeze" class="anchor"></a><code><span class="keyword">val </span>freeze : unit <span>&#8209;&gt;</span> unit</code></dt><dd><p>Prevent new fields from being added. From now on, creating a field will raise Frozen</p></dd></dl><dl><dt id="val-total_width"><a href="#val-total_width" class="anchor"></a><code><span class="keyword">val </span>total_width : unit <span>&#8209;&gt;</span> int</code></dt><dd><p>Current width of the bitfield</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types_intf/index.html b/sidekick/Sidekick_sat__/Solver_types_intf/index.html
new file mode 100644
index 00000000..b851e704
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Solver_types_intf (sidekick.Sidekick_sat__.Solver_types_intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types_intf</code></h1></header><aside><p>Internal types (interface)</p><p>This modules defines the interface of most of the internal types used in the core solver.</p></aside><article id="module-Var_fields"><a href="#module-Var_fields" class="anchor"></a><code><span class="keyword">module </span><a href="Var_fields/index.html">Var_fields</a> : <a href="../../Sidekick_util__BitField/index.html#module-type-S">Sidekick_util__BitField.S</a></code></article><article id="module-C_fields"><a href="#module-C_fields" class="anchor"></a><code><span class="keyword">module </span><a href="C_fields/index.html">C_fields</a> : <a href="../../Sidekick_util__BitField/index.html#module-type-S">Sidekick_util__BitField.S</a></code></article><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Atom/index.html b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Atom/index.html
new file mode 100644
index 00000000..3884b976
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__.Solver_types_intf.S.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types_intf.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Clause/index.html
new file mode 100644
index 00000000..07b8c067
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__.Solver_types_intf.S.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types_intf.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Formula/index.html b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Formula/index.html
new file mode 100644
index 00000000..c03f2450
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__.Solver_types_intf.S.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types_intf.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Var/index.html b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Var/index.html
new file mode 100644
index 00000000..9a09d06a
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__.Solver_types_intf.S.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Solver_types_intf.S.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/index.html b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/index.html
new file mode 100644
index 00000000..fafdd646
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Solver_types_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__.Solver_types_intf.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__.Solver_types_intf.S</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../Var_fields/index.html#type-t">Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../C_fields/index.html#type-t">C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Theory_intf/index.html b/sidekick/Sidekick_sat__/Theory_intf/index.html
new file mode 100644
index 00000000..3cd70cc4
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Theory_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Theory_intf (sidekick.Sidekick_sat__.Theory_intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Theory_intf</code></h1></header><aside><p>SMT Theory</p><p>This module defines what a theory must implement in order to be used in an SMT solver.</p></aside><dl><dt id="type-negated"><a href="#type-negated" class="anchor"></a><code><span class="keyword">type </span>negated</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-negated.Negated" class="anchored"><td class="def constructor"><a href="#type-negated.Negated" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Negated</span></code></td><td class="doc"><p>changed sign</p></td></tr><tr id="type-negated.Same_sign" class="anchored"><td class="def constructor"><a href="#type-negated.Same_sign" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Same_sign</span></code></td><td class="doc"><p>kept sign</p></td></tr></table><code></code></dt><dd><p>This type is used during the normalisation of formulas. See <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.norm&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.norm</span> for more details.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>('formula, 'proof) res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span></code></td><td class="doc"><p>The current set of assumptions is satisfiable.</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span><span class="type-var">'formula</span> list<span class="keyword"> * </span><span class="type-var">'proof</span></code></td><td class="doc"><p>The current set of assumptions is *NOT* satisfiable, and here is a theory tautology (with its proof), for which every litteral is false under the current assumptions.</p></td></tr></table><code></code></dt><dd><p>Type returned by the theory. Formulas in the unsat clause must come from the current set of assumptions, i.e must have been encountered in a slice.</p></dd></dl><dl><dt id="type-actions"><a href="#type-actions" class="anchor"></a><code><span class="keyword">type </span>('form, 'proof) actions</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-actions.Actions" class="anchored"><td class="def constructor"><a href="#type-actions.Actions" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Actions</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-actions.push_persistent" class="anchored"><td class="def field"><a href="#type-actions.push_persistent" class="anchor"></a><code>push_persistent : <span class="type-var">'form</span> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Allows to add a persistent clause to the solver.</p></td></tr><tr id="type-actions.push_local" class="anchored"><td class="def field"><a href="#type-actions.push_local" class="anchor"></a><code>push_local : <span class="type-var">'form</span> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Allows to add a local clause to the solver. The clause will be removed after backtracking.</p></td></tr><tr id="type-actions.on_backtrack" class="anchored"><td class="def field"><a href="#type-actions.on_backtrack" class="anchor"></a><code>on_backtrack : (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p><code>on_backtrack f</code> calls <code>f</code> when the main solver backtracks</p></td></tr><tr id="type-actions.propagate" class="anchored"><td class="def field"><a href="#type-actions.propagate" class="anchor"></a><code>propagate : <span class="type-var">'form</span> <span>&#8209;&gt;</span> <span class="type-var">'form</span> list <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p><code>propagate lit causes proof</code> informs the solver to propagate <code>lit</code>, with the reason that the clause <code>causes =&gt; lit</code> is a theory tautology. It is faster than pushing the associated clause but the clause will not be remembered by the sat solver, i.e it will not be used by the solver to do boolean propagation.</p></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dd><p>Actions given to the theory during initialization, to be used at any time</p></dd></dl><dl><dt id="type-slice_actions"><a href="#type-slice_actions" class="anchor"></a><code><span class="keyword">type </span>('form, 'proof) slice_actions</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-slice_actions.Slice_acts" class="anchored"><td class="def constructor"><a href="#type-slice_actions.Slice_acts" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Slice_acts</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-slice_actions.slice_iter" class="anchored"><td class="def field"><a href="#type-slice_actions.slice_iter" class="anchor"></a><code>slice_iter : (<span class="type-var">'form</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>iterate on the slice of the trail</p></td></tr></table><code>}</code><code></code></td><td class="doc"><p>The type for a slice. Slices are some kind of view of the current propagation queue. They allow to look at the propagated literals, and to add new clauses to the solver.</p></td></tr></table><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Theory_intf/module-type-S/Form/index.html b/sidekick/Sidekick_sat__/Theory_intf/module-type-S/Form/index.html
new file mode 100644
index 00000000..74389cf8
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Theory_intf/module-type-S/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat__.Theory_intf.S.Form)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__.Theory_intf.S.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../index.html#type-negated">negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/Theory_intf/module-type-S/index.html b/sidekick/Sidekick_sat__/Theory_intf/module-type-S/index.html
new file mode 100644
index 00000000..74f8ca2c
--- /dev/null
+++ b/sidekick/Sidekick_sat__/Theory_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__.Theory_intf.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__.Theory_intf.S</code></h1></header><div class="doc"><h2 id="signature-for-theories-to-be-given-to-the-solver."><a href="#signature-for-theories-to-be-given-to-the-solver." class="anchor"></a>Signature for theories to be given to the Solver.</h2></div><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-actions">actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-slice_actions">slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-res">res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-slice_actions">slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-res">res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__/index.html b/sidekick/Sidekick_sat__/index.html
new file mode 100644
index 00000000..62f61228
--- /dev/null
+++ b/sidekick/Sidekick_sat__/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat__ (sidekick.Sidekick_sat__)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__</code></h1></header><article id="module-Internal"><a href="#module-Internal" class="anchor"></a><code><span class="keyword">module </span><a href="Internal/index.html">Internal</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Res"><a href="#module-Res" class="anchor"></a><code><span class="keyword">module </span><a href="Res/index.html">Res</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Res_intf"><a href="#module-Res_intf" class="anchor"></a><code><span class="keyword">module </span><a href="Res_intf/index.html">Res_intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Sidekick_sat"><a href="#module-Sidekick_sat" class="anchor"></a><code><span class="keyword">module </span>Sidekick_sat = <a href="../Sidekick_sat/index.html">Sidekick_sat</a></code></article><article id="module-Solver"><a href="#module-Solver" class="anchor"></a><code><span class="keyword">module </span><a href="Solver/index.html">Solver</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Solver_intf"><a href="#module-Solver_intf" class="anchor"></a><code><span class="keyword">module </span><a href="Solver_intf/index.html">Solver_intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Solver_types"><a href="#module-Solver_types" class="anchor"></a><code><span class="keyword">module </span><a href="Solver_types/index.html">Solver_types</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Solver_types_intf"><a href="#module-Solver_types_intf" class="anchor"></a><code><span class="keyword">module </span><a href="Solver_types_intf/index.html">Solver_types_intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Theory_intf"><a href="#module-Theory_intf" class="anchor"></a><code><span class="keyword">module </span><a href="Theory_intf/index.html">Theory_intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/.jbuilder-keep b/sidekick/Sidekick_sat__Internal/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat__Internal/Make/H/index.html b/sidekick/Sidekick_sat__Internal/Make/H/index.html
new file mode 100644
index 00000000..2bf03a88
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/H/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>H (sidekick.Sidekick_sat__Internal.Make.H)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.H</code></h1></header><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-var">St.var</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-decrease"><a href="#val-decrease" class="anchor"></a><code><span class="keyword">val </span>decrease : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-insert"><a href="#val-insert" class="anchor"></a><code><span class="keyword">val </span>insert : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove_min"><a href="#val-remove_min" class="anchor"></a><code><span class="keyword">val </span>remove_min : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/Atom/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/Atom/index.html
new file mode 100644
index 00000000..a28ad0d2
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Internal.Make.Proof.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/Clause/Tbl/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/Clause/Tbl/index.html
new file mode 100644
index 00000000..55552e9c
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/Clause/Tbl/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tbl (sidekick.Sidekick_sat__Internal.Make.Proof.Clause.Tbl)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.Clause.Tbl</code></h1></header><dl><dt id="type-key"><a href="#type-key" class="anchor"></a><code><span class="keyword">type </span>key</code><code><span class="keyword"> = </span><a href="../index.html#type-t">t</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../../../../../Sidekick_sat__Res/Make/Clause/index.html#module-Tbl">Sidekick_sat__Res.Make(St).Clause.Tbl</a>.t</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-reset"><a href="#val-reset" class="anchor"></a><code><span class="keyword">val </span>reset : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_all"><a href="#val-find_all" class="anchor"></a><code><span class="keyword">val </span>find_all : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-replace"><a href="#val-replace" class="anchor"></a><code><span class="keyword">val </span>replace : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter_map_inplace"><a href="#val-filter_map_inplace" class="anchor"></a><code><span class="keyword">val </span>filter_map_inplace : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-stats"><a href="#val-stats" class="anchor"></a><code><span class="keyword">val </span>stats : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> Hashtbl.statistics</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/Clause/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/Clause/index.html
new file mode 100644
index 00000000..d733f061
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Internal.Make.Proof.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span><a href="Tbl/index.html">Tbl</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/St/Atom/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Atom/index.html
new file mode 100644
index 00000000..30320154
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Internal.Make.Proof.St.Atom)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/St/Clause/Tbl/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Clause/Tbl/index.html
new file mode 100644
index 00000000..c8d7a755
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Clause/Tbl/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tbl (sidekick.Sidekick_sat__Internal.Make.Proof.St.Clause.Tbl)</title><link rel="stylesheet" href="../../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.St.Clause.Tbl</code></h1></header><dl><dt id="type-key"><a href="#type-key" class="anchor"></a><code><span class="keyword">type </span>key</code><code><span class="keyword"> = </span><a href="../index.html#type-t">t</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../../../../argument-1-St/Clause/index.html#module-Tbl">St.Clause.Tbl</a>.t</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-reset"><a href="#val-reset" class="anchor"></a><code><span class="keyword">val </span>reset : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_all"><a href="#val-find_all" class="anchor"></a><code><span class="keyword">val </span>find_all : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-replace"><a href="#val-replace" class="anchor"></a><code><span class="keyword">val </span>replace : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter_map_inplace"><a href="#val-filter_map_inplace" class="anchor"></a><code><span class="keyword">val </span>filter_map_inplace : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-stats"><a href="#val-stats" class="anchor"></a><code><span class="keyword">val </span>stats : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> Hashtbl.statistics</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/St/Clause/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Clause/index.html
new file mode 100644
index 00000000..a5482791
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Internal.Make.Proof.St.Clause)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span><a href="Tbl/index.html">Tbl</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/St/Formula/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Formula/index.html
new file mode 100644
index 00000000..cd510782
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Internal.Make.Proof.St.Formula)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/St/Var/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Var/index.html
new file mode 100644
index 00000000..9d111eee
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__Internal.Make.Proof.St.Var)</title><link rel="stylesheet" href="../../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/St/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/St/index.html
new file mode 100644
index 00000000..0445dab2
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>St (sidekick.Sidekick_sat__Internal.Make.Proof.St)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.St</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-t">St.t</a></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Big | `Small | `Tiny ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-var">St.var</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-atom">St.atom</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-clause">St.clause</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-reason">St.reason</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td></tr></table><code></code></dt><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code><span class="keyword"> = </span><a href="../../argument-1-St/index.html#type-premise">St.premise</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td></tr></table><code></code></dt></dl><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt></dl><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/Tbl/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/Tbl/index.html
new file mode 100644
index 00000000..e7b42948
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/Tbl/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tbl (sidekick.Sidekick_sat__Internal.Make.Proof.Tbl)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof.Tbl</code></h1></header><dl><dt id="type-key"><a href="#type-key" class="anchor"></a><code><span class="keyword">type </span>key</code><code><span class="keyword"> = </span><a href="../index.html#type-proof">proof</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../../../../Sidekick_sat__Res/Make/index.html#module-Tbl">Sidekick_sat__Res.Make(St).Tbl</a>.t</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-reset"><a href="#val-reset" class="anchor"></a><code><span class="keyword">val </span>reset : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_all"><a href="#val-find_all" class="anchor"></a><code><span class="keyword">val </span>find_all : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-replace"><a href="#val-replace" class="anchor"></a><code><span class="keyword">val </span>replace : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-filter_map_inplace"><a href="#val-filter_map_inplace" class="anchor"></a><code><span class="keyword">val </span>filter_map_inplace : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-key">key</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-stats"><a href="#val-stats" class="anchor"></a><code><span class="keyword">val </span>stats : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> Hashtbl.statistics</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/Proof/index.html b/sidekick/Sidekick_sat__Internal/Make/Proof/index.html
new file mode 100644
index 00000000..be5c2bbe
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat__Internal.Make.Proof)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.Proof</code></h1></header><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span><a href="St/index.html">St</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="../../../Sidekick_sat__Res/Make/index.html#type-proof">Sidekick_sat__Res.Make(St).proof</a></code><code></code></dt><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code><span class="keyword"> = </span><a href="../../../Sidekick_sat__Res/Make/index.html#type-proof_node">Sidekick_sat__Res.Make(St).proof_node</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code><span class="keyword"> = </span><a href="../../../Sidekick_sat__Res/Make/index.html#type-step">Sidekick_sat__Res.Make(St).step</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td></tr></table><code></code></dt></dl><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span><a href="Tbl/index.html">Tbl</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Atom/index.html b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Atom/index.html
new file mode 100644
index 00000000..4c59613e
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Internal.Make.1-St.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.1-St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Clause/index.html b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Clause/index.html
new file mode 100644
index 00000000..2026478b
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Internal.Make.1-St.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.1-St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Formula/index.html b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Formula/index.html
new file mode 100644
index 00000000..a2a3f7a2
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Internal.Make.1-St.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.1-St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Var/index.html b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Var/index.html
new file mode 100644
index 00000000..da2a223c
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__Internal.Make.1-St.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.1-St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/argument-1-St/index.html b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/index.html
new file mode 100644
index 00000000..8ff275af
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/argument-1-St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-St (sidekick.Sidekick_sat__Internal.Make.1-St)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__Internal.Make.1-St</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/argument-2-Th/Form/index.html b/sidekick/Sidekick_sat__Internal/Make/argument-2-Th/Form/index.html
new file mode 100644
index 00000000..bc97e3d9
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/argument-2-Th/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat__Internal.Make.2-Th.Form)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make.2-Th.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/argument-2-Th/index.html b/sidekick/Sidekick_sat__Internal/Make/argument-2-Th/index.html
new file mode 100644
index 00000000..da22ea50
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/argument-2-Th/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-Th (sidekick.Sidekick_sat__Internal.Make.2-Th)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__Internal.Make.2-Th</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-formula">St.formula</a></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-proof">St.proof</a></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/Make/index.html b/sidekick/Sidekick_sat__Internal/Make/index.html
new file mode 100644
index 00000000..cddb6821
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat__Internal.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal.Make</code></h1></header><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-Th/index.html">Th</a> : <a href="../../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-Th/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-Th/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-proof">St.proof</a></code><code><a href="argument-1-St/index.html">St</a> : <a href="../../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></dl><h3 class="heading">Signature</h3><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-H"><a href="#module-H" class="anchor"></a><code><span class="keyword">module </span><a href="H/index.html">H</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="exception-Sat"><a href="#exception-Sat" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Sat</span></code></dt><dt id="exception-Unsat"><a href="#exception-Unsat" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Unsat</span></code></dt><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dt id="exception-Restart"><a href="#exception-Restart" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Restart</span></code></dt><dt id="exception-Conflict"><a href="#exception-Conflict" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Conflict</span><span class="keyword"> of </span><a href="argument-1-St/index.html#type-clause">St.clause</a></code></dt></dl><dl><dt id="val-var_decay"><a href="#val-var_decay" class="anchor"></a><code><span class="keyword">val </span>var_decay : float</code></dt><dt id="val-clause_decay"><a href="#val-clause_decay" class="anchor"></a><code><span class="keyword">val </span>clause_decay : float</code></dt><dt id="val-restart_first"><a href="#val-restart_first" class="anchor"></a><code><span class="keyword">val </span>restart_first : int</code></dt><dt id="val-learntsize_factor"><a href="#val-learntsize_factor" class="anchor"></a><code><span class="keyword">val </span>learntsize_factor : float</code></dt><dt id="val-restart_inc"><a href="#val-restart_inc" class="anchor"></a><code><span class="keyword">val </span>restart_inc : float</code></dt><dt id="val-learntsize_inc"><a href="#val-learntsize_inc" class="anchor"></a><code><span class="keyword">val </span>learntsize_inc : float</code></dt></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.st" class="anchored"><td class="def field"><a href="#type-t.st" class="anchor"></a><code>st : <a href="argument-1-St/index.html#type-t">St.t</a>;</code></td></tr><tr id="type-t.th" class="anchored"><td class="def field"><a href="#type-t.th" class="anchor"></a><code>th : <a href="argument-2-Th/index.html#type-t">Th.t</a> lazy_t;</code></td></tr><tr id="type-t.clauses_hyps" class="anchored"><td class="def field"><a href="#type-t.clauses_hyps" class="anchor"></a><code>clauses_hyps : <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.clauses_learnt" class="anchored"><td class="def field"><a href="#type-t.clauses_learnt" class="anchor"></a><code>clauses_learnt : <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.clauses_temp" class="anchored"><td class="def field"><a href="#type-t.clauses_temp" class="anchor"></a><code>clauses_temp : <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.unsat_conflict" class="anchored"><td class="def field"><a href="#type-t.unsat_conflict" class="anchor"></a><code><span class="keyword">mutable </span>unsat_conflict : <a href="argument-1-St/index.html#type-clause">St.clause</a> option;</code></td></tr><tr id="type-t.next_decision" class="anchored"><td class="def field"><a href="#type-t.next_decision" class="anchor"></a><code><span class="keyword">mutable </span>next_decision : <a href="argument-1-St/index.html#type-atom">St.atom</a> option;</code></td></tr><tr id="type-t.trail" class="anchored"><td class="def field"><a href="#type-t.trail" class="anchor"></a><code>trail : <a href="argument-1-St/index.html#type-atom">St.atom</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.elt_levels" class="anchored"><td class="def field"><a href="#type-t.elt_levels" class="anchor"></a><code>elt_levels : int <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.user_levels" class="anchored"><td class="def field"><a href="#type-t.user_levels" class="anchor"></a><code>user_levels : int <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.backtrack_levels" class="anchored"><td class="def field"><a href="#type-t.backtrack_levels" class="anchor"></a><code>backtrack_levels : int <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-t.backtrack" class="anchored"><td class="def field"><a href="#type-t.backtrack" class="anchor"></a><code>backtrack : (unit <span>&#8209;&gt;</span> unit) <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>Actions to call when backtracking</p></td></tr><tr id="type-t.to_redo_after_backtrack" class="anchored"><td class="def field"><a href="#type-t.to_redo_after_backtrack" class="anchor"></a><code>to_redo_after_backtrack : (unit <span>&#8209;&gt;</span> unit) <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>Actions to re-do after backtracking</p></td></tr><tr id="type-t.th_head" class="anchored"><td class="def field"><a href="#type-t.th_head" class="anchor"></a><code><span class="keyword">mutable </span>th_head : int;</code></td></tr><tr id="type-t.elt_head" class="anchored"><td class="def field"><a href="#type-t.elt_head" class="anchor"></a><code><span class="keyword">mutable </span>elt_head : int;</code></td></tr><tr id="type-t.order" class="anchored"><td class="def field"><a href="#type-t.order" class="anchor"></a><code>order : <a href="H/index.html#type-t">H.t</a>;</code></td></tr><tr id="type-t.var_incr" class="anchored"><td class="def field"><a href="#type-t.var_incr" class="anchor"></a><code><span class="keyword">mutable </span>var_incr : float;</code></td></tr><tr id="type-t.clause_incr" class="anchored"><td class="def field"><a href="#type-t.clause_incr" class="anchor"></a><code><span class="keyword">mutable </span>clause_incr : float;</code></td></tr><tr id="type-t.to_add" class="anchored"><td class="def field"><a href="#type-t.to_add" class="anchor"></a><code>to_add : (bool<span class="keyword"> * </span><a href="argument-1-St/index.html#type-clause">St.clause</a>) CCVector.vector;</code></td></tr><tr id="type-t.dirty" class="anchored"><td class="def field"><a href="#type-t.dirty" class="anchor"></a><code><span class="keyword">mutable </span>dirty : bool;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-create_"><a href="#val-create_" class="anchor"></a><code><span class="keyword">val </span>create_ : st:<a href="argument-1-St/index.html#type-t">St.t</a> <span>&#8209;&gt;</span> size_trail:int <span>&#8209;&gt;</span> size_lvl:int <span>&#8209;&gt;</span> <a href="argument-2-Th/index.html#type-t">Th.t</a> lazy_t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-2-Th/index.html#type-t">Th.t</a></code></dt><dt id="val-at_level_0"><a href="#val-at_level_0" class="anchor"></a><code><span class="keyword">val </span>at_level_0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-on_backtrack"><a href="#val-on_backtrack" class="anchor"></a><code><span class="keyword">val </span>on_backtrack : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dt id="val-st"><a href="#val-st" class="anchor"></a><code><span class="keyword">val </span>st : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-t">St.t</a></code></dt><dt id="val-nb_clauses"><a href="#val-nb_clauses" class="anchor"></a><code><span class="keyword">val </span>nb_clauses : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-decision_level"><a href="#val-decision_level" class="anchor"></a><code><span class="keyword">val </span>decision_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-base_level"><a href="#val-base_level" class="anchor"></a><code><span class="keyword">val </span>base_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-redo_down_to_level_0"><a href="#val-redo_down_to_level_0" class="anchor"></a><code><span class="keyword">val </span>redo_down_to_level_0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dt id="val-to_float"><a href="#val-to_float" class="anchor"></a><code><span class="keyword">val </span>to_float : int <span>&#8209;&gt;</span> float</code></dt><dt id="val-to_int"><a href="#val-to_int" class="anchor"></a><code><span class="keyword">val </span>to_int : float <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_unsat"><a href="#val-is_unsat" class="anchor"></a><code><span class="keyword">val </span>is_unsat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-insert_var_order"><a href="#val-insert_var_order" class="anchor"></a><code><span class="keyword">val </span>insert_var_order : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-var">St.var</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a></code></dt><dt id="val-var_decay_activity"><a href="#val-var_decay_activity" class="anchor"></a><code><span class="keyword">val </span>var_decay_activity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-clause_decay_activity"><a href="#val-clause_decay_activity" class="anchor"></a><code><span class="keyword">val </span>clause_decay_activity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-var_bump_activity"><a href="#val-var_bump_activity" class="anchor"></a><code><span class="keyword">val </span>var_bump_activity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="H/index.html#type-elt">H.elt</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-clause_bump_activity"><a href="#val-clause_bump_activity" class="anchor"></a><code><span class="keyword">val </span>clause_bump_activity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt></dl><dl><dt id="exception-Trivial"><a href="#exception-Trivial" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Trivial</span></code></dt></dl><dl><dt id="val-arr_to_list"><a href="#val-arr_to_list" class="anchor"></a><code><span class="keyword">val </span>arr_to_list : <span class="type-var">'a</span> array <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-eliminate_duplicates"><a href="#val-eliminate_duplicates" class="anchor"></a><code><span class="keyword">val </span>eliminate_duplicates : <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a></code></dt><dt id="val-partition"><a href="#val-partition" class="anchor"></a><code><span class="keyword">val </span>partition : <a href="argument-1-St/index.html#type-atom">St.atom</a> array <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> list<span class="keyword"> * </span><a href="argument-1-St/index.html#type-clause">St.clause</a> list</code></dt><dt id="val-new_decision_level"><a href="#val-new_decision_level" class="anchor"></a><code><span class="keyword">val </span>new_decision_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-attach_clause"><a href="#val-attach_clause" class="anchor"></a><code><span class="keyword">val </span>attach_clause : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-backtrack_down_to"><a href="#val-backtrack_down_to" class="anchor"></a><code><span class="keyword">val </span>backtrack_down_to : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-cancel_until"><a href="#val-cancel_until" class="anchor"></a><code><span class="keyword">val </span>cancel_until : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-report_unsat"><a href="#val-report_unsat" class="anchor"></a><code><span class="keyword">val </span>report_unsat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-simpl_reason"><a href="#val-simpl_reason" class="anchor"></a><code><span class="keyword">val </span>simpl_reason : <a href="argument-1-St/index.html#type-reason">St.reason</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-reason">St.reason</a></code></dt><dt id="val-enqueue_bool"><a href="#val-enqueue_bool" class="anchor"></a><code><span class="keyword">val </span>enqueue_bool : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Atom/index.html#type-t">St.Atom.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-reason">St.reason</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-swap_arr"><a href="#val-swap_arr" class="anchor"></a><code><span class="keyword">val </span>swap_arr : <span class="type-var">'a</span> array <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-put_high_level_atoms_first"><a href="#val-put_high_level_atoms_first" class="anchor"></a><code><span class="keyword">val </span>put_high_level_atoms_first : <a href="argument-1-St/index.html#type-atom">St.atom</a> array <span>&#8209;&gt;</span> unit</code></dt><dt id="val-backtrack_lvl"><a href="#val-backtrack_lvl" class="anchor"></a><code><span class="keyword">val </span>backtrack_lvl : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> list <span>&#8209;&gt;</span> int<span class="keyword"> * </span>bool</code></dt></dl><dl><dt id="type-conflict_res"><a href="#type-conflict_res" class="anchor"></a><code><span class="keyword">type </span>conflict_res</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-conflict_res.cr_backtrack_lvl" class="anchored"><td class="def field"><a href="#type-conflict_res.cr_backtrack_lvl" class="anchor"></a><code>cr_backtrack_lvl : int;</code></td></tr><tr id="type-conflict_res.cr_learnt" class="anchored"><td class="def field"><a href="#type-conflict_res.cr_learnt" class="anchor"></a><code>cr_learnt : <a href="argument-1-St/index.html#type-atom">St.atom</a> list;</code></td></tr><tr id="type-conflict_res.cr_history" class="anchored"><td class="def field"><a href="#type-conflict_res.cr_history" class="anchor"></a><code>cr_history : <a href="argument-1-St/index.html#type-clause">St.clause</a> list;</code></td></tr><tr id="type-conflict_res.cr_is_uip" class="anchored"><td class="def field"><a href="#type-conflict_res.cr_is_uip" class="anchor"></a><code>cr_is_uip : bool;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-get_atom"><a href="#val-get_atom" class="anchor"></a><code><span class="keyword">val </span>get_atom : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a></code></dt><dt id="val-analyze_sat"><a href="#val-analyze_sat" class="anchor"></a><code><span class="keyword">val </span>analyze_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-conflict_res">conflict_res</a></code></dt><dt id="val-analyze"><a href="#val-analyze" class="anchor"></a><code><span class="keyword">val </span>analyze : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-conflict_res">conflict_res</a></code></dt><dt id="val-record_learnt_clause"><a href="#val-record_learnt_clause" class="anchor"></a><code><span class="keyword">val </span>record_learnt_clause : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-conflict_res">conflict_res</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-add_boolean_conflict"><a href="#val-add_boolean_conflict" class="anchor"></a><code><span class="keyword">val </span>add_boolean_conflict : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-clause_vector"><a href="#val-clause_vector" class="anchor"></a><code><span class="keyword">val </span>clause_vector : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt><dt id="val-add_clause_permanent"><a href="#val-add_clause_permanent" class="anchor"></a><code><span class="keyword">val </span>add_clause_permanent : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> list <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-add_clause_user"><a href="#val-add_clause_user" class="anchor"></a><code><span class="keyword">val </span>add_clause_user : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> unit</code></dt></dl><dl><dt id="type-watch_res"><a href="#type-watch_res" class="anchor"></a><code><span class="keyword">type </span>watch_res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-watch_res.Watch_kept" class="anchored"><td class="def constructor"><a href="#type-watch_res.Watch_kept" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Watch_kept</span></code></td></tr><tr id="type-watch_res.Watch_removed" class="anchored"><td class="def constructor"><a href="#type-watch_res.Watch_removed" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Watch_removed</span></code></td></tr></table><code></code></dt></dl><dl><dt id="exception-Exn_remove_watch"><a href="#exception-Exn_remove_watch" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Exn_remove_watch</span></code></dt></dl><dl><dt id="val-propagate_in_clause"><a href="#val-propagate_in_clause" class="anchor"></a><code><span class="keyword">val </span>propagate_in_clause : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-watch_res">watch_res</a></code></dt><dt id="val-propagate_atom"><a href="#val-propagate_atom" class="anchor"></a><code><span class="keyword">val </span>propagate_atom : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-slice_iter"><a href="#val-slice_iter" class="anchor"></a><code><span class="keyword">val </span>slice_iter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> (<a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dt id="val-act_push_"><a href="#val-act_push_" class="anchor"></a><code><span class="keyword">val </span>act_push_ : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-proof">St.proof</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-act_push_local"><a href="#val-act_push_local" class="anchor"></a><code><span class="keyword">val </span>act_push_local : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-proof">St.proof</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-act_push_persistent"><a href="#val-act_push_persistent" class="anchor"></a><code><span class="keyword">val </span>act_push_persistent : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-proof">St.proof</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-act_propagate"><a href="#val-act_propagate" class="anchor"></a><code><span class="keyword">val </span>act_propagate : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> list <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-proof">St.proof</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-current_slice"><a href="#val-current_slice" class="anchor"></a><code><span class="keyword">val </span>current_slice : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> (<a href="argument-1-St/index.html#type-formula">St.formula</a>, <span class="type-var">'a</span>) <a href="../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a></code></dt><dt id="val-full_slice"><a href="#val-full_slice" class="anchor"></a><code><span class="keyword">val </span>full_slice : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="argument-1-St/index.html#type-formula">St.formula</a>, <span class="type-var">'a</span>) <a href="../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a></code></dt><dt id="val-act_at_level_0"><a href="#val-act_at_level_0" class="anchor"></a><code><span class="keyword">val </span>act_at_level_0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> bool</code></dt><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="argument-1-St/index.html#type-formula">St.formula</a>, <a href="argument-1-St/index.html#type-proof">St.proof</a>) <a href="../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a></code></dt><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Big | `Small | `Tiny ] <span>&#8209;&gt;</span> ?&#8288;st:<a href="argument-1-St/index.html#type-t">St.t</a> <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-propagation_fixpoint"><a href="#val-propagation_fixpoint" class="anchor"></a><code><span class="keyword">val </span>propagation_fixpoint : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-theory_propagate"><a href="#val-theory_propagate" class="anchor"></a><code><span class="keyword">val </span>theory_propagate : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> option</code></dt><dt id="val-propagate"><a href="#val-propagate" class="anchor"></a><code><span class="keyword">val </span>propagate : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> option</code></dt><dt id="val-reduce_db"><a href="#val-reduce_db" class="anchor"></a><code><span class="keyword">val </span>reduce_db : unit <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pick_branch_aux"><a href="#val-pick_branch_aux" class="anchor"></a><code><span class="keyword">val </span>pick_branch_aux : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/Atom/index.html#type-t">St.Atom.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pick_branch_lit"><a href="#val-pick_branch_lit" class="anchor"></a><code><span class="keyword">val </span>pick_branch_lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-search"><a href="#val-search" class="anchor"></a><code><span class="keyword">val </span>search : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-eval_level"><a href="#val-eval_level" class="anchor"></a><code><span class="keyword">val </span>eval_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> bool<span class="keyword"> * </span>int</code></dt><dt id="val-eval"><a href="#val-eval" class="anchor"></a><code><span class="keyword">val </span>eval : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-unsat_conflict"><a href="#val-unsat_conflict" class="anchor"></a><code><span class="keyword">val </span>unsat_conflict : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> option</code></dt><dt id="val-pp_trail"><a href="#val-pp_trail" class="anchor"></a><code><span class="keyword">val </span>pp_trail : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> list list <span>&#8209;&gt;</span> unit</code></dt><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-local"><a href="#val-local" class="anchor"></a><code><span class="keyword">val </span>local : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-formula">St.formula</a> list <span>&#8209;&gt;</span> unit</code></dt><dt id="val-check_clause"><a href="#val-check_clause" class="anchor"></a><code><span class="keyword">val </span>check_clause : <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-check_vec"><a href="#val-check_vec" class="anchor"></a><code><span class="keyword">val </span>check_vec : <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-check_stack"><a href="#val-check_stack" class="anchor"></a><code><span class="keyword">val </span>check_stack : <a href="argument-1-St/Clause/index.html#type-t">St.Clause.t</a> Stack.t <span>&#8209;&gt;</span> bool</code></dt><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hyps"><a href="#val-hyps" class="anchor"></a><code><span class="keyword">val </span>hyps : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt><dt id="val-history"><a href="#val-history" class="anchor"></a><code><span class="keyword">val </span>history : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt><dt id="val-temp"><a href="#val-temp" class="anchor"></a><code><span class="keyword">val </span>temp : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-clause">St.clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt><dt id="val-trail"><a href="#val-trail" class="anchor"></a><code><span class="keyword">val </span>trail : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="argument-1-St/index.html#type-atom">St.atom</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Internal/index.html b/sidekick/Sidekick_sat__Internal/index.html
new file mode 100644
index 00000000..28b78937
--- /dev/null
+++ b/sidekick/Sidekick_sat__Internal/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat__Internal (sidekick.Sidekick_sat__Internal)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Internal</code></h1></header><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-St/index.html">St</a> : <a href="../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-Th/index.html">Th</a> : <a href="../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-proof">St.proof</a>) -&gt; <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/.jbuilder-keep b/sidekick/Sidekick_sat__Res/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat__Res/Make/Atom/index.html b/sidekick/Sidekick_sat__Res/Make/Atom/index.html
new file mode 100644
index 00000000..b690c8b8
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/Make/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Res.Make.Atom)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.Make.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/Make/Clause/index.html b/sidekick/Sidekick_sat__Res/Make/Clause/index.html
new file mode 100644
index 00000000..ae4af81d
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/Make/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Res.Make.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.Make.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/Make/argument-1-St/Atom/index.html b/sidekick/Sidekick_sat__Res/Make/argument-1-St/Atom/index.html
new file mode 100644
index 00000000..9f649042
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/Make/argument-1-St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Res.Make.1-St.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.Make.1-St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/Make/argument-1-St/Clause/index.html b/sidekick/Sidekick_sat__Res/Make/argument-1-St/Clause/index.html
new file mode 100644
index 00000000..cf340eb2
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/Make/argument-1-St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Res.Make.1-St.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.Make.1-St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/Make/argument-1-St/Formula/index.html b/sidekick/Sidekick_sat__Res/Make/argument-1-St/Formula/index.html
new file mode 100644
index 00000000..1f65271d
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/Make/argument-1-St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Res.Make.1-St.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.Make.1-St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/Make/argument-1-St/Var/index.html b/sidekick/Sidekick_sat__Res/Make/argument-1-St/Var/index.html
new file mode 100644
index 00000000..952c5694
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/Make/argument-1-St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__Res.Make.1-St.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.Make.1-St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/Make/argument-1-St/index.html b/sidekick/Sidekick_sat__Res/Make/argument-1-St/index.html
new file mode 100644
index 00000000..c1d439ec
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/Make/argument-1-St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-St (sidekick.Sidekick_sat__Res.Make.1-St)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__Res.Make.1-St</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/Make/index.html b/sidekick/Sidekick_sat__Res/Make/index.html
new file mode 100644
index 00000000..05d72a27
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat__Res.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.Make</code></h1></header><div class="doc"><p>Functor to create a module building proofs from a sat-solver unsat trace.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-St/index.html">St</a> : <a href="../../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></dl><h3 class="heading">Signature</h3><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span>St = <a href="index.html#argument-1-St">St</a></code></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../Sidekick_sat__/Res_intf/index.html#module-type-S">Sidekick_sat__.Res_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-atom">atom</a><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code></span></summary><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></details></div></div></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/index.html b/sidekick/Sidekick_sat__Res/index.html
new file mode 100644
index 00000000..f45cd768
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat__Res (sidekick.Sidekick_sat__Res)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res</code></h1><p>Resolution proofs</p><p>This modules defines functions to create and manipulate resolution proofs.</p></header><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Sidekick_sat__/Res_intf/index.html#module-type-S">Sidekick_sat__.Res_intf.S</a></code></article><article id="module-type-FULL"><a href="#module-type-FULL" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-FULL/index.html">FULL</a> = <a href="../Sidekick_sat__/Res_intf/index.html#module-type-FULL">Sidekick_sat__.Res_intf.FULL</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-St/index.html">St</a> : <a href="../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a>) -&gt; <a href="index.html#module-type-FULL">FULL</a><span class="keyword"> with </span><span class="keyword">module </span><a href="Make/St/index.html">St</a> = <a href="Make/index.html#argument-1-St">St</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-FULL/Atom/index.html b/sidekick/Sidekick_sat__Res/module-type-FULL/Atom/index.html
new file mode 100644
index 00000000..252b3175
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-FULL/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Res.FULL.Atom)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.FULL.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-FULL/Clause/index.html b/sidekick/Sidekick_sat__Res/module-type-FULL/Clause/index.html
new file mode 100644
index 00000000..87a9e3fe
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-FULL/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Res.FULL.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.FULL.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-FULL/St/Atom/index.html b/sidekick/Sidekick_sat__Res/module-type-FULL/St/Atom/index.html
new file mode 100644
index 00000000..11edf0ad
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-FULL/St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Res.FULL.St.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.FULL.St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-FULL/St/Clause/index.html b/sidekick/Sidekick_sat__Res/module-type-FULL/St/Clause/index.html
new file mode 100644
index 00000000..7757c7b3
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-FULL/St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Res.FULL.St.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.FULL.St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-FULL/St/Formula/index.html b/sidekick/Sidekick_sat__Res/module-type-FULL/St/Formula/index.html
new file mode 100644
index 00000000..0d583086
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-FULL/St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Res.FULL.St.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.FULL.St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-FULL/St/Var/index.html b/sidekick/Sidekick_sat__Res/module-type-FULL/St/Var/index.html
new file mode 100644
index 00000000..12d967d2
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-FULL/St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__Res.FULL.St.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.FULL.St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-FULL/St/index.html b/sidekick/Sidekick_sat__Res/module-type-FULL/St/index.html
new file mode 100644
index 00000000..94c64d66
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-FULL/St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>St (sidekick.Sidekick_sat__Res.FULL.St)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.FULL.St</code></h1></header><div class="doc"><p>Module defining atom and clauses</p></div><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-FULL/index.html b/sidekick/Sidekick_sat__Res/module-type-FULL/index.html
new file mode 100644
index 00000000..bd80192b
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-FULL/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>FULL (sidekick.Sidekick_sat__Res.FULL)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__Res.FULL</code></h1></header><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span><a href="St/index.html">St</a> : <a href="../../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../Sidekick_sat__/Res_intf/index.html#module-type-S">Sidekick_sat__.Res_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-atom">atom</a><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Sidekick_sat__/Res_intf/module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code></span></summary><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></details></div></div></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-S/Atom/index.html b/sidekick/Sidekick_sat__Res/module-type-S/Atom/index.html
new file mode 100644
index 00000000..1cad34ec
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Res.S.Atom)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__Res/module-type-S/Clause/index.html
new file mode 100644
index 00000000..ef89e5d2
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Res.S.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res/module-type-S/index.html b/sidekick/Sidekick_sat__Res/module-type-S/index.html
new file mode 100644
index 00000000..658355d9
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__Res.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__Res.S</code></h1></header><div class="doc"><p>Interface for a module manipulating resolution proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/.jbuilder-keep b/sidekick/Sidekick_sat__Res_intf/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat__Res_intf/index.html b/sidekick/Sidekick_sat__Res_intf/index.html
new file mode 100644
index 00000000..7b8563f6
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat__Res_intf (sidekick.Sidekick_sat__Res_intf)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf</code></h1><p>Interface for proofs</p></header><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-FULL"><a href="#module-type-FULL" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-FULL/index.html">FULL</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-FULL/Atom/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/Atom/index.html
new file mode 100644
index 00000000..08998947
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Res_intf.FULL.Atom)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf.FULL.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-FULL/Clause/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/Clause/index.html
new file mode 100644
index 00000000..b62967e8
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Res_intf.FULL.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf.FULL.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Atom/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Atom/index.html
new file mode 100644
index 00000000..e52d5c25
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Res_intf.FULL.St.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf.FULL.St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Clause/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Clause/index.html
new file mode 100644
index 00000000..13bd7449
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Res_intf.FULL.St.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf.FULL.St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Formula/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Formula/index.html
new file mode 100644
index 00000000..adc55c55
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Res_intf.FULL.St.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf.FULL.St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Var/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Var/index.html
new file mode 100644
index 00000000..cbc485a9
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__Res_intf.FULL.St.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf.FULL.St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/index.html
new file mode 100644
index 00000000..8cc136d3
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>St (sidekick.Sidekick_sat__Res_intf.FULL.St)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf.FULL.St</code></h1></header><div class="doc"><p>Module defining atom and clauses</p></div><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-FULL/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/index.html
new file mode 100644
index 00000000..5031e9c0
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-FULL/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>FULL (sidekick.Sidekick_sat__Res_intf.FULL)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__Res_intf.FULL</code></h1></header><article id="module-St"><a href="#module-St" class="anchor"></a><code><span class="keyword">module </span><a href="St/index.html">St</a> : <a href="../../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../module-type-S/index.html#type-atom">atom</a><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code></span></summary><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="St/index.html#type-formula">St.formula</a></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="St/index.html#type-atom">St.atom</a></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></details></div></div></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-S/Atom/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-S/Atom/index.html
new file mode 100644
index 00000000..d92da82e
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Res_intf.S.Atom)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-S/Clause/index.html
new file mode 100644
index 00000000..9e29cab2
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Res_intf.S.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Res_intf.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Res_intf/module-type-S/index.html b/sidekick/Sidekick_sat__Res_intf/module-type-S/index.html
new file mode 100644
index 00000000..0a86672f
--- /dev/null
+++ b/sidekick/Sidekick_sat__Res_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__Res_intf.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__Res_intf.S</code></h1></header><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/.jbuilder-keep b/sidekick/Sidekick_sat__Solver/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat__Solver/Make/Clause/index.html b/sidekick/Sidekick_sat__Solver/Make/Clause/index.html
new file mode 100644
index 00000000..9dbfcb5f
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver.Make.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> array <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Make a clause from this array of SAT literals. The array's ownership is transferred to the clause, do not mutate it</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_atoms"><a href="#val-of_atoms" class="anchor"></a><code><span class="keyword">val </span>of_atoms : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/Formula/index.html b/sidekick/Sidekick_sat__Solver/Make/Formula/index.html
new file mode 100644
index 00000000..57283b7d
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Solver.Make.Formula)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/Lit/index.html b/sidekick/Sidekick_sat__Solver/Make/Lit/index.html
new file mode 100644
index 00000000..f289c73d
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_sat__Solver.Make.Lit)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-lit">lit</a></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/Proof/Atom/index.html b/sidekick/Sidekick_sat__Solver/Make/Proof/Atom/index.html
new file mode 100644
index 00000000..a4e2d18f
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Solver.Make.Proof.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/Proof/Clause/index.html b/sidekick/Sidekick_sat__Solver/Make/Proof/Clause/index.html
new file mode 100644
index 00000000..c05dd69b
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver.Make.Proof.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/Proof/index.html b/sidekick/Sidekick_sat__Solver/Make/Proof/index.html
new file mode 100644
index 00000000..913b7bec
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat__Solver.Make.Proof)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.Proof</code></h1></header><div class="doc"><p>A module to manipulate proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-proof">St.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Atom/index.html b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Atom/index.html
new file mode 100644
index 00000000..b5425879
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Solver.Make.1-St.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.1-St.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Clause/index.html b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Clause/index.html
new file mode 100644
index 00000000..fe1b52e3
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver.Make.1-St.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.1-St.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Formula/index.html b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Formula/index.html
new file mode 100644
index 00000000..0082a64a
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Solver.Make.1-St.Formula)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.1-St.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Var/index.html b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Var/index.html
new file mode 100644
index 00000000..f623e42d
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__Solver.Make.1-St.Var)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.1-St.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/argument-1-St/index.html b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/index.html
new file mode 100644
index 00000000..9c170042
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/argument-1-St/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-St (sidekick.Sidekick_sat__Solver.Make.1-St)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__Solver.Make.1-St</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/argument-2-Th/Form/index.html b/sidekick/Sidekick_sat__Solver/Make/argument-2-Th/Form/index.html
new file mode 100644
index 00000000..35526ea7
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/argument-2-Th/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat__Solver.Make.2-Th.Form)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make.2-Th.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/argument-2-Th/index.html b/sidekick/Sidekick_sat__Solver/Make/argument-2-Th/index.html
new file mode 100644
index 00000000..080c9eed
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/argument-2-Th/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-Th (sidekick.Sidekick_sat__Solver.Make.2-Th)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__Solver.Make.2-Th</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-formula">St.formula</a></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="../argument-1-St/index.html#type-proof">St.proof</a></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/Make/index.html b/sidekick/Sidekick_sat__Solver/Make/index.html
new file mode 100644
index 00000000..1b07c672
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat__Solver.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.Make</code></h1></header><div class="doc"><p>Functor to make a safe external interface.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-2-Th/index.html">Th</a> : <a href="../../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="argument-2-Th/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="argument-2-Th/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-proof">St.proof</a></code><code><a href="argument-1-St/index.html">St</a> : <a href="../../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a></code></dl><h3 class="heading">Signature</h3><section><header><h2 id="internal-modules"><a href="#internal-modules" class="anchor"></a>Internal modules</h2><p>These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.</p></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="argument-1-St/index.html#type-formula">St.formula</a></code><code></code></dt><dd><p>user formulas</p></dd></dl><dl><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code></code></dt><dd><p>SAT solver literals</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="argument-1-St/index.html#type-clause">St.clause</a></code><code></code></dt><dd><p>SAT solver clauses</p></dd></dl><dl><dt id="type-theory"><a href="#type-theory" class="anchor"></a><code><span class="keyword">type </span>theory</code><code><span class="keyword"> = </span><a href="argument-2-Th/index.html#type-t">Th.t</a></code><code></code></dt><dd><p>user theory</p></dd></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_sat/Res/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="index.html#type-clause">clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Sidekick_sat/Res/module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="argument-1-St/index.html#type-proof">St.proof</a></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Main solver type, containing all state for solving.</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create new solver</p><dl><dt>parameter size</dt><dd><p>the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.</p></dd></dl></dd></dl></section><section><header><h2 id="types"><a href="#types" class="anchor"></a>Types</h2></header><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atoms given by the module argument for formulas. An atom is a user-defined atomic formula whose truth value is picked by Msat.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="index.html#type-formula">formula</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-sat_state">Sidekick_sat__.Solver_intf.sat_state</a></code></td><td class="doc"><p>Returned when the solver reaches SAT, with a model</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span>(<a href="index.html#type-clause">clause</a>, <a href="Proof/index.html#type-proof">Proof.proof</a>) <a href="../../Sidekick_sat__/Solver_intf/index.html#type-unsat_state">Sidekick_sat__.Solver_intf.unsat_state</a></code></td><td class="doc"><p>Returned when the solver reaches UNSAT, with a proof</p></td></tr></table><code></code></dt><dd><p>Result type for the solver</p></dd></dl><dl><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dd><p>Exception raised by the evaluating functions when a literal has not yet been assigned a value.</p></dd></dl></section><section><header><h2 id="base-operations"><a href="#base-operations" class="anchor"></a>Base operations</h2></header><dl><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-theory">theory</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : ?&#8288;permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking (default true)</p></dd></dl></dd></dl><dl><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Lower level addition of clauses. See <a href="Clause/index.html"><code>Clause</code></a> to create clauses.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;assumptions:<a href="index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dd><p>Try and solves the current set of clauses.</p><dl><dt>parameter assumptions</dt><dd><p>additional atomic assumptions to be temporarily added. The assumptions are just used for this call to <code>solve</code>, they are not saved in the solver's state.</p></dd></dl></dd></dl><dl><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a new atom (i.e propositional formula) to the solver. This formula will be decided on at some point during solving, whether it appears in clauses or not.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="Proof/index.html#type-proof">Proof.proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat core of a given proof, ie a subset of all the added clauses that is sufficient to establish unsatisfiability.</p></dd></dl><dl><dt id="val-true_at_level0"><a href="#val-true_at_level0" class="anchor"></a><code><span class="keyword">val </span>true_at_level0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p><code>true_at_level0 a</code> returns <code>true</code> if <code>a</code> was proved at level0, i.e. it must hold in all models</p></dd></dl><dl><dt id="val-get_tag"><a href="#val-get_tag" class="anchor"></a><code><span class="keyword">val </span>get_tag : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> int option</code></dt><dd><p>Recover tag from a clause, if any</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Push a new save point. Clauses added after this call to <code>push</code> will be added as normal, but the corresponding call to <code>pop</code> will remove these clauses.</p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Return to last save point, discarding clauses added since last call to <code>push</code></p></dd></dl><dl><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="Proof/index.html#type-lemma">Proof.lemma</a>) <a href="../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a></code></dt><dd><p>Obtain actions</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-export">Sidekick_sat__.Solver_intf.export</a></code></dt></dl></section><section><header><h2 id="re-export-some-functions"><a href="#re-export-some-functions" class="anchor"></a>Re-export some functions</h2></header><dl><dt id="type-solver"><a href="#type-solver" class="anchor"></a><code><span class="keyword">type </span>solver</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/index.html b/sidekick/Sidekick_sat__Solver/index.html
new file mode 100644
index 00000000..e64aa835
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat__Solver (sidekick.Sidekick_sat__Solver)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver</code></h1><p>SAT safe interface</p><p>This module defines a safe interface for the core solver. It is the basis of the <code>Solver</code> and <code>Mcsolver</code> modules.</p></header><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Sidekick_sat__/Solver_intf/index.html#module-type-S">Sidekick_sat__.Solver_intf.S</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-St/index.html">St</a> : <a href="../Sidekick_sat__/Solver_types/index.html#module-type-S">Sidekick_sat__.Solver_types.S</a>) -&gt; <span class="keyword">functor</span> (<a href="Make/argument-2-Th/index.html">Th</a> : <a href="../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-proof">St.proof</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-formula">St.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-clause">St.clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/Proof/index.html#type-lemma">Proof.lemma</a><span class="keyword"> = </span><a href="Make/argument-1-St/index.html#type-proof">St.proof</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-theory">theory</a><span class="keyword"> = </span><a href="Make/argument-2-Th/index.html#type-t">Th.t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__Solver/module-type-S/Clause/index.html
new file mode 100644
index 00000000..0c655a33
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver.S.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> array <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Make a clause from this array of SAT literals. The array's ownership is transferred to the clause, do not mutate it</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_atoms"><a href="#val-of_atoms" class="anchor"></a><code><span class="keyword">val </span>of_atoms : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/module-type-S/Formula/index.html b/sidekick/Sidekick_sat__Solver/module-type-S/Formula/index.html
new file mode 100644
index 00000000..a6e837b5
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Solver.S.Formula)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/module-type-S/Lit/index.html b/sidekick/Sidekick_sat__Solver/module-type-S/Lit/index.html
new file mode 100644
index 00000000..fe9d2c35
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/module-type-S/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_sat__Solver.S.Lit)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.S.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-lit">lit</a></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/module-type-S/Proof/Atom/index.html b/sidekick/Sidekick_sat__Solver/module-type-S/Proof/Atom/index.html
new file mode 100644
index 00000000..239745e8
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/module-type-S/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Solver.S.Proof.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.S.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/module-type-S/Proof/Clause/index.html b/sidekick/Sidekick_sat__Solver/module-type-S/Proof/Clause/index.html
new file mode 100644
index 00000000..d42cdc43
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/module-type-S/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver.S.Proof.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.S.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/module-type-S/Proof/index.html b/sidekick/Sidekick_sat__Solver/module-type-S/Proof/index.html
new file mode 100644
index 00000000..789d17a4
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/module-type-S/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat__Solver.S.Proof)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver.S.Proof</code></h1></header><div class="doc"><p>A module to manipulate proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver/module-type-S/index.html b/sidekick/Sidekick_sat__Solver/module-type-S/index.html
new file mode 100644
index 00000000..89251782
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__Solver.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__Solver.S</code></h1></header><div class="doc"><p>Safe external interface of solvers.</p></div><section><header><h2 id="internal-modules"><a href="#internal-modules" class="anchor"></a>Internal modules</h2><p>These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.</p></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>user formulas</p></dd></dl><dl><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code></code></dt><dd><p>SAT solver literals</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>SAT solver clauses</p></dd></dl><dl><dt id="type-theory"><a href="#type-theory" class="anchor"></a><code><span class="keyword">type </span>theory</code><code></code><code></code></dt><dd><p>user theory</p></dd></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_sat/Res/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="index.html#type-clause">clause</a></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Main solver type, containing all state for solving.</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create new solver</p><dl><dt>parameter size</dt><dd><p>the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.</p></dd></dl></dd></dl></section><section><header><h2 id="types"><a href="#types" class="anchor"></a>Types</h2></header><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atoms given by the module argument for formulas. An atom is a user-defined atomic formula whose truth value is picked by Msat.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="index.html#type-formula">formula</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-sat_state">Sidekick_sat__.Solver_intf.sat_state</a></code></td><td class="doc"><p>Returned when the solver reaches SAT, with a model</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span>(<a href="index.html#type-clause">clause</a>, <a href="Proof/index.html#type-proof">Proof.proof</a>) <a href="../../Sidekick_sat__/Solver_intf/index.html#type-unsat_state">Sidekick_sat__.Solver_intf.unsat_state</a></code></td><td class="doc"><p>Returned when the solver reaches UNSAT, with a proof</p></td></tr></table><code></code></dt><dd><p>Result type for the solver</p></dd></dl><dl><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dd><p>Exception raised by the evaluating functions when a literal has not yet been assigned a value.</p></dd></dl></section><section><header><h2 id="base-operations"><a href="#base-operations" class="anchor"></a>Base operations</h2></header><dl><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-theory">theory</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : ?&#8288;permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking (default true)</p></dd></dl></dd></dl><dl><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Lower level addition of clauses. See <a href="Clause/index.html"><code>Clause</code></a> to create clauses.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;assumptions:<a href="index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dd><p>Try and solves the current set of clauses.</p><dl><dt>parameter assumptions</dt><dd><p>additional atomic assumptions to be temporarily added. The assumptions are just used for this call to <code>solve</code>, they are not saved in the solver's state.</p></dd></dl></dd></dl><dl><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a new atom (i.e propositional formula) to the solver. This formula will be decided on at some point during solving, whether it appears in clauses or not.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="Proof/index.html#type-proof">Proof.proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat core of a given proof, ie a subset of all the added clauses that is sufficient to establish unsatisfiability.</p></dd></dl><dl><dt id="val-true_at_level0"><a href="#val-true_at_level0" class="anchor"></a><code><span class="keyword">val </span>true_at_level0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p><code>true_at_level0 a</code> returns <code>true</code> if <code>a</code> was proved at level0, i.e. it must hold in all models</p></dd></dl><dl><dt id="val-get_tag"><a href="#val-get_tag" class="anchor"></a><code><span class="keyword">val </span>get_tag : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> int option</code></dt><dd><p>Recover tag from a clause, if any</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Push a new save point. Clauses added after this call to <code>push</code> will be added as normal, but the corresponding call to <code>pop</code> will remove these clauses.</p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Return to last save point, discarding clauses added since last call to <code>push</code></p></dd></dl><dl><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="Proof/index.html#type-lemma">Proof.lemma</a>) <a href="../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a></code></dt><dd><p>Obtain actions</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-export">Sidekick_sat__.Solver_intf.export</a></code></dt></dl></section><section><header><h2 id="re-export-some-functions"><a href="#re-export-some-functions" class="anchor"></a>Re-export some functions</h2></header><dl><dt id="type-solver"><a href="#type-solver" class="anchor"></a><code><span class="keyword">type </span>solver</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_intf/.jbuilder-keep b/sidekick/Sidekick_sat__Solver_intf/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat__Solver_intf/index.html b/sidekick/Sidekick_sat__Solver_intf/index.html
new file mode 100644
index 00000000..19d93653
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat__Solver_intf (sidekick.Sidekick_sat__Solver_intf)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_intf</code></h1><p>Interface for Solvers</p><p>This modules defines the safe external interface for solvers. Solvers that implements this interface can be obtained using the <code>Make</code> functor in <code>Solver</code> or <code>Mcsolver</code>.</p></header><dl><dt id="type-sat_state"><a href="#type-sat_state" class="anchor"></a><code><span class="keyword">type </span>'form sat_state</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-sat_state.Sat_state" class="anchored"><td class="def constructor"><a href="#type-sat_state.Sat_state" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat_state</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-sat_state.eval" class="anchored"><td class="def field"><a href="#type-sat_state.eval" class="anchor"></a><code>eval : <span class="type-var">'form</span> <span>&#8209;&gt;</span> bool;</code></td><td class="doc"><p>Returns the valuation of a formula in the current state of the sat solver.</p><dl><dt>raises UndecidedLit</dt><dd><p>if the literal is not decided</p></dd></dl></td></tr><tr id="type-sat_state.eval_level" class="anchored"><td class="def field"><a href="#type-sat_state.eval_level" class="anchor"></a><code>eval_level : <span class="type-var">'form</span> <span>&#8209;&gt;</span> bool<span class="keyword"> * </span>int;</code></td><td class="doc"><p>Return the current assignement of the literals, as well as its decision level. If the level is 0, then it is necessary for the atom to have this value; otherwise it is due to choices that can potentially be backtracked.</p><dl><dt>raises UndecidedLit</dt><dd><p>if the literal is not decided</p></dd></dl></td></tr><tr id="type-sat_state.iter_trail" class="anchored"><td class="def field"><a href="#type-sat_state.iter_trail" class="anchor"></a><code>iter_trail : (<span class="type-var">'form</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Iter through the formulas and terms in order of decision/propagation (starting from the first propagation, to the last propagation).</p></td></tr></table><code>}</code><code></code></td><td class="doc"><p>The type of values returned when the solver reaches a SAT state.</p></td></tr></table><code></code></dt><dt id="type-unsat_state"><a href="#type-unsat_state" class="anchor"></a><code><span class="keyword">type </span>('clause, 'proof) unsat_state</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-unsat_state.Unsat_state" class="anchored"><td class="def constructor"><a href="#type-unsat_state.Unsat_state" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat_state</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-unsat_state.unsat_conflict" class="anchored"><td class="def field"><a href="#type-unsat_state.unsat_conflict" class="anchor"></a><code>unsat_conflict : unit <span>&#8209;&gt;</span> <span class="type-var">'clause</span>;</code></td><td class="doc"><p>Returns the unsat clause found at the toplevel</p></td></tr><tr id="type-unsat_state.get_proof" class="anchored"><td class="def field"><a href="#type-unsat_state.get_proof" class="anchor"></a><code>get_proof : unit <span>&#8209;&gt;</span> <span class="type-var">'proof</span>;</code></td><td class="doc"><p>returns a persistent proof of the empty clause from the Unsat result.</p></td></tr></table><code>}</code><code></code></td><td class="doc"><p>The type of values returned when the solver reaches an UNSAT state.</p></td></tr></table><code></code></dt><dt id="type-export"><a href="#type-export" class="anchor"></a><code><span class="keyword">type </span>'clause export</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-export.hyps" class="anchored"><td class="def field"><a href="#type-export.hyps" class="anchor"></a><code>hyps : <span class="type-var">'clause</span> <a href="../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-export.history" class="anchored"><td class="def field"><a href="#type-export.history" class="anchor"></a><code>history : <span class="type-var">'clause</span> <a href="../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr><tr id="type-export.local" class="anchored"><td class="def field"><a href="#type-export.local" class="anchor"></a><code>local : <span class="type-var">'clause</span> <a href="../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td></tr></table><code>}</code><code></code></dt><dd><p>Export internal state</p></dd></dl><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_intf/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Clause/index.html
new file mode 100644
index 00000000..7ded7cb4
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver_intf.S.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_intf.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> array <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Make a clause from this array of SAT literals. The array's ownership is transferred to the clause, do not mutate it</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_atoms"><a href="#val-of_atoms" class="anchor"></a><code><span class="keyword">val </span>of_atoms : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_intf/module-type-S/Formula/index.html b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Formula/index.html
new file mode 100644
index 00000000..2f6f3588
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Solver_intf.S.Formula)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_intf.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_intf/module-type-S/Lit/index.html b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Lit/index.html
new file mode 100644
index 00000000..2bc19723
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_sat__Solver_intf.S.Lit)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_intf.S.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-lit">lit</a></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/Atom/index.html b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/Atom/index.html
new file mode 100644
index 00000000..43b55703
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Solver_intf.S.Proof.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_intf.S.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/Clause/index.html b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/Clause/index.html
new file mode 100644
index 00000000..c6f77b28
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver_intf.S.Proof.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_intf.S.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/index.html b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/index.html
new file mode 100644
index 00000000..5f2e99b5
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_intf/module-type-S/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_sat__Solver_intf.S.Proof)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_intf.S.Proof</code></h1></header><div class="doc"><p>A module to manipulate proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_intf/module-type-S/index.html b/sidekick/Sidekick_sat__Solver_intf/module-type-S/index.html
new file mode 100644
index 00000000..aab8b8ec
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__Solver_intf.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__Solver_intf.S</code></h1></header><div class="doc"><p>The external interface implemented by safe solvers, such as the one created by the <span class="xref-unresolved" title="unresolved reference to &quot;Solver.Make&quot;"><code>Solver</code>.Make</span> and <span class="xref-unresolved" title="unresolved reference to &quot;Mcsolver.Make&quot;"><code>Mcsolver</code>.Make</span> functors.</p></div><section><header><h2 id="internal-modules"><a href="#internal-modules" class="anchor"></a>Internal modules</h2><p>These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.</p></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>user formulas</p></dd></dl><dl><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code></code></dt><dd><p>SAT solver literals</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>SAT solver clauses</p></dd></dl><dl><dt id="type-theory"><a href="#type-theory" class="anchor"></a><code><span class="keyword">type </span>theory</code><code></code><code></code></dt><dd><p>user theory</p></dd></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_sat/Res/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="index.html#type-clause">clause</a></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Main solver type, containing all state for solving.</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create new solver</p><dl><dt>parameter size</dt><dd><p>the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.</p></dd></dl></dd></dl></section><section><header><h2 id="types"><a href="#types" class="anchor"></a>Types</h2></header><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atoms given by the module argument for formulas. An atom is a user-defined atomic formula whose truth value is picked by Msat.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="index.html#type-formula">formula</a> <a href="../index.html#type-sat_state">sat_state</a></code></td><td class="doc"><p>Returned when the solver reaches SAT, with a model</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span>(<a href="index.html#type-clause">clause</a>, <a href="Proof/index.html#type-proof">Proof.proof</a>) <a href="../index.html#type-unsat_state">unsat_state</a></code></td><td class="doc"><p>Returned when the solver reaches UNSAT, with a proof</p></td></tr></table><code></code></dt><dd><p>Result type for the solver</p></dd></dl><dl><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dd><p>Exception raised by the evaluating functions when a literal has not yet been assigned a value.</p></dd></dl></section><section><header><h2 id="base-operations"><a href="#base-operations" class="anchor"></a>Base operations</h2></header><dl><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-theory">theory</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : ?&#8288;permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking (default true)</p></dd></dl></dd></dl><dl><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Lower level addition of clauses. See <a href="Clause/index.html"><code>Clause</code></a> to create clauses.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;assumptions:<a href="index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dd><p>Try and solves the current set of clauses.</p><dl><dt>parameter assumptions</dt><dd><p>additional atomic assumptions to be temporarily added. The assumptions are just used for this call to <code>solve</code>, they are not saved in the solver's state.</p></dd></dl></dd></dl><dl><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a new atom (i.e propositional formula) to the solver. This formula will be decided on at some point during solving, whether it appears in clauses or not.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="Proof/index.html#type-proof">Proof.proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat core of a given proof, ie a subset of all the added clauses that is sufficient to establish unsatisfiability.</p></dd></dl><dl><dt id="val-true_at_level0"><a href="#val-true_at_level0" class="anchor"></a><code><span class="keyword">val </span>true_at_level0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p><code>true_at_level0 a</code> returns <code>true</code> if <code>a</code> was proved at level0, i.e. it must hold in all models</p></dd></dl><dl><dt id="val-get_tag"><a href="#val-get_tag" class="anchor"></a><code><span class="keyword">val </span>get_tag : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> int option</code></dt><dd><p>Recover tag from a clause, if any</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Push a new save point. Clauses added after this call to <code>push</code> will be added as normal, but the corresponding call to <code>pop</code> will remove these clauses.</p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Return to last save point, discarding clauses added since last call to <code>push</code></p></dd></dl><dl><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="Proof/index.html#type-lemma">Proof.lemma</a>) <a href="../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a></code></dt><dd><p>Obtain actions</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <a href="../index.html#type-export">export</a></code></dt></dl></section><section><header><h2 id="re-export-some-functions"><a href="#re-export-some-functions" class="anchor"></a>Re-export some functions</h2></header><dl><dt id="type-solver"><a href="#type-solver" class="anchor"></a><code><span class="keyword">type </span>solver</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/.jbuilder-keep b/sidekick/Sidekick_sat__Solver_types/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat__Solver_types/Make/Atom/index.html b/sidekick/Sidekick_sat__Solver_types/Make/Atom/index.html
new file mode 100644
index 00000000..8895a6ca
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/Make/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Solver_types.Make.Atom)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.Make.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/Make/Clause/index.html b/sidekick/Sidekick_sat__Solver_types/Make/Clause/index.html
new file mode 100644
index 00000000..6e829922
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/Make/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver_types.Make.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.Make.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/Make/Formula/index.html b/sidekick/Sidekick_sat__Solver_types/Make/Formula/index.html
new file mode 100644
index 00000000..18fef155
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/Make/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Solver_types.Make.Formula)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.Make.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/Make/Var/index.html b/sidekick/Sidekick_sat__Solver_types/Make/Var/index.html
new file mode 100644
index 00000000..7a49b8fb
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/Make/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__Solver_types.Make.Var)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.Make.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/Make/argument-1-E/Form/index.html b/sidekick/Sidekick_sat__Solver_types/Make/argument-1-E/Form/index.html
new file mode 100644
index 00000000..3b054031
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/Make/argument-1-E/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat__Solver_types.Make.1-E.Form)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.Make.1-E.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/Make/argument-1-E/index.html b/sidekick/Sidekick_sat__Solver_types/Make/argument-1-E/index.html
new file mode 100644
index 00000000..01240b84
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/Make/argument-1-E/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-E (sidekick.Sidekick_sat__Solver_types.Make.1-E)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_sat__Solver_types.Make.1-E</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../../../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/Make/index.html b/sidekick/Sidekick_sat__Solver_types/Make/index.html
new file mode 100644
index 00000000..2ab41844
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_sat__Solver_types.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.Make</code></h1></header><div class="doc"><p>Functor to instantiate the types of clauses for a solver.</p></div><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-E/index.html">E</a> : <a href="../../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a></code></dl><h3 class="heading">Signature</h3><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="argument-1-E/index.html#type-formula">E.formula</a></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="argument-1-E/index.html#type-proof">E.proof</a></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/index.html b/sidekick/Sidekick_sat__Solver_types/index.html
new file mode 100644
index 00000000..fc498cd4
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat__Solver_types (sidekick.Sidekick_sat__Solver_types)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types</code></h1><p>Internal types (implementation)</p><p>This modules actually implements the internal types used by the solver. Since mutation is heavily used in the solver, it is really, really, *really* discouraged to direclty use the functions in this module if you don't know the inner working of mSAT perfectly as even the simplest change can have dramatic effects on the solver.</p></header><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Sidekick_sat/Solver_types_intf/index.html#module-type-S">Sidekick_sat.Solver_types_intf.S</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-E/index.html">E</a> : <a href="../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="Make/argument-1-E/index.html#type-formula">E.formula</a><span class="keyword"> and </span><span class="keyword">type </span><a href="Make/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="Make/argument-1-E/index.html#type-proof">E.proof</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/module-type-S/Atom/index.html b/sidekick/Sidekick_sat__Solver_types/module-type-S/Atom/index.html
new file mode 100644
index 00000000..8a5e7ea7
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Solver_types.S.Atom)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__Solver_types/module-type-S/Clause/index.html
new file mode 100644
index 00000000..03c1ba66
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver_types.S.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/module-type-S/Formula/index.html b/sidekick/Sidekick_sat__Solver_types/module-type-S/Formula/index.html
new file mode 100644
index 00000000..50642734
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Solver_types.S.Formula)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat/Solver_types_intf/index.html#type-printer">Sidekick_sat.Solver_types_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/module-type-S/Var/index.html b/sidekick/Sidekick_sat__Solver_types/module-type-S/Var/index.html
new file mode 100644
index 00000000..ce966032
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/module-type-S/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__Solver_types.S.Var)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types.S.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types/module-type-S/index.html b/sidekick/Sidekick_sat__Solver_types/module-type-S/index.html
new file mode 100644
index 00000000..b743afa0
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__Solver_types.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__Solver_types.S</code></h1></header><div class="doc"><p>Interface for the internal types.</p></div><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../../Sidekick_sat/Solver_types_intf/Var_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../../Sidekick_sat/Solver_types_intf/C_fields/index.html#type-t">Sidekick_sat.Solver_types_intf.C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types_intf/.jbuilder-keep b/sidekick/Sidekick_sat__Solver_types_intf/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat__Solver_types_intf/C_fields/index.html b/sidekick/Sidekick_sat__Solver_types_intf/C_fields/index.html
new file mode 100644
index 00000000..a0ff80f9
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types_intf/C_fields/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>C_fields (sidekick.Sidekick_sat__Solver_types_intf.C_fields)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types_intf.C_fields</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><span class="keyword">private </span>int</code><code></code></dt><dd><p>Generative type of bitfields. Each instantiation of the functor should create a new, incompatible type</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>Empty bitfields (all bits 0)</p></dd></dl><dl><dt id="type-field"><a href="#type-field" class="anchor"></a><code><span class="keyword">type </span>field</code><code></code><code></code></dt></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Get the value of this field</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Set the value of this field</p></dd></dl><dl><dt id="val-mk_field"><a href="#val-mk_field" class="anchor"></a><code><span class="keyword">val </span>mk_field : unit <span>&#8209;&gt;</span> <a href="index.html#type-field">field</a></code></dt><dd><p>Make a new field</p></dd></dl><dl><dt id="val-freeze"><a href="#val-freeze" class="anchor"></a><code><span class="keyword">val </span>freeze : unit <span>&#8209;&gt;</span> unit</code></dt><dd><p>Prevent new fields from being added. From now on, creating a field will raise Frozen</p></dd></dl><dl><dt id="val-total_width"><a href="#val-total_width" class="anchor"></a><code><span class="keyword">val </span>total_width : unit <span>&#8209;&gt;</span> int</code></dt><dd><p>Current width of the bitfield</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types_intf/Var_fields/index.html b/sidekick/Sidekick_sat__Solver_types_intf/Var_fields/index.html
new file mode 100644
index 00000000..77da04d8
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types_intf/Var_fields/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var_fields (sidekick.Sidekick_sat__Solver_types_intf.Var_fields)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types_intf.Var_fields</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><span class="keyword">private </span>int</code><code></code></dt><dd><p>Generative type of bitfields. Each instantiation of the functor should create a new, incompatible type</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>Empty bitfields (all bits 0)</p></dd></dl><dl><dt id="type-field"><a href="#type-field" class="anchor"></a><code><span class="keyword">type </span>field</code><code></code><code></code></dt></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Get the value of this field</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Set the value of this field</p></dd></dl><dl><dt id="val-mk_field"><a href="#val-mk_field" class="anchor"></a><code><span class="keyword">val </span>mk_field : unit <span>&#8209;&gt;</span> <a href="index.html#type-field">field</a></code></dt><dd><p>Make a new field</p></dd></dl><dl><dt id="val-freeze"><a href="#val-freeze" class="anchor"></a><code><span class="keyword">val </span>freeze : unit <span>&#8209;&gt;</span> unit</code></dt><dd><p>Prevent new fields from being added. From now on, creating a field will raise Frozen</p></dd></dl><dl><dt id="val-total_width"><a href="#val-total_width" class="anchor"></a><code><span class="keyword">val </span>total_width : unit <span>&#8209;&gt;</span> int</code></dt><dd><p>Current width of the bitfield</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types_intf/index.html b/sidekick/Sidekick_sat__Solver_types_intf/index.html
new file mode 100644
index 00000000..53694ec4
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat__Solver_types_intf (sidekick.Sidekick_sat__Solver_types_intf)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types_intf</code></h1><p>Internal types (interface)</p><p>This modules defines the interface of most of the internal types used in the core solver.</p></header><article id="module-Var_fields"><a href="#module-Var_fields" class="anchor"></a><code><span class="keyword">module </span><a href="Var_fields/index.html">Var_fields</a> : <a href="../Sidekick_util__BitField/index.html#module-type-S">Sidekick_util__BitField.S</a></code></article><article id="module-C_fields"><a href="#module-C_fields" class="anchor"></a><code><span class="keyword">module </span><a href="C_fields/index.html">C_fields</a> : <a href="../Sidekick_util__BitField/index.html#module-type-S">Sidekick_util__BitField.S</a></code></article><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Atom/index.html b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Atom/index.html
new file mode 100644
index 00000000..adea3c26
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_sat__Solver_types_intf.S.Atom)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types_intf.S.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Var/index.html#type-t">Var.t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>positive atom</p></dd></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Returns the atom associated with the given formula</p></dd></dl><dl><dt id="val-mark"><a href="#val-mark" class="anchor"></a><code><span class="keyword">val </span>mark : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Mark the atom as seen, using the 'seen' field in the variable.</p></dd></dl><dl><dt id="val-seen"><a href="#val-seen" class="anchor"></a><code><span class="keyword">val </span>seen : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Returns wether the atom has been marked as seen.</p></dd></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-pp_a"><a href="#val-pp_a" class="anchor"></a><code><span class="keyword">val </span>pp_a : <a href="index.html#type-t">t</a> array <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-debug_a"><a href="#val-debug_a" class="anchor"></a><code><span class="keyword">val </span>debug_a : <a href="index.html#type-t">t</a> array <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Clause/index.html b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Clause/index.html
new file mode 100644
index 00000000..d897380f
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_sat__Solver_types_intf.S.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types_intf.S.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-premise"><a href="#val-premise" class="anchor"></a><code><span class="keyword">val </span>premise : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a></code></dt><dt id="val-attached"><a href="#val-attached" class="anchor"></a><code><span class="keyword">val </span>attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_attached"><a href="#val-set_attached" class="anchor"></a><code><span class="keyword">val </span>set_attached : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-visited"><a href="#val-visited" class="anchor"></a><code><span class="keyword">val </span>visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_visited"><a href="#val-set_visited" class="anchor"></a><code><span class="keyword">val </span>set_visited : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> unit</code></dt><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>The empty clause</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> array <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make_clause name atoms size premise</code> creates a clause with the given attributes. The array's ownership is transferred to the clause, do not mutate it after that.</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../Atom/index.html#type-t">Atom.t</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-premise">premise</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-pp_dimacs"><a href="#val-pp_dimacs" class="anchor"></a><code><span class="keyword">val </span>pp_dimacs : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Formula/index.html b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Formula/index.html
new file mode 100644
index 00000000..551d2570
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_sat__Solver_types_intf.S.Formula)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types_intf.S.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../index.html#type-printer">printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Var/index.html b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Var/index.html
new file mode 100644
index 00000000..db9592f1
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_sat__Solver_types_intf.S.Var)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Solver_types_intf.S.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-var">var</a></code><code></code></dt></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-pos"><a href="#val-pos" class="anchor"></a><code><span class="keyword">val </span>pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a></code></dt><dt id="val-level"><a href="#val-level" class="anchor"></a><code><span class="keyword">val </span>level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-reason"><a href="#val-reason" class="anchor"></a><code><span class="keyword">val </span>reason : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-reason">reason</a> option</code></dt><dt id="val-weight"><a href="#val-weight" class="anchor"></a><code><span class="keyword">val </span>weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float</code></dt><dt id="val-set_level"><a href="#val-set_level" class="anchor"></a><code><span class="keyword">val </span>set_level : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-set_weight"><a href="#val-set_weight" class="anchor"></a><code><span class="keyword">val </span>set_weight : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> float <span>&#8209;&gt;</span> unit</code></dt><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns the variable linked with the given formula, and whether the atom associated with the formula is <code>var.pa</code> or <code>var.na</code></p></dd></dl><dl><dt id="val-seen_both"><a href="#val-seen_both" class="anchor"></a><code><span class="keyword">val </span>seen_both : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>both atoms have been seen?</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the 'seen' field of the variable.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/index.html b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/index.html
new file mode 100644
index 00000000..9f9de6f4
--- /dev/null
+++ b/sidekick/Sidekick_sat__Solver_types_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__Solver_types_intf.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__Solver_types_intf.S</code></h1></header><aside><p>The signatures of clauses used in the Solver.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State for creating new terms, literals, clauses</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><section><header><h2 id="type-definitions"><a href="#type-definitions" class="anchor"></a>Type definitions</h2></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>The types of formulas and proofs. All of these are user-provided.</p></dd></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-var.vid" class="anchored"><td class="def field"><a href="#type-var.vid" class="anchor"></a><code>vid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-var.pa" class="anchored"><td class="def field"><a href="#type-var.pa" class="anchor"></a><code>pa : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the positive atom</p></td></tr><tr id="type-var.na" class="anchored"><td class="def field"><a href="#type-var.na" class="anchor"></a><code>na : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negative atom</p></td></tr><tr id="type-var.v_fields" class="anchored"><td class="def field"><a href="#type-var.v_fields" class="anchor"></a><code><span class="keyword">mutable </span>v_fields : <a href="../Var_fields/index.html#type-t">Var_fields.t</a>;</code></td><td class="doc"><p>bool fields</p></td></tr><tr id="type-var.v_level" class="anchored"><td class="def field"><a href="#type-var.v_level" class="anchor"></a><code><span class="keyword">mutable </span>v_level : int;</code></td><td class="doc"><p>Level of decision/propagation</p></td></tr><tr id="type-var.v_idx" class="anchored"><td class="def field"><a href="#type-var.v_idx" class="anchor"></a><code><span class="keyword">mutable </span>v_idx : int;</code></td><td class="doc"><p>rank in variable heap</p></td></tr><tr id="type-var.v_weight" class="anchored"><td class="def field"><a href="#type-var.v_weight" class="anchor"></a><code><span class="keyword">mutable </span>v_weight : float;</code></td><td class="doc"><p>Variable weight (for the heap)</p></td></tr><tr id="type-var.reason" class="anchored"><td class="def field"><a href="#type-var.reason" class="anchor"></a><code><span class="keyword">mutable </span>reason : <a href="index.html#type-reason">reason</a> option;</code></td><td class="doc"><p>The reason for propagation/decision of the literal</p></td></tr></table><code>}</code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-atom.aid" class="anchored"><td class="def field"><a href="#type-atom.aid" class="anchor"></a><code>aid : int;</code></td><td class="doc"><p>Unique identifier</p></td></tr><tr id="type-atom.var" class="anchored"><td class="def field"><a href="#type-atom.var" class="anchor"></a><code>var : <a href="index.html#type-var">var</a>;</code></td><td class="doc"><p>Link for the parent variable</p></td></tr><tr id="type-atom.neg" class="anchored"><td class="def field"><a href="#type-atom.neg" class="anchor"></a><code>neg : <a href="index.html#type-atom">atom</a>;</code></td><td class="doc"><p>Link for the negation of the atom</p></td></tr><tr id="type-atom.lit" class="anchored"><td class="def field"><a href="#type-atom.lit" class="anchor"></a><code>lit : <a href="index.html#type-formula">formula</a>;</code></td><td class="doc"><p>Wrapped formula</p></td></tr><tr id="type-atom.is_true" class="anchored"><td class="def field"><a href="#type-atom.is_true" class="anchor"></a><code><span class="keyword">mutable </span>is_true : bool;</code></td><td class="doc"><p>Is the atom true ? Conversely, the atom is false iff a.neg.is_true</p></td></tr><tr id="type-atom.watched" class="anchored"><td class="def field"><a href="#type-atom.watched" class="anchor"></a><code><span class="keyword">mutable </span>watched : <a href="index.html#type-clause">clause</a> <a href="../../Sidekick_util/Vec/index.html#type-t">Sidekick_util.Vec.t</a>;</code></td><td class="doc"><p>The vector of clauses that watch this atom</p></td></tr></table><code>}</code><code></code></dt><dd><p>Atoms and variables wrap theory formulas. They exist in the form of triplet: a variable and two atoms. For a formula <code>f</code> in normal form, the variable v points to the positive atom <code>a</code> which wraps <code>f</code>, while <code>a.neg</code> wraps the theory negation of <code>f</code>.</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-clause.name" class="anchored"><td class="def field"><a href="#type-clause.name" class="anchor"></a><code>name : int;</code></td><td class="doc"><p>Clause name, mainly for printing, unique.</p></td></tr><tr id="type-clause.tag" class="anchored"><td class="def field"><a href="#type-clause.tag" class="anchor"></a><code>tag : int option;</code></td><td class="doc"><p>User-provided tag for clauses.</p></td></tr><tr id="type-clause.atoms" class="anchored"><td class="def field"><a href="#type-clause.atoms" class="anchor"></a><code>atoms : <a href="index.html#type-atom">atom</a> array;</code></td><td class="doc"><p>The atoms that constitute the clause.</p></td></tr><tr id="type-clause.cpremise" class="anchored"><td class="def field"><a href="#type-clause.cpremise" class="anchor"></a><code><span class="keyword">mutable </span>cpremise : <a href="index.html#type-premise">premise</a>;</code></td><td class="doc"><p>The premise of the clause, i.e. the justification of why the clause must be satisfied.</p></td></tr><tr id="type-clause.activity" class="anchored"><td class="def field"><a href="#type-clause.activity" class="anchor"></a><code><span class="keyword">mutable </span>activity : float;</code></td><td class="doc"><p>Clause activity, used for the heap heuristics.</p></td></tr><tr id="type-clause.c_flags" class="anchored"><td class="def field"><a href="#type-clause.c_flags" class="anchor"></a><code><span class="keyword">mutable </span>c_flags : <a href="../C_fields/index.html#type-t">C_fields.t</a>;</code></td><td class="doc"><p>Boolean flags for the clause</p></td></tr></table><code>}</code><code></code></dt><dd><p>The type of clauses. Each clause generated should be true, i.e. enforced by the current problem (for more information, see the cpremise field).</p></dd></dl><dl><dt id="type-reason"><a href="#type-reason" class="anchor"></a><code><span class="keyword">type </span>reason</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-reason.Decision" class="anchored"><td class="def constructor"><a href="#type-reason.Decision" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decision</span></code></td><td class="doc"><p>The atom has been decided by the sat solver</p></td></tr><tr id="type-reason.Bcp" class="anchored"><td class="def constructor"><a href="#type-reason.Bcp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bcp</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a></code></td><td class="doc"><p>The atom has been propagated by the given clause</p></td></tr></table><code></code></dt><dd><p>Reasons of propagation/decision of atoms.</p></dd></dl><dl><dt id="type-premise"><a href="#type-premise" class="anchor"></a><code><span class="keyword">type </span>premise</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-premise.Hyp" class="anchored"><td class="def constructor"><a href="#type-premise.Hyp" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hyp</span></code></td><td class="doc"><p>The clause is a hypothesis, provided by the user.</p></td></tr><tr id="type-premise.Local" class="anchored"><td class="def constructor"><a href="#type-premise.Local" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Local</span></code></td><td class="doc"><p>The clause is a 1-atom clause, where the atom is a local assumption</p></td></tr><tr id="type-premise.Lemma" class="anchored"><td class="def constructor"><a href="#type-premise.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a></code></td><td class="doc"><p>The clause is a theory-provided tautology, with the given proof.</p></td></tr><tr id="type-premise.History" class="anchored"><td class="def constructor"><a href="#type-premise.History" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">History</span><span class="keyword"> of </span><a href="index.html#type-clause">clause</a> list</code></td><td class="doc"><p>The clause can be obtained by resolution of the clauses in the list. If the list has a single element <code>c</code> , then the clause can be obtained by simplifying <code>c</code> (i.e eliminating doublons in its atom list). For a premise <code>History [a_1 :: ... :: a_n]</code> (<code>n &gt; 0</code>) the clause is obtained by performing resolution of <code>a_1</code> with <code>a_2</code>, and then performing a resolution step between the result and <code>a_3</code>, etc... Of course, each of the clause <code>a_i</code> also has its own premise.</p></td></tr></table><code></code></dt><dd><p>Premises for clauses. Indeed each clause generated during a run of the solver should be satisfied, the premise is the justification of why it should be satisfied by the solver.</p></dd></dl></section><section><header><h2 id="decisions-and-propagations"><a href="#decisions-and-propagations" class="anchor"></a>Decisions and propagations</h2></header></section><section><header><h2 id="elements"><a href="#elements" class="anchor"></a>Elements</h2></header><dl><dt id="val-nb_elt"><a href="#val-nb_elt" class="anchor"></a><code><span class="keyword">val </span>nb_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-get_elt"><a href="#val-get_elt" class="anchor"></a><code><span class="keyword">val </span>get_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a></code></dt><dt id="val-iter_elt"><a href="#val-iter_elt" class="anchor"></a><code><span class="keyword">val </span>iter_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Read access to the vector of variables created</p></dd></dl></section><section><header><h2 id="variables,-literals-&amp;-clauses"><a href="#variables,-literals-&amp;-clauses" class="anchor"></a>Variables, Literals &amp; Clauses</h2></header><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Theory_intf/.jbuilder-keep b/sidekick/Sidekick_sat__Theory_intf/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_sat__Theory_intf/index.html b/sidekick/Sidekick_sat__Theory_intf/index.html
new file mode 100644
index 00000000..5fc09841
--- /dev/null
+++ b/sidekick/Sidekick_sat__Theory_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_sat__Theory_intf (sidekick.Sidekick_sat__Theory_intf)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Theory_intf</code></h1><p>SMT Theory</p><p>This module defines what a theory must implement in order to be used in an SMT solver.</p></header><dl><dt id="type-negated"><a href="#type-negated" class="anchor"></a><code><span class="keyword">type </span>negated</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-negated.Negated" class="anchored"><td class="def constructor"><a href="#type-negated.Negated" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Negated</span></code></td><td class="doc"><p>changed sign</p></td></tr><tr id="type-negated.Same_sign" class="anchored"><td class="def constructor"><a href="#type-negated.Same_sign" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Same_sign</span></code></td><td class="doc"><p>kept sign</p></td></tr></table><code></code></dt><dd><p>This type is used during the normalisation of formulas. See <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.norm&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.norm</span> for more details.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>('formula, 'proof) res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span></code></td><td class="doc"><p>The current set of assumptions is satisfiable.</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span><span class="type-var">'formula</span> list<span class="keyword"> * </span><span class="type-var">'proof</span></code></td><td class="doc"><p>The current set of assumptions is *NOT* satisfiable, and here is a theory tautology (with its proof), for which every litteral is false under the current assumptions.</p></td></tr></table><code></code></dt><dd><p>Type returned by the theory. Formulas in the unsat clause must come from the current set of assumptions, i.e must have been encountered in a slice.</p></dd></dl><dl><dt id="type-actions"><a href="#type-actions" class="anchor"></a><code><span class="keyword">type </span>('form, 'proof) actions</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-actions.Actions" class="anchored"><td class="def constructor"><a href="#type-actions.Actions" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Actions</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-actions.push_persistent" class="anchored"><td class="def field"><a href="#type-actions.push_persistent" class="anchor"></a><code>push_persistent : <span class="type-var">'form</span> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Allows to add a persistent clause to the solver.</p></td></tr><tr id="type-actions.push_local" class="anchored"><td class="def field"><a href="#type-actions.push_local" class="anchor"></a><code>push_local : <span class="type-var">'form</span> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Allows to add a local clause to the solver. The clause will be removed after backtracking.</p></td></tr><tr id="type-actions.on_backtrack" class="anchored"><td class="def field"><a href="#type-actions.on_backtrack" class="anchor"></a><code>on_backtrack : (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p><code>on_backtrack f</code> calls <code>f</code> when the main solver backtracks</p></td></tr><tr id="type-actions.propagate" class="anchored"><td class="def field"><a href="#type-actions.propagate" class="anchor"></a><code>propagate : <span class="type-var">'form</span> <span>&#8209;&gt;</span> <span class="type-var">'form</span> list <span>&#8209;&gt;</span> <span class="type-var">'proof</span> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p><code>propagate lit causes proof</code> informs the solver to propagate <code>lit</code>, with the reason that the clause <code>causes =&gt; lit</code> is a theory tautology. It is faster than pushing the associated clause but the clause will not be remembered by the sat solver, i.e it will not be used by the solver to do boolean propagation.</p></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dd><p>Actions given to the theory during initialization, to be used at any time</p></dd></dl><dl><dt id="type-slice_actions"><a href="#type-slice_actions" class="anchor"></a><code><span class="keyword">type </span>('form, 'proof) slice_actions</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-slice_actions.Slice_acts" class="anchored"><td class="def constructor"><a href="#type-slice_actions.Slice_acts" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Slice_acts</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-slice_actions.slice_iter" class="anchored"><td class="def field"><a href="#type-slice_actions.slice_iter" class="anchor"></a><code>slice_iter : (<span class="type-var">'form</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>iterate on the slice of the trail</p></td></tr></table><code>}</code><code></code></td><td class="doc"><p>The type for a slice. Slices are some kind of view of the current propagation queue. They allow to look at the propagated literals, and to add new clauses to the solver.</p></td></tr></table><code></code></dt></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Theory_intf/module-type-S/Form/index.html b/sidekick/Sidekick_sat__Theory_intf/module-type-S/Form/index.html
new file mode 100644
index 00000000..89c060bb
--- /dev/null
+++ b/sidekick/Sidekick_sat__Theory_intf/module-type-S/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_sat__Theory_intf.S.Form)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_sat__Theory_intf.S.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../index.html#type-negated">negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_sat__Theory_intf/module-type-S/index.html b/sidekick/Sidekick_sat__Theory_intf/module-type-S/index.html
new file mode 100644
index 00000000..2e70241c
--- /dev/null
+++ b/sidekick/Sidekick_sat__Theory_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_sat__Theory_intf.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_sat__Theory_intf.S</code></h1></header><div class="doc"><h2 id="signature-for-theories-to-be-given-to-the-solver."><a href="#signature-for-theories-to-be-given-to-the-solver." class="anchor"></a>Signature for theories to be given to the Solver.</h2></div><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-actions">actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-slice_actions">slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-res">res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-slice_actions">slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../index.html#type-res">res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/.jbuilder-keep b/sidekick/Sidekick_smt/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt/Ast/index.html b/sidekick/Sidekick_smt/Ast/index.html
new file mode 100644
index 00000000..c18d1bce
--- /dev/null
+++ b/sidekick/Sidekick_smt/Ast/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Ast (sidekick.Sidekick_smt.Ast)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Ast</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Bag/index.html b/sidekick/Sidekick_smt/Bag/index.html
new file mode 100644
index 00000000..cd42a2e5
--- /dev/null
+++ b/sidekick/Sidekick_smt/Bag/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Bag (sidekick.Sidekick_smt.Bag)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Bag</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Config/index.html b/sidekick/Sidekick_smt/Config/index.html
new file mode 100644
index 00000000..df82c3ca
--- /dev/null
+++ b/sidekick/Sidekick_smt/Config/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Config (sidekick.Sidekick_smt.Config)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Config</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Congruence_closure/index.html b/sidekick/Sidekick_smt/Congruence_closure/index.html
new file mode 100644
index 00000000..3ec30ba3
--- /dev/null
+++ b/sidekick/Sidekick_smt/Congruence_closure/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Congruence_closure (sidekick.Sidekick_smt.Congruence_closure)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Congruence_closure</code></h1></header><section><header><h2 id="congruence-closure"><a href="#congruence-closure" class="anchor"></a>Congruence Closure</h2></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Global state of the congruence closure</p></dd></dl><dl><dt id="type-node"><a href="#type-node" class="anchor"></a><code><span class="keyword">type </span>node</code><code><span class="keyword"> = </span><a href="../Equiv_class/index.html#type-t">Equiv_class.t</a></code><code></code></dt><dd><p>Node in the congruence closure</p></dd></dl><dl><dt id="type-repr"><a href="#type-repr" class="anchor"></a><code><span class="keyword">type </span>repr</code><code><span class="keyword"> = </span><a href="../Equiv_class/index.html#type-t">Equiv_class.t</a></code><code></code></dt><dd><p>Node that is currently a representative</p></dd></dl><dl><dt id="type-actions"><a href="#type-actions" class="anchor"></a><code><span class="keyword">type </span>actions</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-actions.on_backtrack" class="anchored"><td class="def field"><a href="#type-actions.on_backtrack" class="anchor"></a><code>on_backtrack : (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Register a callback to be invoked upon backtracking below the current level</p></td></tr><tr id="type-actions.on_merge" class="anchored"><td class="def field"><a href="#type-actions.on_merge" class="anchor"></a><code>on_merge : <a href="index.html#type-repr">repr</a> <span>&#8209;&gt;</span> <a href="index.html#type-repr">repr</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Call this when two classes are merged</p></td></tr><tr id="type-actions.raise_conflict" class="anchored"><td class="def field"><a href="#type-actions.raise_conflict" class="anchor"></a><code>raise_conflict : a. <a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <span class="type-var">'a</span>;</code></td><td class="doc"><p>Report a conflict</p></td></tr><tr id="type-actions.propagate" class="anchored"><td class="def field"><a href="#type-actions.propagate" class="anchor"></a><code>propagate : <a href="../Lit/index.html#type-t">Lit.t</a> <span>&#8209;&gt;</span> <a href="../Explanation/index.html#type-t">Explanation.t</a> <a href="../Bag/index.html#type-t">Bag.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Propagate a literal</p></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:int <span>&#8209;&gt;</span> actions:<a href="index.html#type-actions">actions</a> <span>&#8209;&gt;</span> <a href="../Term/index.html#type-state">Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new congruence closure.</p><dl><dt>parameter acts</dt><dd><p>the actions available to the congruence closure</p></dd></dl></dd></dl><dl><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="index.html#type-repr">repr</a></code></dt><dd><p>Current representative</p></dd></dl><dl><dt id="val-same_class"><a href="#val-same_class" class="anchor"></a><code><span class="keyword">val </span>same_class : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Are these two classes the same in the current CC?</p></dd></dl><dl><dt id="val-union"><a href="#val-union" class="anchor"></a><code><span class="keyword">val </span>union : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Merge the two equivalence classes. Will be undone on backtracking.</p></dd></dl><dl><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Is the term properly added to the congruence closure?</p></dd></dl><dl><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a></code></dt><dd><p>Add the term to the congruence closure, if not present already. Will be backtracked.</p></dd></dl><dl><dt id="val-add_seq"><a href="#val-add_seq" class="anchor"></a><code><span class="keyword">val </span>add_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> Sequence.t <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a sequence of terms to the congruence closure</p></dd></dl><dl><dt id="val-all_classes"><a href="#val-all_classes" class="anchor"></a><code><span class="keyword">val </span>all_classes : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-repr">repr</a> Sequence.t</code></dt><dd><p>All current classes</p></dd></dl><dl><dt id="val-assert_lit"><a href="#val-assert_lit" class="anchor"></a><code><span class="keyword">val </span>assert_lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Lit/index.html#type-t">Lit.t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.</p></dd></dl><dl><dt id="val-assert_eq"><a href="#val-assert_eq" class="anchor"></a><code><span class="keyword">val </span>assert_eq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-assert_distinct"><a href="#val-assert_distinct" class="anchor"></a><code><span class="keyword">val </span>assert_distinct : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> list <span>&#8209;&gt;</span> neq:<a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>assert_distinct l ~expl:u e</code> asserts all elements of <code>l</code> are distinct with explanation <code>e</code> precond: <code>u = distinct l</code></p></dd></dl><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-final_check"><a href="#val-final_check" class="anchor"></a><code><span class="keyword">val </span>final_check : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-explain_eq_n"><a href="#val-explain_eq_n" class="anchor"></a><code><span class="keyword">val </span>explain_eq_n : ?&#8288;init:<a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code></dt><dd><p>explain why the two nodes are equal</p></dd></dl><dl><dt id="val-explain_eq_t"><a href="#val-explain_eq_t" class="anchor"></a><code><span class="keyword">val </span>explain_eq_t : ?&#8288;init:<a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code></dt><dd><p>explain why the two terms are equal</p></dd></dl><dl><dt id="val-explain_unfold_bag"><a href="#val-explain_unfold_bag" class="anchor"></a><code><span class="keyword">val </span>explain_unfold_bag : ?&#8288;init:<a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> <a href="../Bag/index.html#type-t">Bag.t</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code></dt><dt id="val-explain_unfold_seq"><a href="#val-explain_unfold_seq" class="anchor"></a><code><span class="keyword">val </span>explain_unfold_seq : ?&#8288;init:<a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> Sequence.t <span>&#8209;&gt;</span> <a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code></dt><dd><p>Unfold those explanations into a complete set of literals implying them</p></dd></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Cst/index.html b/sidekick/Sidekick_smt/Cst/index.html
new file mode 100644
index 00000000..ff419c95
--- /dev/null
+++ b/sidekick/Sidekick_smt/Cst/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Cst (sidekick.Sidekick_smt.Cst)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Cst</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Solver_types/index.html#type-cst">Solver_types.cst</a></code><code></code></dt></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></dt><dt id="val-ty"><a href="#val-ty" class="anchor"></a><code><span class="keyword">val </span>ty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Ty/index.html#type-t">Ty.t</a></code></dt><dt id="val-make_cstor"><a href="#val-make_cstor" class="anchor"></a><code><span class="keyword">val </span>make_cstor : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a> lazy_t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_proj"><a href="#val-make_proj" class="anchor"></a><code><span class="keyword">val </span>make_proj : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a> lazy_t <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_tester"><a href="#val-make_tester" class="anchor"></a><code><span class="keyword">val </span>make_tester : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a> lazy_t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_defined"><a href="#val-make_defined" class="anchor"></a><code><span class="keyword">val </span>make_defined : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> lazy_t <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-cst_defined_info">Solver_types.cst_defined_info</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_undef"><a href="#val-make_undef" class="anchor"></a><code><span class="keyword">val </span>make_undef : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-arity"><a href="#val-arity" class="anchor"></a><code><span class="keyword">val </span>arity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-as_undefined"><a href="#val-as_undefined" class="anchor"></a><code><span class="keyword">val </span>as_undefined : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../Ty/index.html#type-t">Ty.t</a>) option</code></dt><dt id="val-as_undefined_exn"><a href="#val-as_undefined_exn" class="anchor"></a><code><span class="keyword">val </span>as_undefined_exn : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../Ty/index.html#type-t">Ty.t</a></code></dt><dt id="val-is_finite_cstor"><a href="#val-is_finite_cstor" class="anchor"></a><code><span class="keyword">val </span>is_finite_cstor : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer</code></dt></dl><article id="module-Map"><a href="#module-Map" class="anchor"></a><code><span class="keyword">module </span>Map : CCMap.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Map">Map</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Equiv_class/index.html b/sidekick/Sidekick_smt/Equiv_class/index.html
new file mode 100644
index 00000000..7ecfadff
--- /dev/null
+++ b/sidekick/Sidekick_smt/Equiv_class/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Equiv_class (sidekick.Sidekick_smt.Equiv_class)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Equiv_class</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Explanation/Set/index.html b/sidekick/Sidekick_smt/Explanation/Set/index.html
new file mode 100644
index 00000000..7412ea01
--- /dev/null
+++ b/sidekick/Sidekick_smt/Explanation/Set/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Set (sidekick.Sidekick_smt.Explanation.Set)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Explanation.Set</code></h1></header><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code><span class="keyword"> = </span><a href="../../Solver_types/index.html#type-explanation">Solver_types.explanation</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-singleton"><a href="#val-singleton" class="anchor"></a><code><span class="keyword">val </span>singleton : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-union"><a href="#val-union" class="anchor"></a><code><span class="keyword">val </span>union : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-inter"><a href="#val-inter" class="anchor"></a><code><span class="keyword">val </span>inter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-diff"><a href="#val-diff" class="anchor"></a><code><span class="keyword">val </span>diff : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-subset"><a href="#val-subset" class="anchor"></a><code><span class="keyword">val </span>subset : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-map"><a href="#val-map" class="anchor"></a><code><span class="keyword">val </span>map : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a>) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-for_all"><a href="#val-for_all" class="anchor"></a><code><span class="keyword">val </span>for_all : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-exists"><a href="#val-exists" class="anchor"></a><code><span class="keyword">val </span>exists : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-partition"><a href="#val-partition" class="anchor"></a><code><span class="keyword">val </span>partition : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="index.html#type-t">t</a></code></dt><dt id="val-cardinal"><a href="#val-cardinal" class="anchor"></a><code><span class="keyword">val </span>cardinal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-elements"><a href="#val-elements" class="anchor"></a><code><span class="keyword">val </span>elements : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> list</code></dt><dt id="val-min_elt"><a href="#val-min_elt" class="anchor"></a><code><span class="keyword">val </span>min_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-max_elt"><a href="#val-max_elt" class="anchor"></a><code><span class="keyword">val </span>max_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-choose"><a href="#val-choose" class="anchor"></a><code><span class="keyword">val </span>choose : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-split"><a href="#val-split" class="anchor"></a><code><span class="keyword">val </span>split : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span>bool<span class="keyword"> * </span><a href="index.html#type-t">t</a></code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-min_elt_opt"><a href="#val-min_elt_opt" class="anchor"></a><code><span class="keyword">val </span>min_elt_opt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-max_elt_opt"><a href="#val-max_elt_opt" class="anchor"></a><code><span class="keyword">val </span>max_elt_opt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-choose_opt"><a href="#val-choose_opt" class="anchor"></a><code><span class="keyword">val </span>choose_opt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-find_first"><a href="#val-find_first" class="anchor"></a><code><span class="keyword">val </span>find_first : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-find_first_opt"><a href="#val-find_first_opt" class="anchor"></a><code><span class="keyword">val </span>find_first_opt : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-find_last"><a href="#val-find_last" class="anchor"></a><code><span class="keyword">val </span>find_last : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-find_last_opt"><a href="#val-find_last_opt" class="anchor"></a><code><span class="keyword">val </span>find_last_opt : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-of_seq"><a href="#val-of_seq" class="anchor"></a><code><span class="keyword">val </span>of_seq : <a href="index.html#type-elt">elt</a> CCSet.sequence <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add_seq"><a href="#val-add_seq" class="anchor"></a><code><span class="keyword">val </span>add_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> CCSet.sequence <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> CCSet.sequence</code></dt><dt id="val-of_list"><a href="#val-of_list" class="anchor"></a><code><span class="keyword">val </span>of_list : <a href="index.html#type-elt">elt</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add_list"><a href="#val-add_list" class="anchor"></a><code><span class="keyword">val </span>add_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list"><a href="#val-to_list" class="anchor"></a><code><span class="keyword">val </span>to_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : ?&#8288;start:string <span>&#8209;&gt;</span> ?&#8288;stop:string <span>&#8209;&gt;</span> ?&#8288;sep:string <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> CCSet.printer <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> CCSet.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Explanation/index.html b/sidekick/Sidekick_smt/Explanation/index.html
new file mode 100644
index 00000000..00bd639a
--- /dev/null
+++ b/sidekick/Sidekick_smt/Explanation/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Explanation (sidekick.Sidekick_smt.Explanation)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Explanation</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-t.E_reduction" class="anchored"><td class="def constructor"><a href="#type-t.E_reduction" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_reduction</span></code></td></tr><tr id="type-t.E_lit" class="anchored"><td class="def constructor"><a href="#type-t.E_lit" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_lit</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-lit">Solver_types.lit</a></code></td></tr><tr id="type-t.E_congruence" class="anchored"><td class="def constructor"><a href="#type-t.E_congruence" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_congruence</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a><span class="keyword"> * </span><a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a></code></td></tr><tr id="type-t.E_injectivity" class="anchored"><td class="def constructor"><a href="#type-t.E_injectivity" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_injectivity</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a><span class="keyword"> * </span><a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a></code></td></tr><tr id="type-t.E_reduce_eq" class="anchored"><td class="def constructor"><a href="#type-t.E_reduce_eq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_reduce_eq</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a><span class="keyword"> * </span><a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a></code></td></tr><tr id="type-t.E_custom" class="anchored"><td class="def constructor"><a href="#type-t.E_custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-t.name" class="anchored"><td class="def field"><a href="#type-t.name" class="anchor"></a><code>name : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a>;</code></td></tr><tr id="type-t.args" class="anchored"><td class="def field"><a href="#type-t.args" class="anchor"></a><code>args : <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> list;</code></td></tr><tr id="type-t.pp" class="anchored"><td class="def field"><a href="#type-t.pp" class="anchor"></a><code>pp : (<a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> list) <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt></dl><dl><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> CCOrd.t</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.t <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-explanation">Solver_types.explanation</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="../Solver_types/index.html#type-lit">Solver_types.lit</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><article id="module-Set"><a href="#module-Set" class="anchor"></a><code><span class="keyword">module </span><a href="Set/index.html">Set</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Hash/index.html b/sidekick/Sidekick_smt/Hash/index.html
new file mode 100644
index 00000000..86356ed2
--- /dev/null
+++ b/sidekick/Sidekick_smt/Hash/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Hash (sidekick.Sidekick_smt.Hash)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Hash</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <span>&#8209;&gt;</span> int</code><code></code></dt></dl><dl><dt id="val-bool"><a href="#val-bool" class="anchor"></a><code><span class="keyword">val </span>bool : bool <a href="index.html#type-t">t</a></code></dt><dt id="val-int"><a href="#val-int" class="anchor"></a><code><span class="keyword">val </span>int : int <a href="index.html#type-t">t</a></code></dt><dt id="val-string"><a href="#val-string" class="anchor"></a><code><span class="keyword">val </span>string : string <a href="index.html#type-t">t</a></code></dt><dt id="val-combine"><a href="#val-combine" class="anchor"></a><code><span class="keyword">val </span>combine : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pair"><a href="#val-pair" class="anchor"></a><code><span class="keyword">val </span>pair : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'b</span>) <a href="index.html#type-t">t</a></code></dt><dt id="val-opt"><a href="#val-opt" class="anchor"></a><code><span class="keyword">val </span>opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option <a href="index.html#type-t">t</a></code></dt><dt id="val-list"><a href="#val-list" class="anchor"></a><code><span class="keyword">val </span>list : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list <a href="index.html#type-t">t</a></code></dt><dt id="val-array"><a href="#val-array" class="anchor"></a><code><span class="keyword">val </span>array : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> array <a href="index.html#type-t">t</a></code></dt><dt id="val-iarray"><a href="#val-iarray" class="anchor"></a><code><span class="keyword">val </span>iarray : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <a href="index.html#type-t">t</a></code></dt><dt id="val-seq"><a href="#val-seq" class="anchor"></a><code><span class="keyword">val </span>seq : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t <a href="index.html#type-t">t</a></code></dt><dt id="val-combine2"><a href="#val-combine2" class="anchor"></a><code><span class="keyword">val </span>combine2 : int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int</code></dt><dt id="val-combine3"><a href="#val-combine3" class="anchor"></a><code><span class="keyword">val </span>combine3 : int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int</code></dt><dt id="val-combine4"><a href="#val-combine4" class="anchor"></a><code><span class="keyword">val </span>combine4 : int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int</code></dt><dt id="val-poly"><a href="#val-poly" class="anchor"></a><code><span class="keyword">val </span>poly : <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>the regular polymorphic hash function</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Het_map/index.html b/sidekick/Sidekick_smt/Het_map/index.html
new file mode 100644
index 00000000..40f307b1
--- /dev/null
+++ b/sidekick/Sidekick_smt/Het_map/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Het_map (sidekick.Sidekick_smt.Het_map)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Het_map</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Lit/index.html b/sidekick/Sidekick_smt/Lit/index.html
new file mode 100644
index 00000000..da331c01
--- /dev/null
+++ b/sidekick/Sidekick_smt/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_smt.Lit)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Lit</code></h1></header><section><header><h2 id="literals"><a href="#literals" class="anchor"></a>Literals</h2></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Solver_types/index.html#type-lit">Solver_types.lit</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.lit_view" class="anchored"><td class="def field"><a href="#type-t.lit_view" class="anchor"></a><code>lit_view : <a href="../Solver_types/index.html#type-lit_view">Solver_types.lit_view</a>;</code></td></tr><tr id="type-t.lit_sign" class="anchored"><td class="def field"><a href="#type-t.lit_sign" class="anchor"></a><code>lit_sign : bool;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-view"><a href="#type-view" class="anchor"></a><code><span class="keyword">type </span>view</code><code><span class="keyword"> = </span><a href="../Solver_types/index.html#type-lit_view">Solver_types.lit_view</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-view.Lit_fresh" class="anchored"><td class="def constructor"><a href="#type-view.Lit_fresh" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_fresh</span><span class="keyword"> of </span><a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></td></tr><tr id="type-view.Lit_atom" class="anchored"><td class="def constructor"><a href="#type-view.Lit_atom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_atom</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-term">Solver_types.term</a></code></td></tr><tr id="type-view.Lit_expanded" class="anchored"><td class="def constructor"><a href="#type-view.Lit_expanded" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_expanded</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-term">Solver_types.term</a></code></td></tr></table><code></code></dt></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-sign"><a href="#val-sign" class="anchor"></a><code><span class="keyword">val </span>sign : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-view"><a href="#val-view" class="anchor"></a><code><span class="keyword">val </span>view : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-lit_view">Solver_types.lit_view</a></code></dt><dt id="val-as_atom"><a href="#val-as_atom" class="anchor"></a><code><span class="keyword">val </span>as_atom : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="../Solver_types/index.html#type-term">Solver_types.term</a><span class="keyword"> * </span>bool) option</code></dt><dt id="val-fresh_with"><a href="#val-fresh_with" class="anchor"></a><code><span class="keyword">val </span>fresh_with : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-fresh"><a href="#val-fresh" class="anchor"></a><code><span class="keyword">val </span>fresh : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-atom"><a href="#val-atom" class="anchor"></a><code><span class="keyword">val </span>atom : ?&#8288;sign:bool <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_test"><a href="#val-cstor_test" class="anchor"></a><code><span class="keyword">val </span>cstor_test : <a href="../Term/index.html#type-state">Term.state</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-expanded"><a href="#val-expanded" class="anchor"></a><code><span class="keyword">val </span>expanded : <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : <a href="index.html#type-t">t</a> <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer</code></dt><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../Sidekick_sat/index.html#type-negated">Sidekick_sat.negated</a></code></dt></dl><article id="module-Set"><a href="#module-Set" class="anchor"></a><code><span class="keyword">module </span>Set : CCSet.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Set">Set</a>.elt<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Model/index.html b/sidekick/Sidekick_smt/Model/index.html
new file mode 100644
index 00000000..465028ea
--- /dev/null
+++ b/sidekick/Sidekick_smt/Model/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Model (sidekick.Sidekick_smt.Model)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Model</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Solver/index.html b/sidekick/Sidekick_smt/Solver/index.html
new file mode 100644
index 00000000..4e2a1ad1
--- /dev/null
+++ b/sidekick/Sidekick_smt/Solver/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Solver (sidekick.Sidekick_smt.Solver)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Solver</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Solver_types/index.html b/sidekick/Sidekick_smt/Solver_types/index.html
new file mode 100644
index 00000000..23e0402b
--- /dev/null
+++ b/sidekick/Sidekick_smt/Solver_types/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Solver_types (sidekick.Sidekick_smt.Solver_types)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Solver_types</code></h1></header><article id="module-Fmt"><a href="#module-Fmt" class="anchor"></a><code><span class="keyword">module </span>Fmt = CCFormat</code></article><article id="module-Node_bits"><a href="#module-Node_bits" class="anchor"></a><code><span class="keyword">module </span>Node_bits : CCBitField.S</code></article><dl><dt id="type-lazily_expanded"><a href="#type-lazily_expanded" class="anchor"></a><code><span class="keyword">type </span>'a lazily_expanded</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-lazily_expanded.Lazy_some" class="anchored"><td class="def constructor"><a href="#type-lazily_expanded.Lazy_some" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lazy_some</span><span class="keyword"> of </span><span class="type-var">'a</span></code></td></tr><tr id="type-lazily_expanded.Lazy_none" class="anchored"><td class="def constructor"><a href="#type-lazily_expanded.Lazy_none" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lazy_none</span></code></td></tr></table><code></code></dt><dt id="type-term"><a href="#type-term" class="anchor"></a><code><span class="keyword">type </span>term</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-term.term_id" class="anchored"><td class="def field"><a href="#type-term.term_id" class="anchor"></a><code><span class="keyword">mutable </span>term_id : int;</code></td></tr><tr id="type-term.term_ty" class="anchored"><td class="def field"><a href="#type-term.term_ty" class="anchor"></a><code><span class="keyword">mutable </span>term_ty : <a href="index.html#type-ty">ty</a>;</code></td></tr><tr id="type-term.term_cell" class="anchored"><td class="def field"><a href="#type-term.term_cell" class="anchor"></a><code>term_cell : <a href="index.html#type-term">term</a> <a href="index.html#type-term_cell">term_cell</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-term_cell"><a href="#type-term_cell" class="anchor"></a><code><span class="keyword">type </span>'a term_cell</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-term_cell.Bool" class="anchored"><td class="def constructor"><a href="#type-term_cell.Bool" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bool</span><span class="keyword"> of </span>bool</code></td></tr><tr id="type-term_cell.App_cst" class="anchored"><td class="def constructor"><a href="#type-term_cell.App_cst" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">App_cst</span><span class="keyword"> of </span><a href="index.html#type-cst">cst</a><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></td></tr><tr id="type-term_cell.If" class="anchored"><td class="def constructor"><a href="#type-term_cell.If" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">If</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span></code></td></tr><tr id="type-term_cell.Case" class="anchored"><td class="def constructor"><a href="#type-term_cell.Case" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Case</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t</code></td></tr><tr id="type-term_cell.Custom" class="anchored"><td class="def constructor"><a href="#type-term_cell.Custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-term_cell.view" class="anchored"><td class="def field"><a href="#type-term_cell.view" class="anchor"></a><code>view : <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a>;</code></td></tr><tr id="type-term_cell.tc" class="anchored"><td class="def field"><a href="#type-term_cell.tc" class="anchor"></a><code>tc : <a href="index.html#type-term_view_tc">term_view_tc</a>;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-term_view_tc"><a href="#type-term_view_tc" class="anchor"></a><code><span class="keyword">type </span>term_view_tc</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-term_view_tc.tc_t_pp" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_pp" class="anchor"></a><code>tc_t_pp : a. <span class="type-var">'a</span> <a href="index.html#module-Fmt">Fmt</a>.printer <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <a href="index.html#module-Fmt">Fmt</a>.printer;</code></td></tr><tr id="type-term_view_tc.tc_t_equal" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_equal" class="anchor"></a><code>tc_t_equal : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> CCEqual.t;</code></td></tr><tr id="type-term_view_tc.tc_t_hash" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_hash" class="anchor"></a><code>tc_t_hash : a. <span class="type-var">'a</span> <a href="../Hash/index.html#type-t">Hash.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <a href="../Hash/index.html#type-t">Hash.t</a>;</code></td></tr><tr id="type-term_view_tc.tc_t_ty" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_ty" class="anchor"></a><code>tc_t_ty : a. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a>;</code></td></tr><tr id="type-term_view_tc.tc_t_is_semantic" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_is_semantic" class="anchor"></a><code>tc_t_is_semantic : a. <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> bool;</code></td></tr><tr id="type-term_view_tc.tc_t_solve" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_solve" class="anchor"></a><code>tc_t_solve : <a href="index.html#type-cc_node">cc_node</a> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-cc_node">cc_node</a> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-solve_result">solve_result</a>;</code></td></tr><tr id="type-term_view_tc.tc_t_sub" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_sub" class="anchor"></a><code>tc_t_sub : a. <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-term_view_tc.tc_t_abs" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_abs" class="anchor"></a><code>tc_t_abs : self:<a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a><span class="keyword"> * </span>bool;</code></td></tr><tr id="type-term_view_tc.tc_t_relevant" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_relevant" class="anchor"></a><code>tc_t_relevant : a. <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-term_view_tc.tc_t_subst" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_subst" class="anchor"></a><code>tc_t_subst : a b. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-term_view_custom">term_view_custom</a> option;</code></td></tr><tr id="type-term_view_tc.tc_t_explain" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_explain" class="anchor"></a><code>tc_t_explain : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span>) list;</code></td></tr></table><code>}</code><code></code></dt><dd><p>Methods on the custom term view whose leaves are <code>'a</code>. Terms must be comparable, hashable, printable, and provide some additional theory handles.</p><ul><li><code>tc_t_sub</code> must return all immediate subterms (all <code>'a</code> contained in the term)</li></ul><ul><li><code>tc_t_subst</code> must use the function to replace all subterms (all the <code>'a</code> returned by <code>tc_t_sub</code>) by <code>'b</code></li></ul><ul><li><code>tc_t_relevant</code> must return a subset of <code>tc_t_sub</code> (possibly the same set). The terms it returns will be activated and evaluated whenever possible. Terms in <code>tc_t_sub t \ tc_t_relevant t</code> are considered for congruence but not for evaluation.</li></ul><ul><li>If <code>t1</code> and <code>t2</code> satisfy <code>tc_t_is_semantic</code> and have the same type, then <code>tc_t_solve t1 t2</code> must succeed by returning some <code>solve_result</code>.</li></ul><ul><li>if <code>tc_t_equal eq a b = true</code>, then <code>tc_t_explain eq a b</code> must return all the pairs of equal subterms that are sufficient for <code>a</code> and <code>b</code> to be equal.</li></ul></dd></dl><dl><dt id="type-term_view_custom"><a href="#type-term_view_custom" class="anchor"></a><code><span class="keyword">type </span>'a term_view_custom</code><code></code><code><span class="keyword"> = </span></code><code><span class="keyword">..</span></code><code></code></dt><dd><p>Custom term view for theories</p></dd></dl><dl><dt id="type-solve_result"><a href="#type-solve_result" class="anchor"></a><code><span class="keyword">type </span>solve_result</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-solve_result.Solve_ok" class="anchored"><td class="def constructor"><a href="#type-solve_result.Solve_ok" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Solve_ok</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-solve_result.subst" class="anchored"><td class="def field"><a href="#type-solve_result.subst" class="anchor"></a><code>subst : (<a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-term">term</a>) list;</code></td><td class="doc"><p>binding leaves to other terms</p></td></tr></table><code>}</code><code></code></td><td class="doc"><p>Success, the two terms being equal is equivalent to the given substitution</p></td></tr><tr id="type-solve_result.Solve_fail" class="anchored"><td class="def constructor"><a href="#type-solve_result.Solve_fail" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Solve_fail</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-solve_result.expl" class="anchored"><td class="def field"><a href="#type-solve_result.expl" class="anchor"></a><code>expl : <a href="index.html#type-explanation">explanation</a>;</code></td></tr></table><code>}</code><code></code></td><td class="doc"><p>Failure, because of the given explanation. The two terms cannot be equal</p></td></tr></table><code></code></dt><dd><p>The result of a call to <code>solve</code>.</p></dd></dl><dl><dt id="type-cc_node"><a href="#type-cc_node" class="anchor"></a><code><span class="keyword">type </span>cc_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-cc_node.n_term" class="anchored"><td class="def field"><a href="#type-cc_node.n_term" class="anchor"></a><code>n_term : <a href="index.html#type-term">term</a>;</code></td></tr><tr id="type-cc_node.n_bits" class="anchored"><td class="def field"><a href="#type-cc_node.n_bits" class="anchor"></a><code><span class="keyword">mutable </span>n_bits : <a href="index.html#module-Node_bits">Node_bits</a>.t;</code></td></tr><tr id="type-cc_node.n_parents" class="anchored"><td class="def field"><a href="#type-cc_node.n_parents" class="anchor"></a><code><span class="keyword">mutable </span>n_parents : <a href="index.html#type-cc_node">cc_node</a> <a href="../Bag/index.html#type-t">Bag.t</a>;</code></td></tr><tr id="type-cc_node.n_root" class="anchored"><td class="def field"><a href="#type-cc_node.n_root" class="anchor"></a><code><span class="keyword">mutable </span>n_root : <a href="index.html#type-cc_node">cc_node</a>;</code></td></tr><tr id="type-cc_node.n_expl" class="anchored"><td class="def field"><a href="#type-cc_node.n_expl" class="anchor"></a><code><span class="keyword">mutable </span>n_expl : <a href="index.html#type-explanation_forest_link">explanation_forest_link</a>;</code></td></tr><tr id="type-cc_node.n_payload" class="anchored"><td class="def field"><a href="#type-cc_node.n_payload" class="anchor"></a><code><span class="keyword">mutable </span>n_payload : <a href="index.html#type-cc_node_payload">cc_node_payload</a> list;</code></td></tr><tr id="type-cc_node.n_tags" class="anchored"><td class="def field"><a href="#type-cc_node.n_tags" class="anchor"></a><code><span class="keyword">mutable </span>n_tags : (<a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-explanation">explanation</a>) <a href="../../Sidekick_util__Util/index.html#module-Int_map">Sidekick_util.Util.Int_map</a>.t;</code></td></tr></table><code>}</code><code></code></dt><dd><p>A node of the congruence closure. An equivalence class is represented by its &quot;root&quot; element, the representative.</p><p>If there is a normal form in the congruence class, then the representative is a normal form</p></dd></dl><dl><dt id="type-cc_node_payload"><a href="#type-cc_node_payload" class="anchor"></a><code><span class="keyword">type </span>cc_node_payload</code><code></code><code><span class="keyword"> = </span></code><code><span class="keyword">..</span></code><code></code></dt><dd><p>Theory-extensible payloads</p></dd></dl><dl><dt id="type-explanation_forest_link"><a href="#type-explanation_forest_link" class="anchor"></a><code><span class="keyword">type </span>explanation_forest_link</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-explanation_forest_link.E_none" class="anchored"><td class="def constructor"><a href="#type-explanation_forest_link.E_none" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_none</span></code></td></tr><tr id="type-explanation_forest_link.E_some" class="anchored"><td class="def constructor"><a href="#type-explanation_forest_link.E_some" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_some</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-explanation_forest_link.next" class="anchored"><td class="def field"><a href="#type-explanation_forest_link.next" class="anchor"></a><code>next : <a href="index.html#type-cc_node">cc_node</a>;</code></td></tr><tr id="type-explanation_forest_link.expl" class="anchored"><td class="def field"><a href="#type-explanation_forest_link.expl" class="anchor"></a><code>expl : <a href="index.html#type-explanation">explanation</a>;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-explanation"><a href="#type-explanation" class="anchor"></a><code><span class="keyword">type </span>explanation</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-explanation.E_reduction" class="anchored"><td class="def constructor"><a href="#type-explanation.E_reduction" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_reduction</span></code></td></tr><tr id="type-explanation.E_lit" class="anchored"><td class="def constructor"><a href="#type-explanation.E_lit" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_lit</span><span class="keyword"> of </span><a href="index.html#type-lit">lit</a></code></td></tr><tr id="type-explanation.E_congruence" class="anchored"><td class="def constructor"><a href="#type-explanation.E_congruence" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_congruence</span><span class="keyword"> of </span><a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-cc_node">cc_node</a></code></td></tr><tr id="type-explanation.E_injectivity" class="anchored"><td class="def constructor"><a href="#type-explanation.E_injectivity" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_injectivity</span><span class="keyword"> of </span><a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-cc_node">cc_node</a></code></td></tr><tr id="type-explanation.E_reduce_eq" class="anchored"><td class="def constructor"><a href="#type-explanation.E_reduce_eq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_reduce_eq</span><span class="keyword"> of </span><a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-cc_node">cc_node</a></code></td></tr><tr id="type-explanation.E_custom" class="anchored"><td class="def constructor"><a href="#type-explanation.E_custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-explanation.name" class="anchored"><td class="def field"><a href="#type-explanation.name" class="anchor"></a><code>name : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a>;</code></td></tr><tr id="type-explanation.args" class="anchored"><td class="def field"><a href="#type-explanation.args" class="anchor"></a><code>args : <a href="index.html#type-explanation">explanation</a> list;</code></td></tr><tr id="type-explanation.pp" class="anchored"><td class="def field"><a href="#type-explanation.pp" class="anchor"></a><code>pp : (<a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="index.html#type-explanation">explanation</a> list) <a href="index.html#module-Fmt">Fmt</a>.printer;</code></td></tr></table><code>}</code><code></code></td><td class="doc"><p>Custom explanation, typically for theories</p></td></tr></table><code></code></dt><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-lit.lit_view" class="anchored"><td class="def field"><a href="#type-lit.lit_view" class="anchor"></a><code>lit_view : <a href="index.html#type-lit_view">lit_view</a>;</code></td></tr><tr id="type-lit.lit_sign" class="anchored"><td class="def field"><a href="#type-lit.lit_sign" class="anchor"></a><code>lit_sign : bool;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-lit_view"><a href="#type-lit_view" class="anchor"></a><code><span class="keyword">type </span>lit_view</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-lit_view.Lit_fresh" class="anchored"><td class="def constructor"><a href="#type-lit_view.Lit_fresh" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_fresh</span><span class="keyword"> of </span><a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></td></tr><tr id="type-lit_view.Lit_atom" class="anchored"><td class="def constructor"><a href="#type-lit_view.Lit_atom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_atom</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-lit_view.Lit_expanded" class="anchored"><td class="def constructor"><a href="#type-lit_view.Lit_expanded" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_expanded</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr></table><code></code></dt><dt id="type-cst"><a href="#type-cst" class="anchor"></a><code><span class="keyword">type </span>cst</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-cst.cst_id" class="anchored"><td class="def field"><a href="#type-cst.cst_id" class="anchor"></a><code>cst_id : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a>;</code></td></tr><tr id="type-cst.cst_kind" class="anchored"><td class="def field"><a href="#type-cst.cst_kind" class="anchor"></a><code>cst_kind : <a href="index.html#type-cst_kind">cst_kind</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-cst_kind"><a href="#type-cst_kind" class="anchor"></a><code><span class="keyword">type </span>cst_kind</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-cst_kind.Cst_undef" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_undef" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_undef</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a></code></td></tr><tr id="type-cst_kind.Cst_cstor" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_cstor" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_cstor</span><span class="keyword"> of </span><a href="index.html#type-data_cstor">data_cstor</a> lazy_t</code></td></tr><tr id="type-cst_kind.Cst_proj" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_proj" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_proj</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a><span class="keyword"> * </span><a href="index.html#type-data_cstor">data_cstor</a> lazy_t<span class="keyword"> * </span>int</code></td></tr><tr id="type-cst_kind.Cst_test" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_test" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_test</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a><span class="keyword"> * </span><a href="index.html#type-data_cstor">data_cstor</a> lazy_t</code></td></tr><tr id="type-cst_kind.Cst_defined" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_defined" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_defined</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a><span class="keyword"> * </span><a href="index.html#type-term">term</a> lazy_t<span class="keyword"> * </span><a href="index.html#type-cst_defined_info">cst_defined_info</a></code></td></tr></table><code></code></dt><dt id="type-cst_defined_info"><a href="#type-cst_defined_info" class="anchor"></a><code><span class="keyword">type </span>cst_defined_info</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-cst_defined_info.Cst_recursive" class="anchored"><td class="def constructor"><a href="#type-cst_defined_info.Cst_recursive" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_recursive</span></code></td></tr><tr id="type-cst_defined_info.Cst_non_recursive" class="anchored"><td class="def constructor"><a href="#type-cst_defined_info.Cst_non_recursive" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_non_recursive</span></code></td></tr></table><code></code></dt><dt id="type-cst_exist_conds"><a href="#type-cst_exist_conds" class="anchor"></a><code><span class="keyword">type </span>cst_exist_conds</code><code><span class="keyword"> = </span><a href="index.html#type-lit">lit</a> lazy_t list Pervasives.ref</code><code></code></dt><dt id="type-db_env"><a href="#type-db_env" class="anchor"></a><code><span class="keyword">type </span>'a db_env</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-db_env.db_st" class="anchored"><td class="def field"><a href="#type-db_env.db_st" class="anchor"></a><code>db_st : <span class="type-var">'a</span> option list;</code></td></tr><tr id="type-db_env.db_size" class="anchored"><td class="def field"><a href="#type-db_env.db_size" class="anchor"></a><code>db_size : int;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-ty"><a href="#type-ty" class="anchor"></a><code><span class="keyword">type </span>ty</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-ty.ty_id" class="anchored"><td class="def field"><a href="#type-ty.ty_id" class="anchor"></a><code><span class="keyword">mutable </span>ty_id : int;</code></td></tr><tr id="type-ty.ty_cell" class="anchored"><td class="def field"><a href="#type-ty.ty_cell" class="anchor"></a><code>ty_cell : <a href="index.html#type-ty_cell">ty_cell</a>;</code></td></tr><tr id="type-ty.ty_card" class="anchored"><td class="def field"><a href="#type-ty.ty_card" class="anchor"></a><code>ty_card : <a href="index.html#type-ty_card">ty_card</a> lazy_t;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-ty_card"><a href="#type-ty_card" class="anchor"></a><code><span class="keyword">type </span>ty_card</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-ty_card.Finite" class="anchored"><td class="def constructor"><a href="#type-ty_card.Finite" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Finite</span></code></td></tr><tr id="type-ty_card.Infinite" class="anchored"><td class="def constructor"><a href="#type-ty_card.Infinite" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Infinite</span></code></td></tr></table><code></code></dt><dt id="type-ty_def"><a href="#type-ty_def" class="anchor"></a><code><span class="keyword">type </span>ty_def</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-ty_def.Uninterpreted" class="anchored"><td class="def constructor"><a href="#type-ty_def.Uninterpreted" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Uninterpreted</span></code></td></tr><tr id="type-ty_def.Data" class="anchored"><td class="def constructor"><a href="#type-ty_def.Data" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Data</span><span class="keyword"> of </span><a href="index.html#type-datatype">datatype</a></code></td></tr></table><code></code></dt><dt id="type-datatype"><a href="#type-datatype" class="anchor"></a><code><span class="keyword">type </span>datatype</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-datatype.data_cstors" class="anchored"><td class="def field"><a href="#type-datatype.data_cstors" class="anchor"></a><code>data_cstors : <a href="index.html#type-data_cstor">data_cstor</a> <a href="../../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t lazy_t;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-data_cstor"><a href="#type-data_cstor" class="anchor"></a><code><span class="keyword">type </span>data_cstor</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-data_cstor.cstor_ty" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_ty" class="anchor"></a><code>cstor_ty : <a href="index.html#type-ty">ty</a>;</code></td></tr><tr id="type-data_cstor.cstor_args" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_args" class="anchor"></a><code>cstor_args : <a href="index.html#type-ty">ty</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a>;</code></td></tr><tr id="type-data_cstor.cstor_proj" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_proj" class="anchor"></a><code>cstor_proj : <a href="index.html#type-cst">cst</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> lazy_t;</code></td></tr><tr id="type-data_cstor.cstor_test" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_test" class="anchor"></a><code>cstor_test : <a href="index.html#type-cst">cst</a> lazy_t;</code></td></tr><tr id="type-data_cstor.cstor_cst" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_cst" class="anchor"></a><code>cstor_cst : <a href="index.html#type-cst">cst</a>;</code></td></tr><tr id="type-data_cstor.cstor_card" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_card" class="anchor"></a><code>cstor_card : <a href="index.html#type-ty_card">ty_card</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-ty_cell"><a href="#type-ty_cell" class="anchor"></a><code><span class="keyword">type </span>ty_cell</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-ty_cell.Prop" class="anchored"><td class="def constructor"><a href="#type-ty_cell.Prop" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Prop</span></code></td></tr><tr id="type-ty_cell.Atomic" class="anchored"><td class="def constructor"><a href="#type-ty_cell.Atomic" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Atomic</span><span class="keyword"> of </span><a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="index.html#type-ty_def">ty_def</a></code></td></tr><tr id="type-ty_cell.Arrow" class="anchored"><td class="def constructor"><a href="#type-ty_cell.Arrow" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Arrow</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a><span class="keyword"> * </span><a href="index.html#type-ty">ty</a></code></td></tr></table><code></code></dt></dl><dl><dt id="val-term_equal_"><a href="#val-term_equal_" class="anchor"></a><code><span class="keyword">val </span>term_equal_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-term_hash_"><a href="#val-term_hash_" class="anchor"></a><code><span class="keyword">val </span>term_hash_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-term_cmp_"><a href="#val-term_cmp_" class="anchor"></a><code><span class="keyword">val </span>term_cmp_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cmp_lit"><a href="#val-cmp_lit" class="anchor"></a><code><span class="keyword">val </span>cmp_lit : <a href="index.html#type-lit">lit</a> <span>&#8209;&gt;</span> <a href="index.html#type-lit">lit</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cst_compare"><a href="#val-cst_compare" class="anchor"></a><code><span class="keyword">val </span>cst_compare : <a href="index.html#type-cst">cst</a> <span>&#8209;&gt;</span> <a href="index.html#type-cst">cst</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-hash_lit"><a href="#val-hash_lit" class="anchor"></a><code><span class="keyword">val </span>hash_lit : <a href="index.html#type-lit">lit</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cmp_cc_node"><a href="#val-cmp_cc_node" class="anchor"></a><code><span class="keyword">val </span>cmp_cc_node : <a href="index.html#type-cc_node">cc_node</a> <span>&#8209;&gt;</span> <a href="index.html#type-cc_node">cc_node</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cmp_exp"><a href="#val-cmp_exp" class="anchor"></a><code><span class="keyword">val </span>cmp_exp : <a href="index.html#type-explanation">explanation</a> CCOrd.t</code></dt><dt id="val-pp_cst"><a href="#val-pp_cst" class="anchor"></a><code><span class="keyword">val </span>pp_cst : CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-cst">cst</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-id_of_cst"><a href="#val-id_of_cst" class="anchor"></a><code><span class="keyword">val </span>id_of_cst : <a href="index.html#type-cst">cst</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></dt><dt id="val-pp_db"><a href="#val-pp_db" class="anchor"></a><code><span class="keyword">val </span>pp_db : Format.formatter <span>&#8209;&gt;</span> (int<span class="keyword"> * </span><span class="type-var">'a</span>) <span>&#8209;&gt;</span> unit</code></dt><dt id="val-ty_unfold"><a href="#val-ty_unfold" class="anchor"></a><code><span class="keyword">val </span>ty_unfold : <a href="index.html#type-ty">ty</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a> list<span class="keyword"> * </span><a href="index.html#type-ty">ty</a></code></dt><dt id="val-pp_ty"><a href="#val-pp_ty" class="anchor"></a><code><span class="keyword">val </span>pp_ty : <a href="index.html#type-ty">ty</a> <a href="../../Sidekick_util/Util/index.html#type-printer">Sidekick_util.Util.printer</a></code></dt><dt id="val-pp_term_top"><a href="#val-pp_term_top" class="anchor"></a><code><span class="keyword">val </span>pp_term_top : ids:bool <span>&#8209;&gt;</span> CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_term"><a href="#val-pp_term" class="anchor"></a><code><span class="keyword">val </span>pp_term : CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_lit"><a href="#val-pp_lit" class="anchor"></a><code><span class="keyword">val </span>pp_lit : CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-lit">lit</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_cc_node"><a href="#val-pp_cc_node" class="anchor"></a><code><span class="keyword">val </span>pp_cc_node : CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-cc_node">cc_node</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_explanation"><a href="#val-pp_explanation" class="anchor"></a><code><span class="keyword">val </span>pp_explanation : <a href="index.html#module-Fmt">Fmt</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-explanation">explanation</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Stat/index.html b/sidekick/Sidekick_smt/Stat/index.html
new file mode 100644
index 00000000..8647e91b
--- /dev/null
+++ b/sidekick/Sidekick_smt/Stat/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Stat (sidekick.Sidekick_smt.Stat)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Stat</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.num_cst_expanded" class="anchored"><td class="def field"><a href="#type-t.num_cst_expanded" class="anchor"></a><code><span class="keyword">mutable </span>num_cst_expanded : int;</code></td></tr><tr id="type-t.num_uty_expanded" class="anchored"><td class="def field"><a href="#type-t.num_uty_expanded" class="anchor"></a><code><span class="keyword">mutable </span>num_uty_expanded : int;</code></td></tr><tr id="type-t.num_clause_push" class="anchored"><td class="def field"><a href="#type-t.num_clause_push" class="anchor"></a><code><span class="keyword">mutable </span>num_clause_push : int;</code></td></tr><tr id="type-t.num_clause_tautology" class="anchored"><td class="def field"><a href="#type-t.num_clause_tautology" class="anchor"></a><code><span class="keyword">mutable </span>num_clause_tautology : int;</code></td></tr><tr id="type-t.num_propagations" class="anchored"><td class="def field"><a href="#type-t.num_propagations" class="anchor"></a><code><span class="keyword">mutable </span>num_propagations : int;</code></td></tr><tr id="type-t.num_unif" class="anchored"><td class="def field"><a href="#type-t.num_unif" class="anchor"></a><code><span class="keyword">mutable </span>num_unif : int;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Term/index.html b/sidekick/Sidekick_smt/Term/index.html
new file mode 100644
index 00000000..8e4f5aca
--- /dev/null
+++ b/sidekick/Sidekick_smt/Term/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Term (sidekick.Sidekick_smt.Term)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Term</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Solver_types/index.html#type-term">Solver_types.term</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.term_id" class="anchored"><td class="def field"><a href="#type-t.term_id" class="anchor"></a><code><span class="keyword">mutable </span>term_id : int;</code></td></tr><tr id="type-t.term_ty" class="anchored"><td class="def field"><a href="#type-t.term_ty" class="anchor"></a><code><span class="keyword">mutable </span>term_ty : <a href="../Solver_types/index.html#type-ty">Solver_types.ty</a>;</code></td></tr><tr id="type-t.term_cell" class="anchored"><td class="def field"><a href="#type-t.term_cell" class="anchor"></a><code>term_cell : <a href="index.html#type-t">t</a> <a href="../Solver_types/index.html#type-term_cell">Solver_types.term_cell</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-cell"><a href="#type-cell" class="anchor"></a><code><span class="keyword">type </span>'a cell</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_cell">Solver_types.term_cell</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-cell.Bool" class="anchored"><td class="def constructor"><a href="#type-cell.Bool" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bool</span><span class="keyword"> of </span>bool</code></td></tr><tr id="type-cell.App_cst" class="anchored"><td class="def constructor"><a href="#type-cell.App_cst" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">App_cst</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-cst">Solver_types.cst</a><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></td></tr><tr id="type-cell.If" class="anchored"><td class="def constructor"><a href="#type-cell.If" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">If</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span></code></td></tr><tr id="type-cell.Case" class="anchored"><td class="def constructor"><a href="#type-cell.Case" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Case</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t</code></td></tr><tr id="type-cell.Custom" class="anchored"><td class="def constructor"><a href="#type-cell.Custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-cell.view" class="anchored"><td class="def field"><a href="#type-cell.view" class="anchor"></a><code>view : <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a>;</code></td></tr><tr id="type-cell.tc" class="anchored"><td class="def field"><a href="#type-cell.tc" class="anchor"></a><code>tc : <a href="../Solver_types/index.html#type-term_view_tc">Solver_types.term_view_tc</a>;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-custom"><a href="#type-custom" class="anchor"></a><code><span class="keyword">type </span>'a custom</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a></code><code><span class="keyword"> = </span></code><code><span class="keyword">..</span></code><code></code></dt><dt id="type-tc"><a href="#type-tc" class="anchor"></a><code><span class="keyword">type </span>tc</code><code><span class="keyword"> = </span><a href="../Solver_types/index.html#type-term_view_tc">Solver_types.term_view_tc</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-tc.tc_t_pp" class="anchored"><td class="def field"><a href="#type-tc.tc_t_pp" class="anchor"></a><code>tc_t_pp : a. <span class="type-var">'a</span> <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer;</code></td></tr><tr id="type-tc.tc_t_equal" class="anchored"><td class="def field"><a href="#type-tc.tc_t_equal" class="anchor"></a><code>tc_t_equal : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> CCEqual.t;</code></td></tr><tr id="type-tc.tc_t_hash" class="anchored"><td class="def field"><a href="#type-tc.tc_t_hash" class="anchor"></a><code>tc_t_hash : a. <span class="type-var">'a</span> <a href="../Hash/index.html#type-t">Hash.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <a href="../Hash/index.html#type-t">Hash.t</a>;</code></td></tr><tr id="type-tc.tc_t_ty" class="anchored"><td class="def field"><a href="#type-tc.tc_t_ty" class="anchor"></a><code>tc_t_ty : a. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-ty">Solver_types.ty</a>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-ty">Solver_types.ty</a>;</code></td></tr><tr id="type-tc.tc_t_is_semantic" class="anchored"><td class="def field"><a href="#type-tc.tc_t_is_semantic" class="anchor"></a><code>tc_t_is_semantic : a. <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> bool;</code></td></tr><tr id="type-tc.tc_t_solve" class="anchored"><td class="def field"><a href="#type-tc.tc_t_solve" class="anchor"></a><code>tc_t_solve : <a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-solve_result">Solver_types.solve_result</a>;</code></td></tr><tr id="type-tc.tc_t_sub" class="anchored"><td class="def field"><a href="#type-tc.tc_t_sub" class="anchor"></a><code>tc_t_sub : a. <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-tc.tc_t_abs" class="anchored"><td class="def field"><a href="#type-tc.tc_t_abs" class="anchor"></a><code>tc_t_abs : self:<a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a><span class="keyword"> * </span>bool;</code></td></tr><tr id="type-tc.tc_t_relevant" class="anchored"><td class="def field"><a href="#type-tc.tc_t_relevant" class="anchor"></a><code>tc_t_relevant : a. <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-tc.tc_t_subst" class="anchored"><td class="def field"><a href="#type-tc.tc_t_subst" class="anchor"></a><code>tc_t_subst : a b. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-custom">custom</a> option;</code></td></tr><tr id="type-tc.tc_t_explain" class="anchored"><td class="def field"><a href="#type-tc.tc_t_explain" class="anchor"></a><code>tc_t_explain : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span>) list;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cell"><a href="#val-cell" class="anchor"></a><code><span class="keyword">val </span>cell : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <a href="../Solver_types/index.html#type-term_cell">Solver_types.term_cell</a></code></dt><dt id="val-ty"><a href="#val-ty" class="anchor"></a><code><span class="keyword">val </span>ty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Ty/index.html#type-t">Ty.t</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:int <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <a href="../Solver_types/index.html#type-term_cell">Solver_types.term_cell</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-true_"><a href="#val-true_" class="anchor"></a><code><span class="keyword">val </span>true_ : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-false_"><a href="#val-false_" class="anchor"></a><code><span class="keyword">val </span>false_ : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-const"><a href="#val-const" class="anchor"></a><code><span class="keyword">val </span>const : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-cst">Solver_types.cst</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-app_cst"><a href="#val-app_cst" class="anchor"></a><code><span class="keyword">val </span>app_cst : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-cst">Solver_types.cst</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-if_"><a href="#val-if_" class="anchor"></a><code><span class="keyword">val </span>if_ : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-case"><a href="#val-case" class="anchor"></a><code><span class="keyword">val </span>case : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <a href="../../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-and_eager"><a href="#val-and_eager" class="anchor"></a><code><span class="keyword">val </span>and_eager : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-custom"><a href="#val-custom" class="anchor"></a><code><span class="keyword">val </span>custom : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> tc:<a href="index.html#type-tc">tc</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_test"><a href="#val-cstor_test" class="anchor"></a><code><span class="keyword">val </span>cstor_test : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_proj"><a href="#val-cstor_proj" class="anchor"></a><code><span class="keyword">val </span>cstor_proj : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span>bool</code></dt><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> Sequence.t</code></dt><dt id="val-all_terms"><a href="#val-all_terms" class="anchor"></a><code><span class="keyword">val </span>all_terms : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> Sequence.t</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer</code></dt></dl><section><header><h4 id="views"><a href="#views" class="anchor"></a>Views</h4></header><dl><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_const"><a href="#val-is_const" class="anchor"></a><code><span class="keyword">val </span>is_const : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_custom"><a href="#val-is_custom" class="anchor"></a><code><span class="keyword">val </span>is_custom : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_semantic"><a href="#val-is_semantic" class="anchor"></a><code><span class="keyword">val </span>is_semantic : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Custom term that is Shostak-ready (ie can be solved)</p></dd></dl><dl><dt id="val-as_cst_undef"><a href="#val-as_cst_undef" class="anchor"></a><code><span class="keyword">val </span>as_cst_undef : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="../Solver_types/index.html#type-cst">Solver_types.cst</a><span class="keyword"> * </span><a href="../Ty/index.html#type-t">Ty.t</a>) option</code></dt><dt id="val-as_cstor_app"><a href="#val-as_cstor_app" class="anchor"></a><code><span class="keyword">val </span>as_cstor_app : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="../Solver_types/index.html#type-cst">Solver_types.cst</a><span class="keyword"> * </span><a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a><span class="keyword"> * </span><a href="index.html#type-t">t</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a>) option</code></dt></dl><dl><dt id="type-unif_form"><a href="#type-unif_form" class="anchor"></a><code><span class="keyword">type </span>unif_form</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-unif_form.Unif_cst" class="anchored"><td class="def constructor"><a href="#type-unif_form.Unif_cst" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unif_cst</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-cst">Solver_types.cst</a><span class="keyword"> * </span><a href="../Ty/index.html#type-t">Ty.t</a></code></td></tr><tr id="type-unif_form.Unif_cstor" class="anchored"><td class="def constructor"><a href="#type-unif_form.Unif_cstor" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unif_cstor</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-cst">Solver_types.cst</a><span class="keyword"> * </span><a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a><span class="keyword"> * </span><a href="../Solver_types/index.html#type-term">Solver_types.term</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></td></tr><tr id="type-unif_form.Unif_none" class="anchored"><td class="def constructor"><a href="#type-unif_form.Unif_none" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unif_none</span></code></td></tr></table><code></code></dt></dl><dl><dt id="val-as_unif"><a href="#val-as_unif" class="anchor"></a><code><span class="keyword">val </span>as_unif : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-unif_form">unif_form</a></code></dt></dl></section><section><header><h4 id="containers"><a href="#containers" class="anchor"></a>Containers</h4></header><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-Map"><a href="#module-Map" class="anchor"></a><code><span class="keyword">module </span>Map : CCMap.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Map">Map</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Term_cell/Make_eq/argument-1-X/index.html b/sidekick/Sidekick_smt/Term_cell/Make_eq/argument-1-X/index.html
new file mode 100644
index 00000000..7fd6ce41
--- /dev/null
+++ b/sidekick/Sidekick_smt/Term_cell/Make_eq/argument-1-X/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-X (sidekick.Sidekick_smt.Term_cell.Make_eq.1-X)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_smt.Term_cell.Make_eq.1-X</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Term_cell/Make_eq/index.html b/sidekick/Sidekick_smt/Term_cell/Make_eq/index.html
new file mode 100644
index 00000000..a9760204
--- /dev/null
+++ b/sidekick/Sidekick_smt/Term_cell/Make_eq/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make_eq (sidekick.Sidekick_smt.Term_cell.Make_eq)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Term_cell.Make_eq</code></h1></header><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-X/index.html">X</a> : <a href="../index.html#module-type-ARG">ARG</a></code></dl><h3 class="heading">Signature</h3><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="argument-1-X/index.html#type-t">X.t</a> <a href="../../Solver_types/index.html#type-term_cell">Solver_types.term_cell</a> <span>&#8209;&gt;</span> <a href="argument-1-X/index.html#type-t">X.t</a> <a href="../../Solver_types/index.html#type-term_cell">Solver_types.term_cell</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="argument-1-X/index.html#type-t">X.t</a> <a href="../../Solver_types/index.html#type-term_cell">Solver_types.term_cell</a> <span>&#8209;&gt;</span> int</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Term_cell/index.html b/sidekick/Sidekick_smt/Term_cell/index.html
new file mode 100644
index 00000000..14d44fa6
--- /dev/null
+++ b/sidekick/Sidekick_smt/Term_cell/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Term_cell (sidekick.Sidekick_smt.Term_cell)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Term_cell</code></h1></header><dl><dt id="type-cell"><a href="#type-cell" class="anchor"></a><code><span class="keyword">type </span>'a cell</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_cell">Solver_types.term_cell</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-cell.Bool" class="anchored"><td class="def constructor"><a href="#type-cell.Bool" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bool</span><span class="keyword"> of </span>bool</code></td></tr><tr id="type-cell.App_cst" class="anchored"><td class="def constructor"><a href="#type-cell.App_cst" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">App_cst</span><span class="keyword"> of </span><a href="../Solver_types/index.html#type-cst">Solver_types.cst</a><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></td></tr><tr id="type-cell.If" class="anchored"><td class="def constructor"><a href="#type-cell.If" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">If</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span></code></td></tr><tr id="type-cell.Case" class="anchored"><td class="def constructor"><a href="#type-cell.Case" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Case</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t</code></td></tr><tr id="type-cell.Custom" class="anchored"><td class="def constructor"><a href="#type-cell.Custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-cell.view" class="anchored"><td class="def field"><a href="#type-cell.view" class="anchor"></a><code>view : <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a>;</code></td></tr><tr id="type-cell.tc" class="anchored"><td class="def field"><a href="#type-cell.tc" class="anchor"></a><code>tc : <a href="../Solver_types/index.html#type-term_view_tc">Solver_types.term_view_tc</a>;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-custom"><a href="#type-custom" class="anchor"></a><code><span class="keyword">type </span>'a custom</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a></code><code><span class="keyword"> = </span></code><code><span class="keyword">..</span></code><code></code></dt><dt id="type-tc"><a href="#type-tc" class="anchor"></a><code><span class="keyword">type </span>tc</code><code><span class="keyword"> = </span><a href="../Solver_types/index.html#type-term_view_tc">Solver_types.term_view_tc</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-tc.tc_t_pp" class="anchored"><td class="def field"><a href="#type-tc.tc_t_pp" class="anchor"></a><code>tc_t_pp : a. <span class="type-var">'a</span> <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <a href="../Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer;</code></td></tr><tr id="type-tc.tc_t_equal" class="anchored"><td class="def field"><a href="#type-tc.tc_t_equal" class="anchor"></a><code>tc_t_equal : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> CCEqual.t;</code></td></tr><tr id="type-tc.tc_t_hash" class="anchored"><td class="def field"><a href="#type-tc.tc_t_hash" class="anchor"></a><code>tc_t_hash : a. <span class="type-var">'a</span> <a href="../Hash/index.html#type-t">Hash.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <a href="../Hash/index.html#type-t">Hash.t</a>;</code></td></tr><tr id="type-tc.tc_t_ty" class="anchored"><td class="def field"><a href="#type-tc.tc_t_ty" class="anchor"></a><code>tc_t_ty : a. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-ty">Solver_types.ty</a>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-ty">Solver_types.ty</a>;</code></td></tr><tr id="type-tc.tc_t_is_semantic" class="anchored"><td class="def field"><a href="#type-tc.tc_t_is_semantic" class="anchor"></a><code>tc_t_is_semantic : a. <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> bool;</code></td></tr><tr id="type-tc.tc_t_solve" class="anchored"><td class="def field"><a href="#type-tc.tc_t_solve" class="anchor"></a><code>tc_t_solve : <a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-cc_node">Solver_types.cc_node</a> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-solve_result">Solver_types.solve_result</a>;</code></td></tr><tr id="type-tc.tc_t_sub" class="anchored"><td class="def field"><a href="#type-tc.tc_t_sub" class="anchor"></a><code>tc_t_sub : a. <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-tc.tc_t_abs" class="anchored"><td class="def field"><a href="#type-tc.tc_t_abs" class="anchor"></a><code>tc_t_abs : self:<a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a><span class="keyword"> * </span>bool;</code></td></tr><tr id="type-tc.tc_t_relevant" class="anchored"><td class="def field"><a href="#type-tc.tc_t_relevant" class="anchor"></a><code>tc_t_relevant : a. <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-tc.tc_t_subst" class="anchored"><td class="def field"><a href="#type-tc.tc_t_subst" class="anchor"></a><code>tc_t_subst : a b. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> option;</code></td></tr><tr id="type-tc.tc_t_explain" class="anchored"><td class="def field"><a href="#type-tc.tc_t_explain" class="anchor"></a><code>tc_t_explain : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span>) list;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Solver_types/index.html#type-term">Solver_types.term</a> <a href="../Solver_types/index.html#type-term_cell">Solver_types.term_cell</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-true_"><a href="#val-true_" class="anchor"></a><code><span class="keyword">val </span>true_ : <a href="index.html#type-t">t</a></code></dt><dt id="val-false_"><a href="#val-false_" class="anchor"></a><code><span class="keyword">val </span>false_ : <a href="index.html#type-t">t</a></code></dt><dt id="val-const"><a href="#val-const" class="anchor"></a><code><span class="keyword">val </span>const : <a href="../Solver_types/index.html#type-cst">Solver_types.cst</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-app_cst"><a href="#val-app_cst" class="anchor"></a><code><span class="keyword">val </span>app_cst : <a href="../Solver_types/index.html#type-cst">Solver_types.cst</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_test"><a href="#val-cstor_test" class="anchor"></a><code><span class="keyword">val </span>cstor_test : <a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_proj"><a href="#val-cstor_proj" class="anchor"></a><code><span class="keyword">val </span>cstor_proj : <a href="../Solver_types/index.html#type-data_cstor">Solver_types.data_cstor</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-case"><a href="#val-case" class="anchor"></a><code><span class="keyword">val </span>case : <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <a href="../../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-if_"><a href="#val-if_" class="anchor"></a><code><span class="keyword">val </span>if_ : <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-custom"><a href="#val-custom" class="anchor"></a><code><span class="keyword">val </span>custom : tc:<a href="../Solver_types/index.html#type-term_view_tc">Solver_types.term_view_tc</a> <span>&#8209;&gt;</span> <a href="../Solver_types/index.html#type-term">Solver_types.term</a> <a href="../Solver_types/index.html#type-term_view_custom">Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-ty"><a href="#val-ty" class="anchor"></a><code><span class="keyword">val </span>ty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Ty/index.html#type-t">Ty.t</a></code></dt><dd><p>Compute the type of this term cell. Not totally free</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-type-ARG"><a href="#module-type-ARG" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-ARG/index.html">ARG</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Make_eq"><a href="#module-Make_eq" class="anchor"></a><code><span class="keyword">module </span><a href="Make_eq/index.html">Make_eq</a> : <span class="keyword">functor</span> (<a href="Make_eq/argument-1-X/index.html">X</a> : <a href="index.html#module-type-ARG">ARG</a>) -&gt; <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Term_cell/module-type-ARG/index.html b/sidekick/Sidekick_smt/Term_cell/module-type-ARG/index.html
new file mode 100644
index 00000000..64cc02d0
--- /dev/null
+++ b/sidekick/Sidekick_smt/Term_cell/module-type-ARG/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>ARG (sidekick.Sidekick_smt.Term_cell.ARG)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_smt.Term_cell.ARG</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Theory/Clause/index.html b/sidekick/Sidekick_smt/Theory/Clause/index.html
new file mode 100644
index 00000000..a2e3b87e
--- /dev/null
+++ b/sidekick/Sidekick_smt/Theory/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_smt.Theory.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Theory.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../../Lit/index.html#type-t">Lit.t</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Theory/index.html b/sidekick/Sidekick_smt/Theory/index.html
new file mode 100644
index 00000000..5964c1a0
--- /dev/null
+++ b/sidekick/Sidekick_smt/Theory/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Theory (sidekick.Sidekick_smt.Theory)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Theory</code></h1></header><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-state.State" class="anchored"><td class="def constructor"><a href="#type-state.State" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">State</span><span class="keyword"> : </span></code><code>{</code><table class="record"><tr id="type-state.st" class="anchored"><td class="def field"><a href="#type-state.st" class="anchor"></a><code><span class="keyword">mutable </span>st : <span class="type-var">'a</span>;</code></td></tr><tr id="type-state.on_merge" class="anchored"><td class="def field"><a href="#type-state.on_merge" class="anchor"></a><code>on_merge : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Equiv_class/index.html#type-t">Equiv_class.t</a> <span>&#8209;&gt;</span> <a href="../Equiv_class/index.html#type-t">Equiv_class.t</a> <span>&#8209;&gt;</span> <a href="../Explanation/index.html#type-t">Explanation.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Called when two classes are merged</p></td></tr><tr id="type-state.on_assert" class="anchored"><td class="def field"><a href="#type-state.on_assert" class="anchor"></a><code>on_assert : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Lit/index.html#type-t">Lit.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Called when a literal becomes true</p></td></tr><tr id="type-state.final_check" class="anchored"><td class="def field"><a href="#type-state.final_check" class="anchor"></a><code>final_check : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Lit/index.html#type-t">Lit.t</a> Sequence.t <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Final check, must be complete (i.e. must raise a conflict if the set of literals is not satisfiable)</p></td></tr></table><code>}</code><code> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></td></tr></table><code></code></dt><dd><p>Runtime state of a theory, with all the operations it provides. <code>'a</code> is the internal state</p></dd></dl><dl><dt id="type-conflict"><a href="#type-conflict" class="anchor"></a><code><span class="keyword">type </span>conflict</code><code><span class="keyword"> = </span><a href="../../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code><code></code></dt><dd><p>Unsatisfiable conjunction. Its negation will become a conflict clause</p></dd></dl><dl><dt id="type-actions"><a href="#type-actions" class="anchor"></a><code><span class="keyword">type </span>actions</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-actions.on_backtrack" class="anchored"><td class="def field"><a href="#type-actions.on_backtrack" class="anchor"></a><code>on_backtrack : (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Register an action to do when we backtrack</p></td></tr><tr id="type-actions.raise_conflict" class="anchored"><td class="def field"><a href="#type-actions.raise_conflict" class="anchor"></a><code>raise_conflict : a. <a href="index.html#type-conflict">conflict</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>;</code></td><td class="doc"><p>Give a conflict clause to the solver</p></td></tr><tr id="type-actions.propagate_eq" class="anchored"><td class="def field"><a href="#type-actions.propagate_eq" class="anchor"></a><code>propagate_eq : <a href="../Term/index.html#type-t">Term.t</a> <span>&#8209;&gt;</span> <a href="../Term/index.html#type-t">Term.t</a> <span>&#8209;&gt;</span> <a href="../Explanation/index.html#type-t">Explanation.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Propagate an equality <code>t = u</code> because <code>e</code></p></td></tr><tr id="type-actions.propagate_distinct" class="anchored"><td class="def field"><a href="#type-actions.propagate_distinct" class="anchor"></a><code>propagate_distinct : <a href="../Term/index.html#type-t">Term.t</a> list <span>&#8209;&gt;</span> neq:<a href="../Term/index.html#type-t">Term.t</a> <span>&#8209;&gt;</span> <a href="../Explanation/index.html#type-t">Explanation.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Propagate a <code>distinct l</code> because <code>e</code> (where <code>e = atom neq</code></p></td></tr><tr id="type-actions.propagate" class="anchored"><td class="def field"><a href="#type-actions.propagate" class="anchor"></a><code>propagate : <a href="../Lit/index.html#type-t">Lit.t</a> <span>&#8209;&gt;</span> <a href="../Explanation/index.html#type-t">Explanation.t</a> <a href="../Bag/index.html#type-t">Bag.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Propagate a boolean using a unit clause. <code>expl =&gt; lit</code> must be a theory lemma, that is, a T-tautology</p></td></tr><tr id="type-actions.add_local_axiom" class="anchored"><td class="def field"><a href="#type-actions.add_local_axiom" class="anchor"></a><code>add_local_axiom : <a href="../Lit/index.html#type-t">Lit.t</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Add local clause to the SAT solver. This clause will be removed when the solver backtracks.</p></td></tr><tr id="type-actions.add_persistent_axiom" class="anchored"><td class="def field"><a href="#type-actions.add_persistent_axiom" class="anchor"></a><code>add_persistent_axiom : <a href="../Lit/index.html#type-t">Lit.t</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Add toplevel clause to the SAT solver. This clause will not be backtracked.</p></td></tr><tr id="type-actions.find" class="anchored"><td class="def field"><a href="#type-actions.find" class="anchor"></a><code>find : <a href="../Term/index.html#type-t">Term.t</a> <span>&#8209;&gt;</span> <a href="../Equiv_class/index.html#type-t">Equiv_class.t</a>;</code></td><td class="doc"><p>Find representative of this term</p></td></tr><tr id="type-actions.all_classes" class="anchored"><td class="def field"><a href="#type-actions.all_classes" class="anchor"></a><code>all_classes : <a href="../Equiv_class/index.html#type-t">Equiv_class.t</a> Sequence.t;</code></td><td class="doc"><p>All current equivalence classes (caution: linear in the number of terms existing in the solver)</p></td></tr></table><code>}</code><code></code></dt><dd><p>Actions available to a theory during its lifetime</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.name" class="anchored"><td class="def field"><a href="#type-t.name" class="anchor"></a><code>name : string;</code></td></tr><tr id="type-t.make" class="anchored"><td class="def field"><a href="#type-t.make" class="anchor"></a><code>make : <a href="../Term/index.html#type-state">Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-actions">actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a>;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : name:string <span>&#8209;&gt;</span> make:(<a href="../Term/index.html#type-state">Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-actions">actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a>) <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_st"><a href="#val-make_st" class="anchor"></a><code><span class="keyword">val </span>make_st : ?&#8288;on_merge:(<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Equiv_class/index.html#type-t">Equiv_class.t</a> <span>&#8209;&gt;</span> <a href="../Equiv_class/index.html#type-t">Equiv_class.t</a> <span>&#8209;&gt;</span> <a href="../Explanation/index.html#type-t">Explanation.t</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> ?&#8288;on_assert:(<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Lit/index.html#type-t">Lit.t</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> final_check:(<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Lit/index.html#type-t">Lit.t</a> Sequence.t <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> st:<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Theory_combine/index.html b/sidekick/Sidekick_smt/Theory_combine/index.html
new file mode 100644
index 00000000..c10ab246
--- /dev/null
+++ b/sidekick/Sidekick_smt/Theory_combine/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Theory_combine (sidekick.Sidekick_smt.Theory_combine)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Theory_combine</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Ty/index.html b/sidekick/Sidekick_smt/Ty/index.html
new file mode 100644
index 00000000..c13d8c41
--- /dev/null
+++ b/sidekick/Sidekick_smt/Ty/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Ty (sidekick.Sidekick_smt.Ty)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Ty</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/Ty_card/index.html b/sidekick/Sidekick_smt/Ty_card/index.html
new file mode 100644
index 00000000..f4b50cc3
--- /dev/null
+++ b/sidekick/Sidekick_smt/Ty_card/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Ty_card (sidekick.Sidekick_smt.Ty_card)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt.Ty_card</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt/index.html b/sidekick/Sidekick_smt/index.html
new file mode 100644
index 00000000..4090978b
--- /dev/null
+++ b/sidekick/Sidekick_smt/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt (sidekick.Sidekick_smt)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt</code></h1></header><article id="module-Ast"><a href="#module-Ast" class="anchor"></a><code><span class="keyword">module </span><a href="Ast/index.html">Ast</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Bag"><a href="#module-Bag" class="anchor"></a><code><span class="keyword">module </span><a href="Bag/index.html">Bag</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Config"><a href="#module-Config" class="anchor"></a><code><span class="keyword">module </span><a href="Config/index.html">Config</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Congruence_closure"><a href="#module-Congruence_closure" class="anchor"></a><code><span class="keyword">module </span><a href="Congruence_closure/index.html">Congruence_closure</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Cst"><a href="#module-Cst" class="anchor"></a><code><span class="keyword">module </span><a href="Cst/index.html">Cst</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Equiv_class"><a href="#module-Equiv_class" class="anchor"></a><code><span class="keyword">module </span><a href="Equiv_class/index.html">Equiv_class</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Explanation"><a href="#module-Explanation" class="anchor"></a><code><span class="keyword">module </span><a href="Explanation/index.html">Explanation</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Hash"><a href="#module-Hash" class="anchor"></a><code><span class="keyword">module </span><a href="Hash/index.html">Hash</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Het_map"><a href="#module-Het_map" class="anchor"></a><code><span class="keyword">module </span><a href="Het_map/index.html">Het_map</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Model"><a href="#module-Model" class="anchor"></a><code><span class="keyword">module </span><a href="Model/index.html">Model</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Solver"><a href="#module-Solver" class="anchor"></a><code><span class="keyword">module </span><a href="Solver/index.html">Solver</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Solver_types"><a href="#module-Solver_types" class="anchor"></a><code><span class="keyword">module </span><a href="Solver_types/index.html">Solver_types</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Stat"><a href="#module-Stat" class="anchor"></a><code><span class="keyword">module </span><a href="Stat/index.html">Stat</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Term"><a href="#module-Term" class="anchor"></a><code><span class="keyword">module </span><a href="Term/index.html">Term</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Term_cell"><a href="#module-Term_cell" class="anchor"></a><code><span class="keyword">module </span><a href="Term_cell/index.html">Term_cell</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Theory"><a href="#module-Theory" class="anchor"></a><code><span class="keyword">module </span><a href="Theory/index.html">Theory</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Theory_combine"><a href="#module-Theory_combine" class="anchor"></a><code><span class="keyword">module </span><a href="Theory_combine/index.html">Theory_combine</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Ty"><a href="#module-Ty" class="anchor"></a><code><span class="keyword">module </span><a href="Ty/index.html">Ty</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Ty_card"><a href="#module-Ty_card" class="anchor"></a><code><span class="keyword">module </span><a href="Ty_card/index.html">Ty_card</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Ast/.jbuilder-keep b/sidekick/Sidekick_smt__Ast/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Ast/Ty/index.html b/sidekick/Sidekick_smt__Ast/Ty/index.html
new file mode 100644
index 00000000..1766133a
--- /dev/null
+++ b/sidekick/Sidekick_smt__Ast/Ty/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Ty (sidekick.Sidekick_smt__Ast.Ty)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Ast.Ty</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-t.Prop" class="anchored"><td class="def constructor"><a href="#type-t.Prop" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Prop</span></code></td></tr><tr id="type-t.App" class="anchored"><td class="def constructor"><a href="#type-t.App" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">App</span><span class="keyword"> of </span><a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="index.html#type-t">t</a> list</code></td></tr><tr id="type-t.Arrow" class="anchored"><td class="def constructor"><a href="#type-t.Arrow" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Arrow</span><span class="keyword"> of </span><a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="index.html#type-t">t</a></code></td></tr></table><code></code></dt></dl><dl><dt id="val-prop"><a href="#val-prop" class="anchor"></a><code><span class="keyword">val </span>prop : <a href="index.html#type-t">t</a></code></dt><dt id="val-const"><a href="#val-const" class="anchor"></a><code><span class="keyword">val </span>const : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-app"><a href="#val-app" class="anchor"></a><code><span class="keyword">val </span>app : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-arrow"><a href="#val-arrow" class="anchor"></a><code><span class="keyword">val </span>arrow : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-arrow_l"><a href="#val-arrow_l" class="anchor"></a><code><span class="keyword">val </span>arrow_l : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-rat"><a href="#val-rat" class="anchor"></a><code><span class="keyword">val </span>rat : <a href="index.html#type-t">t</a></code></dt><dt id="val-int"><a href="#val-int" class="anchor"></a><code><span class="keyword">val </span>int : <a href="index.html#type-t">t</a></code></dt></dl><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../Sidekick_util/Intf/index.html#module-type-EQ">Sidekick_util.Intf.EQ</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_util/Intf/module-type-EQ/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></details></div></div></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../Sidekick_util/Intf/index.html#module-type-ORD">Sidekick_util.Intf.ORD</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_util/Intf/module-type-ORD/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></details></div></div></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../Sidekick_util/Intf/index.html#module-type-HASH">Sidekick_util.Intf.HASH</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_util/Intf/module-type-HASH/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></details></div></div></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../../Sidekick_util/Intf/index.html#module-type-PRINT">Sidekick_util.Intf.PRINT</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_util/Intf/module-type-PRINT/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></details></div></div></article><dl><dt id="val-unfold"><a href="#val-unfold" class="anchor"></a><code><span class="keyword">val </span>unfold : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> list<span class="keyword"> * </span><a href="index.html#type-t">t</a></code></dt><dd><p><code>unfold ty</code> will get the list of arguments, and the return type of any function. An atomic type is just a function with no arguments</p></dd></dl><section><header><h2 id="datatypes"><a href="#datatypes" class="anchor"></a>Datatypes</h2></header><dl><dt id="type-data"><a href="#type-data" class="anchor"></a><code><span class="keyword">type </span>data</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-data.data_id" class="anchored"><td class="def field"><a href="#type-data.data_id" class="anchor"></a><code>data_id : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a>;</code></td></tr><tr id="type-data.data_cstors" class="anchored"><td class="def field"><a href="#type-data.data_cstors" class="anchor"></a><code>data_cstors : <a href="index.html#type-t">t</a> <a href="../../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t;</code></td></tr></table><code>}</code><code></code></dt><dd><p>Mutually recursive datatypes</p></dd></dl><article id="module-Map"><a href="#module-Map" class="anchor"></a><code><span class="keyword">module </span>Map : CCMap.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Map">Map</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></section><section><header><h2 id="error-handling"><a href="#error-handling" class="anchor"></a>Error Handling</h2></header><dl><dt id="val-ill_typed"><a href="#val-ill_typed" class="anchor"></a><code><span class="keyword">val </span>ill_typed : (<span class="type-var">'a</span>, Format.formatter, unit, <span class="type-var">'b</span>) Pervasives.format4 <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Ast/Var/index.html b/sidekick/Sidekick_smt__Ast/Var/index.html
new file mode 100644
index 00000000..1616d188
--- /dev/null
+++ b/sidekick/Sidekick_smt__Ast/Var/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Var (sidekick.Sidekick_smt__Ast.Var)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Ast.Var</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'ty t</code><code></code><code><span class="keyword"> = </span><span class="keyword">private </span></code><code>{</code><table class="record"><tr id="type-t.id" class="anchored"><td class="def field"><a href="#type-t.id" class="anchor"></a><code>id : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a>;</code></td></tr><tr id="type-t.ty" class="anchored"><td class="def field"><a href="#type-t.ty" class="anchor"></a><code>ty : <span class="type-var">'ty</span>;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <span class="type-var">'ty</span> <span>&#8209;&gt;</span> <span class="type-var">'ty</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-makef"><a href="#val-makef" class="anchor"></a><code><span class="keyword">val </span>makef : ty:<span class="type-var">'a</span> <span>&#8209;&gt;</span> (<span class="type-var">'b</span>, Format.formatter, unit, <span class="type-var">'a</span> <a href="index.html#type-t">t</a>) Pervasives.format4 <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <span class="type-var">_</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></dt><dt id="val-ty"><a href="#val-ty" class="anchor"></a><code><span class="keyword">val </span>ty : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <span class="type-var">_</span> <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Ast/index.html b/sidekick/Sidekick_smt__Ast/index.html
new file mode 100644
index 00000000..7e4ea5ab
--- /dev/null
+++ b/sidekick/Sidekick_smt__Ast/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Ast (sidekick.Sidekick_smt__Ast)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Ast</code></h1><h1 id="preprocessing-ast"><a href="#preprocessing-ast" class="anchor"></a>Preprocessing AST</h1><nav><ul><li><a href="#types">Types</a></li><li><a href="#constructors">Constructors</a></li><li><a href="#helpers">helpers</a></li><li><a href="#printing">Printing</a></li><li><a href="#environment">Environment</a></li></ul></nav></header><dl><dt id="type-or_error"><a href="#type-or_error" class="anchor"></a><code><span class="keyword">type </span>'a or_error</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span>, string) CCResult.t</code><code></code></dt></dl><section><header><h2 id="types"><a href="#types" class="anchor"></a>Types</h2></header><article id="module-Var"><a href="#module-Var" class="anchor"></a><code><span class="keyword">module </span><a href="Var/index.html">Var</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Ty"><a href="#module-Ty" class="anchor"></a><code><span class="keyword">module </span><a href="Ty/index.html">Ty</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code><span class="keyword"> = </span><a href="Ty/index.html#type-t">Ty.t</a> <a href="Var/index.html#type-t">Var.t</a></code><code></code></dt><dt id="type-op"><a href="#type-op" class="anchor"></a><code><span class="keyword">type </span>op</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-op.And" class="anchored"><td class="def constructor"><a href="#type-op.And" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">And</span></code></td></tr><tr id="type-op.Or" class="anchored"><td class="def constructor"><a href="#type-op.Or" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Or</span></code></td></tr><tr id="type-op.Imply" class="anchored"><td class="def constructor"><a href="#type-op.Imply" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Imply</span></code></td></tr><tr id="type-op.Eq" class="anchored"><td class="def constructor"><a href="#type-op.Eq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Eq</span></code></td></tr><tr id="type-op.Distinct" class="anchored"><td class="def constructor"><a href="#type-op.Distinct" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Distinct</span></code></td></tr></table><code></code></dt><dt id="type-arith_op"><a href="#type-arith_op" class="anchor"></a><code><span class="keyword">type </span>arith_op</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-arith_op.Leq" class="anchored"><td class="def constructor"><a href="#type-arith_op.Leq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Leq</span></code></td></tr><tr id="type-arith_op.Lt" class="anchored"><td class="def constructor"><a href="#type-arith_op.Lt" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lt</span></code></td></tr><tr id="type-arith_op.Geq" class="anchored"><td class="def constructor"><a href="#type-arith_op.Geq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Geq</span></code></td></tr><tr id="type-arith_op.Gt" class="anchored"><td class="def constructor"><a href="#type-arith_op.Gt" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Gt</span></code></td></tr><tr id="type-arith_op.Add" class="anchored"><td class="def constructor"><a href="#type-arith_op.Add" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Add</span></code></td></tr><tr id="type-arith_op.Minus" class="anchored"><td class="def constructor"><a href="#type-arith_op.Minus" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Minus</span></code></td></tr><tr id="type-arith_op.Mult" class="anchored"><td class="def constructor"><a href="#type-arith_op.Mult" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Mult</span></code></td></tr><tr id="type-arith_op.Div" class="anchored"><td class="def constructor"><a href="#type-arith_op.Div" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Div</span></code></td></tr></table><code></code></dt><dt id="type-binder"><a href="#type-binder" class="anchor"></a><code><span class="keyword">type </span>binder</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-binder.Fun" class="anchored"><td class="def constructor"><a href="#type-binder.Fun" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Fun</span></code></td></tr><tr id="type-binder.Forall" class="anchored"><td class="def constructor"><a href="#type-binder.Forall" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Forall</span></code></td></tr><tr id="type-binder.Exists" class="anchored"><td class="def constructor"><a href="#type-binder.Exists" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Exists</span></code></td></tr><tr id="type-binder.Mu" class="anchored"><td class="def constructor"><a href="#type-binder.Mu" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Mu</span></code></td></tr></table><code></code></dt><dt id="type-term"><a href="#type-term" class="anchor"></a><code><span class="keyword">type </span>term</code><code></code><code><span class="keyword"> = </span><span class="keyword">private </span></code><code>{</code><table class="record"><tr id="type-term.term" class="anchored"><td class="def field"><a href="#type-term.term" class="anchor"></a><code>term : <a href="index.html#type-term_cell">term_cell</a>;</code></td></tr><tr id="type-term.ty" class="anchored"><td class="def field"><a href="#type-term.ty" class="anchor"></a><code>ty : <a href="Ty/index.html#type-t">Ty.t</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-term_cell"><a href="#type-term_cell" class="anchor"></a><code><span class="keyword">type </span>term_cell</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-term_cell.Var" class="anchored"><td class="def constructor"><a href="#type-term_cell.Var" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Var</span><span class="keyword"> of </span><a href="index.html#type-var">var</a></code></td></tr><tr id="type-term_cell.Const" class="anchored"><td class="def constructor"><a href="#type-term_cell.Const" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Const</span><span class="keyword"> of </span><a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></td></tr><tr id="type-term_cell.Num_z" class="anchored"><td class="def constructor"><a href="#type-term_cell.Num_z" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Num_z</span><span class="keyword"> of </span>Z.t</code></td></tr><tr id="type-term_cell.Num_q" class="anchored"><td class="def constructor"><a href="#type-term_cell.Num_q" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Num_q</span><span class="keyword"> of </span>Q.t</code></td></tr><tr id="type-term_cell.App" class="anchored"><td class="def constructor"><a href="#type-term_cell.App" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">App</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a> list</code></td></tr><tr id="type-term_cell.If" class="anchored"><td class="def constructor"><a href="#type-term_cell.If" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">If</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term_cell.Match" class="anchored"><td class="def constructor"><a href="#type-term_cell.Match" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Match</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span>(<a href="index.html#type-var">var</a> list<span class="keyword"> * </span><a href="index.html#type-term">term</a>) <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t</code></td></tr><tr id="type-term_cell.Select" class="anchored"><td class="def constructor"><a href="#type-term_cell.Select" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Select</span><span class="keyword"> of </span><a href="index.html#type-select">select</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term_cell.Bind" class="anchored"><td class="def constructor"><a href="#type-term_cell.Bind" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bind</span><span class="keyword"> of </span><a href="index.html#type-binder">binder</a><span class="keyword"> * </span><a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term_cell.Arith" class="anchored"><td class="def constructor"><a href="#type-term_cell.Arith" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Arith</span><span class="keyword"> of </span><a href="index.html#type-arith_op">arith_op</a><span class="keyword"> * </span><a href="index.html#type-term">term</a> list</code></td></tr><tr id="type-term_cell.Let" class="anchored"><td class="def constructor"><a href="#type-term_cell.Let" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Let</span><span class="keyword"> of </span>(<a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-term">term</a>) list<span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term_cell.Not" class="anchored"><td class="def constructor"><a href="#type-term_cell.Not" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Not</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term_cell.Op" class="anchored"><td class="def constructor"><a href="#type-term_cell.Op" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Op</span><span class="keyword"> of </span><a href="index.html#type-op">op</a><span class="keyword"> * </span><a href="index.html#type-term">term</a> list</code></td></tr><tr id="type-term_cell.Asserting" class="anchored"><td class="def constructor"><a href="#type-term_cell.Asserting" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Asserting</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-term_cell.t" class="anchored"><td class="def field"><a href="#type-term_cell.t" class="anchor"></a><code>t : <a href="index.html#type-term">term</a>;</code></td></tr><tr id="type-term_cell.guard" class="anchored"><td class="def field"><a href="#type-term_cell.guard" class="anchor"></a><code>guard : <a href="index.html#type-term">term</a>;</code></td></tr></table><code>}</code><code></code></td></tr><tr id="type-term_cell.Undefined_value" class="anchored"><td class="def constructor"><a href="#type-term_cell.Undefined_value" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Undefined_value</span></code></td></tr><tr id="type-term_cell.Bool" class="anchored"><td class="def constructor"><a href="#type-term_cell.Bool" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bool</span><span class="keyword"> of </span>bool</code></td></tr></table><code></code></dt><dt id="type-select"><a href="#type-select" class="anchor"></a><code><span class="keyword">type </span>select</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-select.select_name" class="anchored"><td class="def field"><a href="#type-select.select_name" class="anchor"></a><code>select_name : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> lazy_t;</code></td></tr><tr id="type-select.select_cstor" class="anchored"><td class="def field"><a href="#type-select.select_cstor" class="anchor"></a><code>select_cstor : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a>;</code></td></tr><tr id="type-select.select_i" class="anchored"><td class="def field"><a href="#type-select.select_i" class="anchor"></a><code>select_i : int;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-definition"><a href="#type-definition" class="anchor"></a><code><span class="keyword">type </span>definition</code><code><span class="keyword"> = </span><a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="Ty/index.html#type-t">Ty.t</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code><code></code></dt><dt id="type-statement"><a href="#type-statement" class="anchor"></a><code><span class="keyword">type </span>statement</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-statement.SetLogic" class="anchored"><td class="def constructor"><a href="#type-statement.SetLogic" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">SetLogic</span><span class="keyword"> of </span>string</code></td></tr><tr id="type-statement.SetOption" class="anchored"><td class="def constructor"><a href="#type-statement.SetOption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">SetOption</span><span class="keyword"> of </span>string list</code></td></tr><tr id="type-statement.SetInfo" class="anchored"><td class="def constructor"><a href="#type-statement.SetInfo" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">SetInfo</span><span class="keyword"> of </span>string list</code></td></tr><tr id="type-statement.Data" class="anchored"><td class="def constructor"><a href="#type-statement.Data" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Data</span><span class="keyword"> of </span><a href="Ty/index.html#type-data">Ty.data</a> list</code></td></tr><tr id="type-statement.TyDecl" class="anchored"><td class="def constructor"><a href="#type-statement.TyDecl" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">TyDecl</span><span class="keyword"> of </span><a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span>int</code></td></tr><tr id="type-statement.Decl" class="anchored"><td class="def constructor"><a href="#type-statement.Decl" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Decl</span><span class="keyword"> of </span><a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="Ty/index.html#type-t">Ty.t</a></code></td></tr><tr id="type-statement.Define" class="anchored"><td class="def constructor"><a href="#type-statement.Define" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Define</span><span class="keyword"> of </span><a href="index.html#type-definition">definition</a> list</code></td></tr><tr id="type-statement.Assert" class="anchored"><td class="def constructor"><a href="#type-statement.Assert" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assert</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-statement.Assert_bool" class="anchored"><td class="def constructor"><a href="#type-statement.Assert_bool" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assert_bool</span><span class="keyword"> of </span>int list</code></td></tr><tr id="type-statement.Goal" class="anchored"><td class="def constructor"><a href="#type-statement.Goal" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Goal</span><span class="keyword"> of </span><a href="index.html#type-var">var</a> list<span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-statement.CheckSat" class="anchored"><td class="def constructor"><a href="#type-statement.CheckSat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">CheckSat</span></code></td></tr><tr id="type-statement.Exit" class="anchored"><td class="def constructor"><a href="#type-statement.Exit" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Exit</span></code></td></tr></table><code></code></dt></dl></section><section><header><h2 id="constructors"><a href="#constructors" class="anchor"></a>Constructors</h2></header><dl><dt id="val-term_view"><a href="#val-term_view" class="anchor"></a><code><span class="keyword">val </span>term_view : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term_cell">term_cell</a></code></dt><dt id="val-ty"><a href="#val-ty" class="anchor"></a><code><span class="keyword">val </span>ty : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="Ty/index.html#type-t">Ty.t</a></code></dt><dt id="val-var"><a href="#val-var" class="anchor"></a><code><span class="keyword">val </span>var : <a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-const"><a href="#val-const" class="anchor"></a><code><span class="keyword">val </span>const : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-app"><a href="#val-app" class="anchor"></a><code><span class="keyword">val </span>app : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-app_a"><a href="#val-app_a" class="anchor"></a><code><span class="keyword">val </span>app_a : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> array <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-if_"><a href="#val-if_" class="anchor"></a><code><span class="keyword">val </span>if_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-match_"><a href="#val-match_" class="anchor"></a><code><span class="keyword">val </span>match_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> (<a href="index.html#type-var">var</a> list<span class="keyword"> * </span><a href="index.html#type-term">term</a>) <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-let_"><a href="#val-let_" class="anchor"></a><code><span class="keyword">val </span>let_ : <a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-let_l"><a href="#val-let_l" class="anchor"></a><code><span class="keyword">val </span>let_l : (<a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-term">term</a>) list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-bind"><a href="#val-bind" class="anchor"></a><code><span class="keyword">val </span>bind : ty:<a href="Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-binder">binder</a> <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-select"><a href="#val-select" class="anchor"></a><code><span class="keyword">val </span>select : ty:<a href="Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-select">select</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-fun_"><a href="#val-fun_" class="anchor"></a><code><span class="keyword">val </span>fun_ : <a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-fun_l"><a href="#val-fun_l" class="anchor"></a><code><span class="keyword">val </span>fun_l : <a href="index.html#type-var">var</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-fun_a"><a href="#val-fun_a" class="anchor"></a><code><span class="keyword">val </span>fun_a : <a href="index.html#type-var">var</a> array <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-forall"><a href="#val-forall" class="anchor"></a><code><span class="keyword">val </span>forall : <a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-forall_l"><a href="#val-forall_l" class="anchor"></a><code><span class="keyword">val </span>forall_l : <a href="index.html#type-var">var</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-exists"><a href="#val-exists" class="anchor"></a><code><span class="keyword">val </span>exists : <a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-exists_l"><a href="#val-exists_l" class="anchor"></a><code><span class="keyword">val </span>exists_l : <a href="index.html#type-var">var</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-mu"><a href="#val-mu" class="anchor"></a><code><span class="keyword">val </span>mu : <a href="index.html#type-var">var</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-eq"><a href="#val-eq" class="anchor"></a><code><span class="keyword">val </span>eq : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-not_"><a href="#val-not_" class="anchor"></a><code><span class="keyword">val </span>not_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-op"><a href="#val-op" class="anchor"></a><code><span class="keyword">val </span>op : <a href="index.html#type-op">op</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-and_"><a href="#val-and_" class="anchor"></a><code><span class="keyword">val </span>and_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-and_l"><a href="#val-and_l" class="anchor"></a><code><span class="keyword">val </span>and_l : <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-or_"><a href="#val-or_" class="anchor"></a><code><span class="keyword">val </span>or_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-or_l"><a href="#val-or_l" class="anchor"></a><code><span class="keyword">val </span>or_l : <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-imply"><a href="#val-imply" class="anchor"></a><code><span class="keyword">val </span>imply : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-true_"><a href="#val-true_" class="anchor"></a><code><span class="keyword">val </span>true_ : <a href="index.html#type-term">term</a></code></dt><dt id="val-false_"><a href="#val-false_" class="anchor"></a><code><span class="keyword">val </span>false_ : <a href="index.html#type-term">term</a></code></dt><dt id="val-undefined_value"><a href="#val-undefined_value" class="anchor"></a><code><span class="keyword">val </span>undefined_value : <a href="Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-asserting"><a href="#val-asserting" class="anchor"></a><code><span class="keyword">val </span>asserting : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-num_z"><a href="#val-num_z" class="anchor"></a><code><span class="keyword">val </span>num_z : <a href="Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> Z.t <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-num_q"><a href="#val-num_q" class="anchor"></a><code><span class="keyword">val </span>num_q : <a href="Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> Q.t <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-num_str"><a href="#val-num_str" class="anchor"></a><code><span class="keyword">val </span>num_str : <a href="Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dd><p>parses int + <code>num</code></p></dd></dl><dl><dt id="val-arith"><a href="#val-arith" class="anchor"></a><code><span class="keyword">val </span>arith : <a href="Ty/index.html#type-t">Ty.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-arith_op">arith_op</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dd><p>parses int + <code>num</code></p></dd></dl></section><section><header><h2 id="helpers"><a href="#helpers" class="anchor"></a>helpers</h2></header><dl><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-unfold_binder"><a href="#val-unfold_binder" class="anchor"></a><code><span class="keyword">val </span>unfold_binder : <a href="index.html#type-binder">binder</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a> list<span class="keyword"> * </span><a href="index.html#type-term">term</a></code></dt><dt id="val-unfold_fun"><a href="#val-unfold_fun" class="anchor"></a><code><span class="keyword">val </span>unfold_fun : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-var">var</a> list<span class="keyword"> * </span><a href="index.html#type-term">term</a></code></dt></dl></section><section><header><h2 id="printing"><a href="#printing" class="anchor"></a>Printing</h2></header><dl><dt id="val-pp_ty"><a href="#val-pp_ty" class="anchor"></a><code><span class="keyword">val </span>pp_ty : <a href="Ty/index.html#type-t">Ty.t</a> CCFormat.printer</code></dt><dt id="val-pp_term"><a href="#val-pp_term" class="anchor"></a><code><span class="keyword">val </span>pp_term : <a href="index.html#type-term">term</a> CCFormat.printer</code></dt><dt id="val-pp_statement"><a href="#val-pp_statement" class="anchor"></a><code><span class="keyword">val </span>pp_statement : <a href="index.html#type-statement">statement</a> CCFormat.printer</code></dt></dl></section><section><header><h2 id="environment"><a href="#environment" class="anchor"></a>Environment</h2></header><dl><dt id="type-env_entry"><a href="#type-env_entry" class="anchor"></a><code><span class="keyword">type </span>env_entry</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-env_entry.E_uninterpreted_ty" class="anchored"><td class="def constructor"><a href="#type-env_entry.E_uninterpreted_ty" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_uninterpreted_ty</span></code></td></tr><tr id="type-env_entry.E_uninterpreted_cst" class="anchored"><td class="def constructor"><a href="#type-env_entry.E_uninterpreted_cst" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_uninterpreted_cst</span></code></td></tr><tr id="type-env_entry.E_const" class="anchored"><td class="def constructor"><a href="#type-env_entry.E_const" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_const</span><span class="keyword"> of </span><a href="Ty/index.html#type-t">Ty.t</a></code></td></tr><tr id="type-env_entry.E_data" class="anchored"><td class="def constructor"><a href="#type-env_entry.E_data" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_data</span><span class="keyword"> of </span><a href="Ty/index.html#type-t">Ty.t</a> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t</code></td></tr><tr id="type-env_entry.E_cstor" class="anchored"><td class="def constructor"><a href="#type-env_entry.E_cstor" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_cstor</span><span class="keyword"> of </span><a href="Ty/index.html#type-t">Ty.t</a></code></td></tr><tr id="type-env_entry.E_defined" class="anchored"><td class="def constructor"><a href="#type-env_entry.E_defined" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_defined</span><span class="keyword"> of </span><a href="Ty/index.html#type-t">Ty.t</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr></table><code></code></dt><dt id="type-env"><a href="#type-env" class="anchor"></a><code><span class="keyword">type </span>env</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-env.defs" class="anchored"><td class="def field"><a href="#type-env.defs" class="anchor"></a><code>defs : <a href="index.html#type-env_entry">env_entry</a> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t;</code></td></tr></table><code>}</code><code></code></dt><dd><p>Environment with definitions and goals</p></dd></dl><dl><dt id="val-env_empty"><a href="#val-env_empty" class="anchor"></a><code><span class="keyword">val </span>env_empty : <a href="index.html#type-env">env</a></code></dt><dt id="val-env_add_statement"><a href="#val-env_add_statement" class="anchor"></a><code><span class="keyword">val </span>env_add_statement : <a href="index.html#type-env">env</a> <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a> <span>&#8209;&gt;</span> <a href="index.html#type-env">env</a></code></dt><dt id="val-env_of_statements"><a href="#val-env_of_statements" class="anchor"></a><code><span class="keyword">val </span>env_of_statements : <a href="index.html#type-statement">statement</a> Sequence.t <span>&#8209;&gt;</span> <a href="index.html#type-env">env</a></code></dt><dt id="val-env_find_def"><a href="#val-env_find_def" class="anchor"></a><code><span class="keyword">val </span>env_find_def : <a href="index.html#type-env">env</a> <span>&#8209;&gt;</span> <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-env_entry">env_entry</a> option</code></dt><dt id="val-env_add_def"><a href="#val-env_add_def" class="anchor"></a><code><span class="keyword">val </span>env_add_def : <a href="index.html#type-env">env</a> <span>&#8209;&gt;</span> <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-env_entry">env_entry</a> <span>&#8209;&gt;</span> <a href="index.html#type-env">env</a></code></dt></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Bag/.jbuilder-keep b/sidekick/Sidekick_smt__Bag/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Bag/index.html b/sidekick/Sidekick_smt__Bag/index.html
new file mode 100644
index 00000000..a3e8e23d
--- /dev/null
+++ b/sidekick/Sidekick_smt__Bag/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Bag (sidekick.Sidekick_smt__Bag)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Bag</code></h1><h1 id="ordered-bag-of-elements"><a href="#ordered-bag-of-elements" class="anchor"></a>Ordered Bag of Elements</h1><p>A data structure where we can have duplicate elements, optimized for fast concatenation and size.</p></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>+'a t</code><code></code><code><span class="keyword"> = </span><span class="keyword">private </span></code><table class="variant"><tr id="type-t.E" class="anchored"><td class="def constructor"><a href="#type-t.E" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E</span></code></td></tr><tr id="type-t.L" class="anchored"><td class="def constructor"><a href="#type-t.L" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">L</span><span class="keyword"> of </span><span class="type-var">'a</span></code></td></tr><tr id="type-t.N" class="anchored"><td class="def constructor"><a href="#type-t.N" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">N</span><span class="keyword"> of </span><span class="type-var">'a</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><span class="type-var">'a</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span>int</code></td></tr></table><code></code></dt></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <span class="type-var">_</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-return"><a href="#val-return" class="anchor"></a><code><span class="keyword">val </span>return : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <span class="type-var">_</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Constant time</p></dd></dl><dl><dt id="val-cons"><a href="#val-cons" class="anchor"></a><code><span class="keyword">val </span>cons : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-append"><a href="#val-append" class="anchor"></a><code><span class="keyword">val </span>append : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t</code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Are the two bags equal, element wise?</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Config/.jbuilder-keep b/sidekick/Sidekick_smt__Config/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Config/Key/index.html b/sidekick/Sidekick_smt__Config/Key/index.html
new file mode 100644
index 00000000..4c16cd2c
--- /dev/null
+++ b/sidekick/Sidekick_smt__Config/Key/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Key (sidekick.Sidekick_smt__Config.Key)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Config.Key</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Compare two keys that have compatible types</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Config/index.html b/sidekick/Sidekick_smt__Config/index.html
new file mode 100644
index 00000000..26abb301
--- /dev/null
+++ b/sidekick/Sidekick_smt__Config/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Config (sidekick.Sidekick_smt__Config)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Config</code></h1><h1 id="configuration"><a href="#configuration" class="anchor"></a>Configuration</h1></header><dl><dt id="type-sequence"><a href="#type-sequence" class="anchor"></a><code><span class="keyword">type </span>'a sequence</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><article id="module-Key"><a href="#module-Key" class="anchor"></a><code><span class="keyword">module </span><a href="Key/index.html">Key</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">_</span> <a href="Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cardinal"><a href="#val-cardinal" class="anchor"></a><code><span class="keyword">val </span>cardinal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_exn"><a href="#val-find_exn" class="anchor"></a><code><span class="keyword">val </span>find_exn : <span class="type-var">'a</span> <a href="Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><dl><dt>raises Not_found</dt><dd><p>if the key is not in the table</p></dd></dl></dd></dl><dl><dt id="type-pair"><a href="#type-pair" class="anchor"></a><code><span class="keyword">type </span>pair</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-pair.Pair" class="anchored"><td class="def constructor"><a href="#type-pair.Pair" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Pair</span><span class="keyword"> : </span><span class="type-var">'a</span> <a href="Key/index.html#type-t">Key.t</a><span class="keyword"> * </span><span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-pair">pair</a></code></td></tr></table><code></code></dt></dl><dl><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-pair">pair</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-pair">pair</a> <a href="index.html#type-sequence">sequence</a></code></dt><dt id="val-of_seq"><a href="#val-of_seq" class="anchor"></a><code><span class="keyword">val </span>of_seq : <a href="index.html#type-pair">pair</a> <a href="index.html#type-sequence">sequence</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add_seq"><a href="#val-add_seq" class="anchor"></a><code><span class="keyword">val </span>add_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-pair">pair</a> <a href="index.html#type-sequence">sequence</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add_list"><a href="#val-add_list" class="anchor"></a><code><span class="keyword">val </span>add_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-pair">pair</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_list"><a href="#val-of_list" class="anchor"></a><code><span class="keyword">val </span>of_list : <a href="index.html#type-pair">pair</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list"><a href="#val-to_list" class="anchor"></a><code><span class="keyword">val </span>to_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-pair">pair</a> list</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Congruence_closure/.jbuilder-keep b/sidekick/Sidekick_smt__Congruence_closure/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Congruence_closure/index.html b/sidekick/Sidekick_smt__Congruence_closure/index.html
new file mode 100644
index 00000000..4f1ba9bc
--- /dev/null
+++ b/sidekick/Sidekick_smt__Congruence_closure/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Congruence_closure (sidekick.Sidekick_smt__Congruence_closure)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Congruence_closure</code></h1><h2 id="congruence-closure"><a href="#congruence-closure" class="anchor"></a>Congruence Closure</h2></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Global state of the congruence closure</p></dd></dl><dl><dt id="type-node"><a href="#type-node" class="anchor"></a><code><span class="keyword">type </span>node</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Equiv_class/index.html#type-t">Sidekick_smt.Equiv_class.t</a></code><code></code></dt><dd><p>Node in the congruence closure</p></dd></dl><dl><dt id="type-repr"><a href="#type-repr" class="anchor"></a><code><span class="keyword">type </span>repr</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Equiv_class/index.html#type-t">Sidekick_smt.Equiv_class.t</a></code><code></code></dt><dd><p>Node that is currently a representative</p></dd></dl><dl><dt id="type-actions"><a href="#type-actions" class="anchor"></a><code><span class="keyword">type </span>actions</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-actions.on_backtrack" class="anchored"><td class="def field"><a href="#type-actions.on_backtrack" class="anchor"></a><code>on_backtrack : (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Register a callback to be invoked upon backtracking below the current level</p></td></tr><tr id="type-actions.on_merge" class="anchored"><td class="def field"><a href="#type-actions.on_merge" class="anchor"></a><code>on_merge : <a href="index.html#type-repr">repr</a> <span>&#8209;&gt;</span> <a href="index.html#type-repr">repr</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Call this when two classes are merged</p></td></tr><tr id="type-actions.raise_conflict" class="anchored"><td class="def field"><a href="#type-actions.raise_conflict" class="anchor"></a><code>raise_conflict : a. <a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <span class="type-var">'a</span>;</code></td><td class="doc"><p>Report a conflict</p></td></tr><tr id="type-actions.propagate" class="anchored"><td class="def field"><a href="#type-actions.propagate" class="anchor"></a><code>propagate : <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Explanation/index.html#type-t">Sidekick_smt.Explanation.t</a> <a href="../Sidekick_smt/Bag/index.html#type-t">Sidekick_smt.Bag.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Propagate a literal</p></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:int <span>&#8209;&gt;</span> actions:<a href="index.html#type-actions">actions</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new congruence closure.</p><dl><dt>parameter acts</dt><dd><p>the actions available to the congruence closure</p></dd></dl></dd></dl><dl><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="index.html#type-repr">repr</a></code></dt><dd><p>Current representative</p></dd></dl><dl><dt id="val-same_class"><a href="#val-same_class" class="anchor"></a><code><span class="keyword">val </span>same_class : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Are these two classes the same in the current CC?</p></dd></dl><dl><dt id="val-union"><a href="#val-union" class="anchor"></a><code><span class="keyword">val </span>union : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Merge the two equivalence classes. Will be undone on backtracking.</p></dd></dl><dl><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Is the term properly added to the congruence closure?</p></dd></dl><dl><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a></code></dt><dd><p>Add the term to the congruence closure, if not present already. Will be backtracked.</p></dd></dl><dl><dt id="val-add_seq"><a href="#val-add_seq" class="anchor"></a><code><span class="keyword">val </span>add_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> Sequence.t <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a sequence of terms to the congruence closure</p></dd></dl><dl><dt id="val-all_classes"><a href="#val-all_classes" class="anchor"></a><code><span class="keyword">val </span>all_classes : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-repr">repr</a> Sequence.t</code></dt><dd><p>All current classes</p></dd></dl><dl><dt id="val-assert_lit"><a href="#val-assert_lit" class="anchor"></a><code><span class="keyword">val </span>assert_lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Given a literal, assume it in the congruence closure and propagate its consequences. Will be backtracked.</p></dd></dl><dl><dt id="val-assert_eq"><a href="#val-assert_eq" class="anchor"></a><code><span class="keyword">val </span>assert_eq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-assert_distinct"><a href="#val-assert_distinct" class="anchor"></a><code><span class="keyword">val </span>assert_distinct : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> list <span>&#8209;&gt;</span> neq:<a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>assert_distinct l ~expl:u e</code> asserts all elements of <code>l</code> are distinct with explanation <code>e</code> precond: <code>u = distinct l</code></p></dd></dl><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-final_check"><a href="#val-final_check" class="anchor"></a><code><span class="keyword">val </span>final_check : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-explain_eq_n"><a href="#val-explain_eq_n" class="anchor"></a><code><span class="keyword">val </span>explain_eq_n : ?&#8288;init:<a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="index.html#type-node">node</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code></dt><dd><p>explain why the two nodes are equal</p></dd></dl><dl><dt id="val-explain_eq_t"><a href="#val-explain_eq_t" class="anchor"></a><code><span class="keyword">val </span>explain_eq_t : ?&#8288;init:<a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code></dt><dd><p>explain why the two terms are equal</p></dd></dl><dl><dt id="val-explain_unfold_bag"><a href="#val-explain_unfold_bag" class="anchor"></a><code><span class="keyword">val </span>explain_unfold_bag : ?&#8288;init:<a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> <a href="../Sidekick_smt/Bag/index.html#type-t">Sidekick_smt.Bag.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code></dt><dt id="val-explain_unfold_seq"><a href="#val-explain_unfold_seq" class="anchor"></a><code><span class="keyword">val </span>explain_unfold_seq : ?&#8288;init:<a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> Sequence.t <span>&#8209;&gt;</span> <a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code></dt><dd><p>Unfold those explanations into a complete set of literals implying them</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Cst/.jbuilder-keep b/sidekick/Sidekick_smt__Cst/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Cst/index.html b/sidekick/Sidekick_smt__Cst/index.html
new file mode 100644
index 00000000..0b353ed3
--- /dev/null
+++ b/sidekick/Sidekick_smt__Cst/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Cst (sidekick.Sidekick_smt__Cst)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Cst</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a></code><code></code></dt></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></dt><dt id="val-ty"><a href="#val-ty" class="anchor"></a><code><span class="keyword">val </span>ty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a></code></dt><dt id="val-make_cstor"><a href="#val-make_cstor" class="anchor"></a><code><span class="keyword">val </span>make_cstor : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a> lazy_t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_proj"><a href="#val-make_proj" class="anchor"></a><code><span class="keyword">val </span>make_proj : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a> lazy_t <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_tester"><a href="#val-make_tester" class="anchor"></a><code><span class="keyword">val </span>make_tester : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a> lazy_t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_defined"><a href="#val-make_defined" class="anchor"></a><code><span class="keyword">val </span>make_defined : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> lazy_t <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-cst_defined_info">Sidekick_smt.Solver_types.cst_defined_info</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_undef"><a href="#val-make_undef" class="anchor"></a><code><span class="keyword">val </span>make_undef : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-arity"><a href="#val-arity" class="anchor"></a><code><span class="keyword">val </span>arity : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-as_undefined"><a href="#val-as_undefined" class="anchor"></a><code><span class="keyword">val </span>as_undefined : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a>) option</code></dt><dt id="val-as_undefined_exn"><a href="#val-as_undefined_exn" class="anchor"></a><code><span class="keyword">val </span>as_undefined_exn : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a></code></dt><dt id="val-is_finite_cstor"><a href="#val-is_finite_cstor" class="anchor"></a><code><span class="keyword">val </span>is_finite_cstor : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer</code></dt></dl><article id="module-Map"><a href="#module-Map" class="anchor"></a><code><span class="keyword">module </span>Map : CCMap.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Map">Map</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Equiv_class/.jbuilder-keep b/sidekick/Sidekick_smt__Equiv_class/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Equiv_class/index.html b/sidekick/Sidekick_smt__Equiv_class/index.html
new file mode 100644
index 00000000..28e6b59b
--- /dev/null
+++ b/sidekick/Sidekick_smt__Equiv_class/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Equiv_class (sidekick.Sidekick_smt__Equiv_class)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Equiv_class</code></h1><h1 id="equivalence-classes"><a href="#equivalence-classes" class="anchor"></a>Equivalence Classes</h1><nav><ul><li><a href="#basics">basics</a></li><li><a href="#helpers">Helpers</a></li></ul></nav></header><aside><p>An equivalence class is a set of terms that are currently equal in the partial model built by the solver. The class is represented by a collection of nodes, one of which is distinguished and is called the &quot;representative&quot;.</p><p>All information pertaining to the whole equivalence class is stored in this representative's node.</p><p>When two classes become equal (are &quot;merged&quot;), one of the two representatives is picked as the representative of the new class. The new class contains the union of the two old classes' nodes.</p><p>We also allow theories to store additional information in the representative. This information can be used when two classes are merged, to detect conflicts and solve equations à la Shostak.</p></aside><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a></code><code></code></dt><dt id="type-payload"><a href="#type-payload" class="anchor"></a><code><span class="keyword">type </span>payload</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-cc_node_payload">Sidekick_smt.Solver_types.cc_node_payload</a></code><code><span class="keyword"> = </span></code><code><span class="keyword">..</span></code><code></code></dt></dl><dl><dt id="val-field_expanded"><a href="#val-field_expanded" class="anchor"></a><code><span class="keyword">val </span>field_expanded : <a href="../Sidekick_smt__Solver_types/index.html#module-Node_bits">Sidekick_smt.Solver_types.Node_bits</a>.field</code></dt><dd><p>Term is expanded?</p></dd></dl><dl><dt id="val-field_has_expansion_lit"><a href="#val-field_has_expansion_lit" class="anchor"></a><code><span class="keyword">val </span>field_has_expansion_lit : <a href="../Sidekick_smt__Solver_types/index.html#module-Node_bits">Sidekick_smt.Solver_types.Node_bits</a>.field</code></dt><dd><p>Upon expansion, does this term have a special literal <code>Lit_expanded t</code> that should be asserted?</p></dd></dl><dl><dt id="val-field_is_lit"><a href="#val-field_is_lit" class="anchor"></a><code><span class="keyword">val </span>field_is_lit : <a href="../Sidekick_smt__Solver_types/index.html#module-Node_bits">Sidekick_smt.Solver_types.Node_bits</a>.field</code></dt><dd><p>Is this term a boolean literal?</p></dd></dl><dl><dt id="val-field_is_split"><a href="#val-field_is_split" class="anchor"></a><code><span class="keyword">val </span>field_is_split : <a href="../Sidekick_smt__Solver_types/index.html#module-Node_bits">Sidekick_smt.Solver_types.Node_bits</a>.field</code></dt><dd><p>Did we perform case split (Split 1) on this term? This is only relevant for terms whose type is a datatype.</p></dd></dl><dl><dt id="val-field_add_level_0"><a href="#val-field_add_level_0" class="anchor"></a><code><span class="keyword">val </span>field_add_level_0 : <a href="../Sidekick_smt__Solver_types/index.html#module-Node_bits">Sidekick_smt.Solver_types.Node_bits</a>.field</code></dt><dd><p>Is the corresponding term to be re-added upon backtracking, down to level 0?</p></dd></dl><dl><dt id="val-field_is_active"><a href="#val-field_is_active" class="anchor"></a><code><span class="keyword">val </span>field_is_active : <a href="../Sidekick_smt__Solver_types/index.html#module-Node_bits">Sidekick_smt.Solver_types.Node_bits</a>.field</code></dt><dd><p>The term is needed for evaluation. We must try to evaluate it or to find a value for it using the theory</p></dd></dl><section><header><h2 id="basics"><a href="#basics" class="anchor"></a>basics</h2></header><dl><dt id="val-term"><a href="#val-term" class="anchor"></a><code><span class="keyword">val </span>term : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer</code></dt><dt id="val-payload"><a href="#val-payload" class="anchor"></a><code><span class="keyword">val </span>payload : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-payload">payload</a> list</code></dt></dl></section><section><header><h2 id="helpers"><a href="#helpers" class="anchor"></a>Helpers</h2></header><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Make a new equivalence class whose representative is the given term</p></dd></dl><dl><dt id="val-payload_find"><a href="#val-payload_find" class="anchor"></a><code><span class="keyword">val </span>payload_find : f:(<a href="index.html#type-payload">payload</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-payload_pred"><a href="#val-payload_pred" class="anchor"></a><code><span class="keyword">val </span>payload_pred : f:(<a href="index.html#type-payload">payload</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-set_payload"><a href="#val-set_payload" class="anchor"></a><code><span class="keyword">val </span>set_payload : ?&#8288;can_erase:(<a href="index.html#type-payload">payload</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-payload">payload</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add given payload</p><dl><dt>parameter can_erase</dt><dd><p>if provided, checks whether an existing value is to be replaced instead of adding a new entry</p></dd></dl></dd></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Explanation/.jbuilder-keep b/sidekick/Sidekick_smt__Explanation/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Explanation/Set/index.html b/sidekick/Sidekick_smt__Explanation/Set/index.html
new file mode 100644
index 00000000..b063b87a
--- /dev/null
+++ b/sidekick/Sidekick_smt__Explanation/Set/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Set (sidekick.Sidekick_smt__Explanation.Set)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Explanation.Set</code></h1></header><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code><span class="keyword"> = </span><a href="../../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a></code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-singleton"><a href="#val-singleton" class="anchor"></a><code><span class="keyword">val </span>singleton : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-union"><a href="#val-union" class="anchor"></a><code><span class="keyword">val </span>union : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-inter"><a href="#val-inter" class="anchor"></a><code><span class="keyword">val </span>inter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-diff"><a href="#val-diff" class="anchor"></a><code><span class="keyword">val </span>diff : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-subset"><a href="#val-subset" class="anchor"></a><code><span class="keyword">val </span>subset : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-map"><a href="#val-map" class="anchor"></a><code><span class="keyword">val </span>map : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a>) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-for_all"><a href="#val-for_all" class="anchor"></a><code><span class="keyword">val </span>for_all : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-exists"><a href="#val-exists" class="anchor"></a><code><span class="keyword">val </span>exists : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-partition"><a href="#val-partition" class="anchor"></a><code><span class="keyword">val </span>partition : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="index.html#type-t">t</a></code></dt><dt id="val-cardinal"><a href="#val-cardinal" class="anchor"></a><code><span class="keyword">val </span>cardinal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-elements"><a href="#val-elements" class="anchor"></a><code><span class="keyword">val </span>elements : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> list</code></dt><dt id="val-min_elt"><a href="#val-min_elt" class="anchor"></a><code><span class="keyword">val </span>min_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-max_elt"><a href="#val-max_elt" class="anchor"></a><code><span class="keyword">val </span>max_elt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-choose"><a href="#val-choose" class="anchor"></a><code><span class="keyword">val </span>choose : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-split"><a href="#val-split" class="anchor"></a><code><span class="keyword">val </span>split : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span>bool<span class="keyword"> * </span><a href="index.html#type-t">t</a></code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-min_elt_opt"><a href="#val-min_elt_opt" class="anchor"></a><code><span class="keyword">val </span>min_elt_opt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-max_elt_opt"><a href="#val-max_elt_opt" class="anchor"></a><code><span class="keyword">val </span>max_elt_opt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-choose_opt"><a href="#val-choose_opt" class="anchor"></a><code><span class="keyword">val </span>choose_opt : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-find_opt"><a href="#val-find_opt" class="anchor"></a><code><span class="keyword">val </span>find_opt : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-find_first"><a href="#val-find_first" class="anchor"></a><code><span class="keyword">val </span>find_first : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-find_first_opt"><a href="#val-find_first_opt" class="anchor"></a><code><span class="keyword">val </span>find_first_opt : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-find_last"><a href="#val-find_last" class="anchor"></a><code><span class="keyword">val </span>find_last : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dt id="val-find_last_opt"><a href="#val-find_last_opt" class="anchor"></a><code><span class="keyword">val </span>find_last_opt : (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> option</code></dt><dt id="val-of_seq"><a href="#val-of_seq" class="anchor"></a><code><span class="keyword">val </span>of_seq : <a href="index.html#type-elt">elt</a> CCSet.sequence <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add_seq"><a href="#val-add_seq" class="anchor"></a><code><span class="keyword">val </span>add_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> CCSet.sequence <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> CCSet.sequence</code></dt><dt id="val-of_list"><a href="#val-of_list" class="anchor"></a><code><span class="keyword">val </span>of_list : <a href="index.html#type-elt">elt</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add_list"><a href="#val-add_list" class="anchor"></a><code><span class="keyword">val </span>add_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list"><a href="#val-to_list" class="anchor"></a><code><span class="keyword">val </span>to_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : ?&#8288;start:string <span>&#8209;&gt;</span> ?&#8288;stop:string <span>&#8209;&gt;</span> ?&#8288;sep:string <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> CCSet.printer <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> CCSet.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Explanation/index.html b/sidekick/Sidekick_smt__Explanation/index.html
new file mode 100644
index 00000000..385d92e1
--- /dev/null
+++ b/sidekick/Sidekick_smt__Explanation/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Explanation (sidekick.Sidekick_smt__Explanation)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Explanation</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-t.E_reduction" class="anchored"><td class="def constructor"><a href="#type-t.E_reduction" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_reduction</span></code></td></tr><tr id="type-t.E_lit" class="anchored"><td class="def constructor"><a href="#type-t.E_lit" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_lit</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-lit">Sidekick_smt.Solver_types.lit</a></code></td></tr><tr id="type-t.E_congruence" class="anchored"><td class="def constructor"><a href="#type-t.E_congruence" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_congruence</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a><span class="keyword"> * </span><a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a></code></td></tr><tr id="type-t.E_injectivity" class="anchored"><td class="def constructor"><a href="#type-t.E_injectivity" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_injectivity</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a><span class="keyword"> * </span><a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a></code></td></tr><tr id="type-t.E_reduce_eq" class="anchored"><td class="def constructor"><a href="#type-t.E_reduce_eq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_reduce_eq</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a><span class="keyword"> * </span><a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a></code></td></tr><tr id="type-t.E_custom" class="anchored"><td class="def constructor"><a href="#type-t.E_custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-t.name" class="anchored"><td class="def field"><a href="#type-t.name" class="anchor"></a><code>name : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a>;</code></td></tr><tr id="type-t.args" class="anchored"><td class="def field"><a href="#type-t.args" class="anchor"></a><code>args : <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> list;</code></td></tr><tr id="type-t.pp" class="anchored"><td class="def field"><a href="#type-t.pp" class="anchor"></a><code>pp : (<a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> list) <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt></dl><dl><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> CCOrd.t</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.t <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-explanation">Sidekick_smt.Solver_types.explanation</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="../Sidekick_smt/Solver_types/index.html#type-lit">Sidekick_smt.Solver_types.lit</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl><article id="module-Set"><a href="#module-Set" class="anchor"></a><code><span class="keyword">module </span><a href="Set/index.html">Set</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Hash/.jbuilder-keep b/sidekick/Sidekick_smt__Hash/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Hash/index.html b/sidekick/Sidekick_smt__Hash/index.html
new file mode 100644
index 00000000..152f42a1
--- /dev/null
+++ b/sidekick/Sidekick_smt__Hash/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Hash (sidekick.Sidekick_smt__Hash)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Hash</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <span>&#8209;&gt;</span> int</code><code></code></dt></dl><dl><dt id="val-bool"><a href="#val-bool" class="anchor"></a><code><span class="keyword">val </span>bool : bool <a href="index.html#type-t">t</a></code></dt><dt id="val-int"><a href="#val-int" class="anchor"></a><code><span class="keyword">val </span>int : int <a href="index.html#type-t">t</a></code></dt><dt id="val-string"><a href="#val-string" class="anchor"></a><code><span class="keyword">val </span>string : string <a href="index.html#type-t">t</a></code></dt><dt id="val-combine"><a href="#val-combine" class="anchor"></a><code><span class="keyword">val </span>combine : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pair"><a href="#val-pair" class="anchor"></a><code><span class="keyword">val </span>pair : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'b</span>) <a href="index.html#type-t">t</a></code></dt><dt id="val-opt"><a href="#val-opt" class="anchor"></a><code><span class="keyword">val </span>opt : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option <a href="index.html#type-t">t</a></code></dt><dt id="val-list"><a href="#val-list" class="anchor"></a><code><span class="keyword">val </span>list : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list <a href="index.html#type-t">t</a></code></dt><dt id="val-array"><a href="#val-array" class="anchor"></a><code><span class="keyword">val </span>array : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> array <a href="index.html#type-t">t</a></code></dt><dt id="val-iarray"><a href="#val-iarray" class="anchor"></a><code><span class="keyword">val </span>iarray : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <a href="index.html#type-t">t</a></code></dt><dt id="val-seq"><a href="#val-seq" class="anchor"></a><code><span class="keyword">val </span>seq : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t <a href="index.html#type-t">t</a></code></dt><dt id="val-combine2"><a href="#val-combine2" class="anchor"></a><code><span class="keyword">val </span>combine2 : int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int</code></dt><dt id="val-combine3"><a href="#val-combine3" class="anchor"></a><code><span class="keyword">val </span>combine3 : int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int</code></dt><dt id="val-combine4"><a href="#val-combine4" class="anchor"></a><code><span class="keyword">val </span>combine4 : int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int</code></dt><dt id="val-poly"><a href="#val-poly" class="anchor"></a><code><span class="keyword">val </span>poly : <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>the regular polymorphic hash function</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Het_map/.jbuilder-keep b/sidekick/Sidekick_smt__Het_map/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Het_map/Key/index.html b/sidekick/Sidekick_smt__Het_map/Key/index.html
new file mode 100644
index 00000000..dfba6a70
--- /dev/null
+++ b/sidekick/Sidekick_smt__Het_map/Key/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Key (sidekick.Sidekick_smt__Het_map.Key)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Het_map.Key</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Compare two keys that have compatible types</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Het_map/Map/index.html b/sidekick/Sidekick_smt__Het_map/Map/index.html
new file mode 100644
index 00000000..4ee7366a
--- /dev/null
+++ b/sidekick/Sidekick_smt__Het_map/Map/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Map (sidekick.Sidekick_smt__Het_map.Map)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Het_map.Map</code></h1></header><div class="doc"><h2 id="immutable-map"><a href="#immutable-map" class="anchor"></a>Immutable map</h2></div><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <span class="type-var">_</span> <a href="../Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <span class="type-var">'a</span> <a href="../Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cardinal"><a href="#val-cardinal" class="anchor"></a><code><span class="keyword">val </span>cardinal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <span class="type-var">'a</span> <a href="../Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_exn"><a href="#val-find_exn" class="anchor"></a><code><span class="keyword">val </span>find_exn : <span class="type-var">'a</span> <a href="../Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><dl><dt>raises Not_found</dt><dd><p>if the key is not in the table</p></dd></dl></dd></dl><dl><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="../index.html#type-pair">pair</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-pair">pair</a> <a href="../index.html#type-sequence">sequence</a></code></dt><dt id="val-of_seq"><a href="#val-of_seq" class="anchor"></a><code><span class="keyword">val </span>of_seq : <a href="../index.html#type-pair">pair</a> <a href="../index.html#type-sequence">sequence</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add_seq"><a href="#val-add_seq" class="anchor"></a><code><span class="keyword">val </span>add_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-pair">pair</a> <a href="../index.html#type-sequence">sequence</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add_list"><a href="#val-add_list" class="anchor"></a><code><span class="keyword">val </span>add_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-pair">pair</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_list"><a href="#val-of_list" class="anchor"></a><code><span class="keyword">val </span>of_list : <a href="../index.html#type-pair">pair</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list"><a href="#val-to_list" class="anchor"></a><code><span class="keyword">val </span>to_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-pair">pair</a> list</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Het_map/Tbl/index.html b/sidekick/Sidekick_smt__Het_map/Tbl/index.html
new file mode 100644
index 00000000..dd4a7324
--- /dev/null
+++ b/sidekick/Sidekick_smt__Het_map/Tbl/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Tbl (sidekick.Sidekick_smt__Het_map.Tbl)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Het_map.Tbl</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:int <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-mem"><a href="#val-mem" class="anchor"></a><code><span class="keyword">val </span>mem : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">_</span> <a href="../Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-add"><a href="#val-add" class="anchor"></a><code><span class="keyword">val </span>add : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-find"><a href="#val-find" class="anchor"></a><code><span class="keyword">val </span>find : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code></dt><dt id="val-find_exn"><a href="#val-find_exn" class="anchor"></a><code><span class="keyword">val </span>find_exn : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Key/index.html#type-t">Key.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><dl><dt>raises Not_found</dt><dd><p>if the key is not in the table</p></dd></dl></dd></dl><dl><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<a href="../index.html#type-pair">pair</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-pair">pair</a> <a href="../index.html#type-sequence">sequence</a></code></dt><dt id="val-of_seq"><a href="#val-of_seq" class="anchor"></a><code><span class="keyword">val </span>of_seq : <a href="../index.html#type-pair">pair</a> <a href="../index.html#type-sequence">sequence</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-add_seq"><a href="#val-add_seq" class="anchor"></a><code><span class="keyword">val </span>add_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-pair">pair</a> <a href="../index.html#type-sequence">sequence</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-add_list"><a href="#val-add_list" class="anchor"></a><code><span class="keyword">val </span>add_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-pair">pair</a> list <span>&#8209;&gt;</span> unit</code></dt><dt id="val-of_list"><a href="#val-of_list" class="anchor"></a><code><span class="keyword">val </span>of_list : <a href="../index.html#type-pair">pair</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list"><a href="#val-to_list" class="anchor"></a><code><span class="keyword">val </span>to_list : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-pair">pair</a> list</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Het_map/index.html b/sidekick/Sidekick_smt__Het_map/index.html
new file mode 100644
index 00000000..2d99b0b9
--- /dev/null
+++ b/sidekick/Sidekick_smt__Het_map/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Het_map (sidekick.Sidekick_smt__Het_map)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Het_map</code></h1><h1 id="associative-containers-with-heterogenerous-values"><a href="#associative-containers-with-heterogenerous-values" class="anchor"></a>Associative containers with Heterogenerous Values</h1></header><dl><dt id="type-sequence"><a href="#type-sequence" class="anchor"></a><code><span class="keyword">type </span>'a sequence</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code><code></code></dt><dt id="type-gen"><a href="#type-gen" class="anchor"></a><code><span class="keyword">type </span>'a gen</code><code><span class="keyword"> = </span>unit <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code><code></code></dt></dl><article id="module-Key"><a href="#module-Key" class="anchor"></a><code><span class="keyword">module </span><a href="Key/index.html">Key</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-pair"><a href="#type-pair" class="anchor"></a><code><span class="keyword">type </span>pair</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-pair.Pair" class="anchored"><td class="def constructor"><a href="#type-pair.Pair" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Pair</span><span class="keyword"> : </span><span class="type-var">'a</span> <a href="Key/index.html#type-t">Key.t</a><span class="keyword"> * </span><span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-pair">pair</a></code></td></tr></table><code></code></dt></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span><a href="Tbl/index.html">Tbl</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Map"><a href="#module-Map" class="anchor"></a><code><span class="keyword">module </span><a href="Map/index.html">Map</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Lit/.jbuilder-keep b/sidekick/Sidekick_smt__Lit/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Lit/index.html b/sidekick/Sidekick_smt__Lit/index.html
new file mode 100644
index 00000000..6d77458a
--- /dev/null
+++ b/sidekick/Sidekick_smt__Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Lit (sidekick.Sidekick_smt__Lit)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Lit</code></h1><h2 id="literals"><a href="#literals" class="anchor"></a>Literals</h2></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-lit">Sidekick_smt.Solver_types.lit</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.lit_view" class="anchored"><td class="def field"><a href="#type-t.lit_view" class="anchor"></a><code>lit_view : <a href="../Sidekick_smt/Solver_types/index.html#type-lit_view">Sidekick_smt.Solver_types.lit_view</a>;</code></td></tr><tr id="type-t.lit_sign" class="anchored"><td class="def field"><a href="#type-t.lit_sign" class="anchor"></a><code>lit_sign : bool;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-view"><a href="#type-view" class="anchor"></a><code><span class="keyword">type </span>view</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-lit_view">Sidekick_smt.Solver_types.lit_view</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-view.Lit_fresh" class="anchored"><td class="def constructor"><a href="#type-view.Lit_fresh" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_fresh</span><span class="keyword"> of </span><a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></td></tr><tr id="type-view.Lit_atom" class="anchored"><td class="def constructor"><a href="#type-view.Lit_atom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_atom</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a></code></td></tr><tr id="type-view.Lit_expanded" class="anchored"><td class="def constructor"><a href="#type-view.Lit_expanded" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_expanded</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a></code></td></tr></table><code></code></dt></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-sign"><a href="#val-sign" class="anchor"></a><code><span class="keyword">val </span>sign : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-view"><a href="#val-view" class="anchor"></a><code><span class="keyword">val </span>view : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-lit_view">Sidekick_smt.Solver_types.lit_view</a></code></dt><dt id="val-as_atom"><a href="#val-as_atom" class="anchor"></a><code><span class="keyword">val </span>as_atom : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a><span class="keyword"> * </span>bool) option</code></dt><dt id="val-fresh_with"><a href="#val-fresh_with" class="anchor"></a><code><span class="keyword">val </span>fresh_with : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-fresh"><a href="#val-fresh" class="anchor"></a><code><span class="keyword">val </span>fresh : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dt id="val-atom"><a href="#val-atom" class="anchor"></a><code><span class="keyword">val </span>atom : ?&#8288;sign:bool <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_test"><a href="#val-cstor_test" class="anchor"></a><code><span class="keyword">val </span>cstor_test : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-expanded"><a href="#val-expanded" class="anchor"></a><code><span class="keyword">val </span>expanded : <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : <a href="index.html#type-t">t</a> <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer</code></dt><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../Sidekick_sat/index.html#type-negated">Sidekick_sat.negated</a></code></dt></dl><article id="module-Set"><a href="#module-Set" class="anchor"></a><code><span class="keyword">module </span>Set : CCSet.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Set">Set</a>.elt<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Model/.jbuilder-keep b/sidekick/Sidekick_smt__Model/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Model/index.html b/sidekick/Sidekick_smt__Model/index.html
new file mode 100644
index 00000000..41b4baec
--- /dev/null
+++ b/sidekick/Sidekick_smt__Model/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Model (sidekick.Sidekick_smt__Model)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Model</code></h1><h1 id="model"><a href="#model" class="anchor"></a>Model</h1></header><dl><dt id="type-term"><a href="#type-term" class="anchor"></a><code><span class="keyword">type </span>term</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Ast/index.html#type-term">Sidekick_smt.Ast.term</a></code><code></code></dt><dt id="type-ty"><a href="#type-ty" class="anchor"></a><code><span class="keyword">type </span>ty</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Ast/Ty/index.html#type-t">Sidekick_smt.Ast.Ty.t</a></code><code></code></dt><dt id="type-domain"><a href="#type-domain" class="anchor"></a><code><span class="keyword">type </span>domain</code><code><span class="keyword"> = </span><a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> list</code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span><span class="keyword">private </span></code><code>{</code><table class="record"><tr id="type-t.env" class="anchored"><td class="def field"><a href="#type-t.env" class="anchor"></a><code>env : <a href="../Sidekick_smt/Ast/index.html#type-env">Sidekick_smt.Ast.env</a>;</code></td></tr><tr id="type-t.domains" class="anchored"><td class="def field"><a href="#type-t.domains" class="anchor"></a><code>domains : <a href="index.html#type-domain">domain</a> <a href="../Sidekick_smt__Ast/Ty/index.html#module-Map">Sidekick_smt.Ast.Ty.Map</a>.t;</code></td></tr><tr id="type-t.consts" class="anchored"><td class="def field"><a href="#type-t.consts" class="anchor"></a><code>consts : <a href="index.html#type-term">term</a> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : env:<a href="../Sidekick_smt/Ast/index.html#type-env">Sidekick_smt.Ast.env</a> <span>&#8209;&gt;</span> consts:<a href="index.html#type-term">term</a> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t <span>&#8209;&gt;</span> domains:<a href="index.html#type-domain">domain</a> <a href="../Sidekick_smt__Ast/Ty/index.html#module-Map">Sidekick_smt.Ast.Ty.Map</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt><dt id="val-eval"><a href="#val-eval" class="anchor"></a><code><span class="keyword">val </span>eval : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt></dl><dl><dt id="exception-Bad_model"><a href="#exception-Bad_model" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Bad_model</span><span class="keyword"> of </span><a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver/.jbuilder-keep b/sidekick/Sidekick_smt__Solver/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Solver/Proof/index.html b/sidekick/Sidekick_smt__Solver/Proof/index.html
new file mode 100644
index 00000000..e2045151
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_smt__Solver.Proof)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver.Proof</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Sat_solver/Proof/index.html#type-proof">Sat_solver.Proof.proof</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver/Sat_solver/Clause/index.html b/sidekick/Sidekick_smt__Solver/Sat_solver/Clause/index.html
new file mode 100644
index 00000000..0edee685
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver/Sat_solver/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_smt__Solver.Sat_solver.Clause)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver.Sat_solver.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <a href="../../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-tag"><a href="#val-tag" class="anchor"></a><code><span class="keyword">val </span>tag : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int option</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> array <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Make a clause from this array of SAT literals. The array's ownership is transferred to the clause, do not mutate it</p></dd></dl><dl><dt id="val-make_l"><a href="#val-make_l" class="anchor"></a><code><span class="keyword">val </span>make_l : ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-lit">lit</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_atoms"><a href="#val-of_atoms" class="anchor"></a><code><span class="keyword">val </span>of_atoms : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver/Sat_solver/Formula/index.html b/sidekick/Sidekick_smt__Solver/Sat_solver/Formula/index.html
new file mode 100644
index 00000000..e15bb7b9
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver/Sat_solver/Formula/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Formula (sidekick.Sidekick_smt__Solver.Sat_solver.Formula)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver.Sat_solver.Formula</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../Sidekick_sat__/Solver_intf/index.html#type-printer">Sidekick_sat__.Solver_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver/Sat_solver/Lit/index.html b/sidekick/Sidekick_smt__Solver/Sat_solver/Lit/index.html
new file mode 100644
index 00000000..1d0f3a30
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver/Sat_solver/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_smt__Solver.Sat_solver.Lit)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver.Sat_solver.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-lit">lit</a></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="../index.html#type-solver">solver</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver/Sat_solver/Proof/Atom/index.html b/sidekick/Sidekick_smt__Solver/Sat_solver/Proof/Atom/index.html
new file mode 100644
index 00000000..190dd983
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver/Sat_solver/Proof/Atom/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Atom (sidekick.Sidekick_smt__Solver.Sat_solver.Proof.Atom)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver.Sat_solver.Proof.Atom</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-atom">atom</a></code><code></code></dt></dl><dl><dt id="val-is_pos"><a href="#val-is_pos" class="anchor"></a><code><span class="keyword">val </span>is_pos : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-lit"><a href="#val-lit" class="anchor"></a><code><span class="keyword">val </span>lit : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-formula">formula</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver/Sat_solver/Proof/Clause/index.html b/sidekick/Sidekick_smt__Solver/Sat_solver/Proof/Clause/index.html
new file mode 100644
index 00000000..979e0651
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver/Sat_solver/Proof/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_smt__Solver.Sat_solver.Proof.Clause)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver.Sat_solver.Proof.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt></dl><dl><dt id="val-name"><a href="#val-name" class="anchor"></a><code><span class="keyword">val </span>name : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-atoms"><a href="#val-atoms" class="anchor"></a><code><span class="keyword">val </span>atoms : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> array</code></dt><dt id="val-atoms_l"><a href="#val-atoms_l" class="anchor"></a><code><span class="keyword">val </span>atoms_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../index.html#type-atom">atom</a> list</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../../../../Sidekick_sat__/Res_intf/index.html#type-printer">Sidekick_sat__.Res_intf.printer</a></code></dt><dd><p>A nice looking printer for clauses, which sort the atoms before printing.</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver/Sat_solver/Proof/index.html b/sidekick/Sidekick_smt__Solver/Sat_solver/Proof/index.html
new file mode 100644
index 00000000..2110d689
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver/Sat_solver/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_smt__Solver.Sat_solver.Proof)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver.Sat_solver.Proof</code></h1></header><div class="doc"><p>A module to manipulate proofs.</p></div><aside><p>Signature for a module handling proof by resolution from sat solving traces</p></aside><section><header><h3 id="type-declarations"><a href="#type-declarations" class="anchor"></a>Type declarations</h3></header><dl><dt id="exception-Insufficient_hyps"><a href="#exception-Insufficient_hyps" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Insufficient_hyps</span></code></dt><dd><p>Raised when a complete resolution derivation cannot be found using the current hypotheses.</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code></code><code></code></dt><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code></code><code></code></dt><dt id="type-lemma"><a href="#type-lemma" class="anchor"></a><code><span class="keyword">type </span>lemma</code><code><span class="keyword"> = </span><a href="../../../Sidekick_smt/Theory_combine/index.html#type-proof">Sidekick_smt.Theory_combine.proof</a></code><code></code></dt><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code><span class="keyword"> = </span><a href="../index.html#type-clause">clause</a></code><code></code></dt><dd><p>Abstract types for atoms, clauses and theory-specific lemmas</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code></code><code></code></dt><dd><p>Lazy type for proof trees. Proofs are persistent objects, and can be extended to proof nodes using functions defined later.</p></dd></dl><dl><dt id="type-proof_node"><a href="#type-proof_node" class="anchor"></a><code><span class="keyword">type </span>proof_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-proof_node.conclusion" class="anchored"><td class="def field"><a href="#type-proof_node.conclusion" class="anchor"></a><code>conclusion : <a href="index.html#type-clause">clause</a>;</code></td><td class="doc"><p>The conclusion of the proof</p></td></tr><tr id="type-proof_node.step" class="anchored"><td class="def field"><a href="#type-proof_node.step" class="anchor"></a><code>step : <a href="index.html#type-step">step</a>;</code></td><td class="doc"><p>The reasoning step used to prove the conclusion</p></td></tr></table><code>}</code><code></code></dt><dd><p>A proof can be expanded into a proof node, which show the first step of the proof.</p></dd></dl><dl><dt id="type-step"><a href="#type-step" class="anchor"></a><code><span class="keyword">type </span>step</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-step.Hypothesis" class="anchored"><td class="def constructor"><a href="#type-step.Hypothesis" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Hypothesis</span></code></td><td class="doc"><p>The conclusion is a user-provided hypothesis</p></td></tr><tr id="type-step.Assumption" class="anchored"><td class="def constructor"><a href="#type-step.Assumption" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Assumption</span></code></td><td class="doc"><p>The conclusion has been locally assumed by the user</p></td></tr><tr id="type-step.Lemma" class="anchored"><td class="def constructor"><a href="#type-step.Lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lemma</span><span class="keyword"> of </span><a href="index.html#type-lemma">lemma</a></code></td><td class="doc"><p>The conclusion is a tautology provided by the theory, with associated proof</p></td></tr><tr id="type-step.Duplicate" class="anchored"><td class="def constructor"><a href="#type-step.Duplicate" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Duplicate</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a> list</code></td><td class="doc"><p>The conclusion is obtained by eliminating multiple occurences of the atom in the conclusion of the provided proof.</p></td></tr><tr id="type-step.Resolution" class="anchored"><td class="def constructor"><a href="#type-step.Resolution" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Resolution</span><span class="keyword"> of </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-proof">proof</a><span class="keyword"> * </span><a href="index.html#type-atom">atom</a></code></td><td class="doc"><p>The conclusion can be deduced by performing a resolution between the conclusions of the two given proofs. The atom on which to perform the resolution is also given.</p></td></tr></table><code></code></dt><dd><p>The type of reasoning steps allowed in a proof.</p></dd></dl></section><section><header><h3 id="proof-building-functions"><a href="#proof-building-functions" class="anchor"></a>Proof building functions</h3></header><dl><dt id="val-prove"><a href="#val-prove" class="anchor"></a><code><span class="keyword">val </span>prove : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a clause, return a proof of that clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_unsat"><a href="#val-prove_unsat" class="anchor"></a><code><span class="keyword">val </span>prove_unsat : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a></code></dt><dd><p>Given a conflict clause <code>c</code>, returns a proof of the empty clause.</p><dl><dt>raises Insuficient_hyps</dt><dd><p>if it does not succeed.</p></dd></dl></dd></dl><dl><dt id="val-prove_atom"><a href="#val-prove_atom" class="anchor"></a><code><span class="keyword">val </span>prove_atom : <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> option</code></dt><dd><p>Given an atom <code>a</code>, returns a proof of the clause <code>[a]</code> if <code>a</code> is true at level 0</p></dd></dl></section><section><header><h3 id="proof-nodes"><a href="#proof-nodes" class="anchor"></a>Proof Nodes</h3></header><dl><dt id="val-is_leaf"><a href="#val-is_leaf" class="anchor"></a><code><span class="keyword">val </span>is_leaf : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-expl"><a href="#val-expl" class="anchor"></a><code><span class="keyword">val </span>expl : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> string</code></dt><dd><p>Returns a short string description for the proof step; for instance <code>&quot;hypothesis&quot;</code> for a <code>Hypothesis</code> (it currently returns the variant name in lowercase).</p></dd></dl><dl><dt id="val-parents"><a href="#val-parents" class="anchor"></a><code><span class="keyword">val </span>parents : <a href="index.html#type-step">step</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> list</code></dt><dd><p>Returns the parents of a proof node.</p></dd></dl></section><section><header><h3 id="proof-manipulation"><a href="#proof-manipulation" class="anchor"></a>Proof Manipulation</h3></header><dl><dt id="val-expand"><a href="#val-expand" class="anchor"></a><code><span class="keyword">val </span>expand : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a></code></dt><dd><p>Return the proof step at the root of a given proof.</p></dd></dl><dl><dt id="val-conclusion"><a href="#val-conclusion" class="anchor"></a><code><span class="keyword">val </span>conclusion : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a></code></dt><dd><p>What is proved at the root of the clause</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof_node">proof_node</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p><code>fold f acc p</code>, fold <code>f</code> over the proof <code>p</code> and all its node. It is guaranteed that <code>f</code> is executed exactly once on each proof node in the tree, and that the execution of <code>f</code> on a proof node happens after the execution on the parents of the nodes.</p></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat_core of the given proof, i.e the lists of conclusions of all leafs of the proof. More efficient than using the <code>fold</code> function since it has access to the internal representation of proofs</p></dd></dl></section><section><header><h3 id="misc"><a href="#misc" class="anchor"></a>Misc</h3></header><dl><dt id="val-check"><a href="#val-check" class="anchor"></a><code><span class="keyword">val </span>check : <a href="index.html#type-proof">proof</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Check the contents of a proof. Mainly for internal use</p></dd></dl><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Atom"><a href="#module-Atom" class="anchor"></a><code><span class="keyword">module </span><a href="Atom/index.html">Atom</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : Hashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-proof">proof</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver/Sat_solver/index.html b/sidekick/Sidekick_smt__Solver/Sat_solver/index.html
new file mode 100644
index 00000000..2e02d622
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver/Sat_solver/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sat_solver (sidekick.Sidekick_smt__Solver.Sat_solver)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver.Sat_solver</code></h1></header><section><header><h2 id="internal-modules"><a href="#internal-modules" class="anchor"></a>Internal modules</h2><p>These are the internal modules used, you should probably not use them if you're not familiar with the internals of mSAT.</p></header><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a></code><code></code></dt><dd><p>user formulas</p></dd></dl><dl><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code></code></dt><dd><p>SAT solver literals</p></dd></dl><dl><dt id="type-clause"><a href="#type-clause" class="anchor"></a><code><span class="keyword">type </span>clause</code><code></code><code></code></dt><dd><p>SAT solver clauses</p></dd></dl><dl><dt id="type-theory"><a href="#type-theory" class="anchor"></a><code><span class="keyword">type </span>theory</code><code><span class="keyword"> = </span><a href="../../Sidekick_smt/Theory_combine/index.html#type-t">Sidekick_smt.Theory_combine.t</a></code><code></code></dt><dd><p>user theory</p></dd></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <a href="../../Sidekick_sat/Res/index.html#module-type-S">Sidekick_sat.Res.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../../Sidekick_sat/Res/module-type-S/index.html#type-clause">clause</a><span class="keyword"> = </span><a href="index.html#type-clause">clause</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../../Sidekick_sat/Res/module-type-S/index.html#type-lemma">lemma</a><span class="keyword"> = </span><a href="../../Sidekick_smt/Theory_combine/index.html#type-proof">Sidekick_smt.Theory_combine.proof</a></code></article><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Main solver type, containing all state for solving.</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Tiny | `Small | `Big ] <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create new solver</p><dl><dt>parameter size</dt><dd><p>the initial size of internal data structures. The bigger, the faster, but also the more RAM it uses.</p></dd></dl></dd></dl></section><section><header><h2 id="types"><a href="#types" class="anchor"></a>Types</h2></header><dl><dt id="type-atom"><a href="#type-atom" class="anchor"></a><code><span class="keyword">type </span>atom</code><code><span class="keyword"> = </span><a href="index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atoms given by the module argument for formulas. An atom is a user-defined atomic formula whose truth value is picked by Msat.</p></dd></dl><dl><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="index.html#type-formula">formula</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-sat_state">Sidekick_sat__.Solver_intf.sat_state</a></code></td><td class="doc"><p>Returned when the solver reaches SAT, with a model</p></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span>(<a href="index.html#type-clause">clause</a>, <a href="Proof/index.html#type-proof">Proof.proof</a>) <a href="../../Sidekick_sat__/Solver_intf/index.html#type-unsat_state">Sidekick_sat__.Solver_intf.unsat_state</a></code></td><td class="doc"><p>Returned when the solver reaches UNSAT, with a proof</p></td></tr></table><code></code></dt><dd><p>Result type for the solver</p></dd></dl><dl><dt id="exception-UndecidedLit"><a href="#exception-UndecidedLit" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">UndecidedLit</span></code></dt><dd><p>Exception raised by the evaluating functions when a literal has not yet been assigned a value.</p></dd></dl></section><section><header><h2 id="base-operations"><a href="#base-operations" class="anchor"></a>Base operations</h2></header><dl><dt id="val-theory"><a href="#val-theory" class="anchor"></a><code><span class="keyword">val </span>theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-theory">theory</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : ?&#8288;permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;tag:int <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> list list <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add the list of clauses to the current set of assumptions. Modifies the sat solver state in place.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking (default true)</p></dd></dl></dd></dl><dl><dt id="val-add_clause"><a href="#val-add_clause" class="anchor"></a><code><span class="keyword">val </span>add_clause : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Lower level addition of clauses. See <a href="Clause/index.html"><code>Clause</code></a> to create clauses.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> ?&#8288;assumptions:<a href="index.html#type-atom">atom</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dd><p>Try and solves the current set of clauses.</p><dl><dt>parameter assumptions</dt><dd><p>additional atomic assumptions to be temporarily added. The assumptions are just used for this call to <code>solve</code>, they are not saved in the solver's state.</p></dd></dl></dd></dl><dl><dt id="val-new_atom"><a href="#val-new_atom" class="anchor"></a><code><span class="keyword">val </span>new_atom : permanent:bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Add a new atom (i.e propositional formula) to the solver. This formula will be decided on at some point during solving, whether it appears in clauses or not.</p><dl><dt>parameter permanent</dt><dd><p>if true, kept after backtracking</p></dd></dl></dd></dl><dl><dt id="val-unsat_core"><a href="#val-unsat_core" class="anchor"></a><code><span class="keyword">val </span>unsat_core : <a href="Proof/index.html#type-proof">Proof.proof</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> list</code></dt><dd><p>Returns the unsat core of a given proof, ie a subset of all the added clauses that is sufficient to establish unsatisfiability.</p></dd></dl><dl><dt id="val-true_at_level0"><a href="#val-true_at_level0" class="anchor"></a><code><span class="keyword">val </span>true_at_level0 : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-atom">atom</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p><code>true_at_level0 a</code> returns <code>true</code> if <code>a</code> was proved at level0, i.e. it must hold in all models</p></dd></dl><dl><dt id="val-get_tag"><a href="#val-get_tag" class="anchor"></a><code><span class="keyword">val </span>get_tag : <a href="index.html#type-clause">clause</a> <span>&#8209;&gt;</span> int option</code></dt><dd><p>Recover tag from a clause, if any</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Push a new save point. Clauses added after this call to <code>push</code> will be added as normal, but the corresponding call to <code>pop</code> will remove these clauses.</p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Return to last save point, discarding clauses added since last call to <code>push</code></p></dd></dl><dl><dt id="val-actions"><a href="#val-actions" class="anchor"></a><code><span class="keyword">val </span>actions : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="Proof/index.html#type-lemma">Proof.lemma</a>) <a href="../../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a></code></dt><dd><p>Obtain actions</p></dd></dl><dl><dt id="val-export"><a href="#val-export" class="anchor"></a><code><span class="keyword">val </span>export : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-clause">clause</a> <a href="../../Sidekick_sat__/Solver_intf/index.html#type-export">Sidekick_sat__.Solver_intf.export</a></code></dt></dl></section><section><header><h2 id="re-export-some-functions"><a href="#re-export-some-functions" class="anchor"></a>Re-export some functions</h2></header><dl><dt id="type-solver"><a href="#type-solver" class="anchor"></a><code><span class="keyword">type </span>solver</code><code><span class="keyword"> = </span><a href="index.html#type-t">t</a></code><code></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Formula"><a href="#module-Formula" class="anchor"></a><code><span class="keyword">module </span><a href="Formula/index.html">Formula</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver/index.html b/sidekick/Sidekick_smt__Solver/index.html
new file mode 100644
index 00000000..6a3c825e
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Solver (sidekick.Sidekick_smt__Solver)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver</code></h1><h1 id="solver"><a href="#solver" class="anchor"></a>Solver</h1><p>The solving algorithm, based on MCSat</p><nav><ul><li><a href="#result">Result</a></li><li><a href="#main">Main</a></li></ul></nav></header><article id="module-Sat_solver"><a href="#module-Sat_solver" class="anchor"></a><code><span class="keyword">module </span><a href="Sat_solver/index.html">Sat_solver</a> : <a href="../Sidekick_sat/index.html#module-type-S">Sidekick_sat.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_sat/module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../Sidekick_sat/module-type-S/index.html#type-theory">theory</a><span class="keyword"> = </span><a href="../Sidekick_smt/Theory_combine/index.html#type-t">Sidekick_smt.Theory_combine.t</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../Sidekick_sat/module-type-S/Proof/index.html#type-lemma">Proof.lemma</a><span class="keyword"> = </span><a href="../Sidekick_smt/Theory_combine/index.html#type-proof">Sidekick_smt.Theory_combine.proof</a></code></article><section><header><h2 id="result"><a href="#result" class="anchor"></a>Result</h2></header><dl><dt id="type-model"><a href="#type-model" class="anchor"></a><code><span class="keyword">type </span>model</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Model/index.html#type-t">Sidekick_smt.Model.t</a></code><code></code></dt></dl><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-unknown"><a href="#type-unknown" class="anchor"></a><code><span class="keyword">type </span>unknown</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-unknown.U_timeout" class="anchored"><td class="def constructor"><a href="#type-unknown.U_timeout" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">U_timeout</span></code></td></tr><tr id="type-unknown.U_max_depth" class="anchored"><td class="def constructor"><a href="#type-unknown.U_max_depth" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">U_max_depth</span></code></td></tr><tr id="type-unknown.U_incomplete" class="anchored"><td class="def constructor"><a href="#type-unknown.U_incomplete" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">U_incomplete</span></code></td></tr></table><code></code></dt><dt id="type-res"><a href="#type-res" class="anchor"></a><code><span class="keyword">type </span>res</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-res.Sat" class="anchored"><td class="def constructor"><a href="#type-res.Sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Sat</span><span class="keyword"> of </span><a href="../Sidekick_smt/Model/index.html#type-t">Sidekick_smt.Model.t</a></code></td></tr><tr id="type-res.Unsat" class="anchored"><td class="def constructor"><a href="#type-res.Unsat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unsat</span><span class="keyword"> of </span><a href="Proof/index.html#type-t">Proof.t</a></code></td></tr><tr id="type-res.Unknown" class="anchored"><td class="def constructor"><a href="#type-res.Unknown" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unknown</span><span class="keyword"> of </span><a href="index.html#type-unknown">unknown</a></code></td></tr></table><code></code></dt></dl></section><section><header><h2 id="main"><a href="#main" class="anchor"></a>Main</h2></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Solver state</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:[ `Big | `Tiny | `Small ] <span>&#8209;&gt;</span> ?&#8288;config:<a href="../Sidekick_smt/Config/index.html#type-t">Sidekick_smt.Config.t</a> <span>&#8209;&gt;</span> theories:<a href="../Sidekick_smt/Theory/index.html#type-t">Sidekick_smt.Theory.t</a> list <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-solver"><a href="#val-solver" class="anchor"></a><code><span class="keyword">val </span>solver : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="Sat_solver/index.html#type-t">Sat_solver.t</a></code></dt><dt id="val-th_combine"><a href="#val-th_combine" class="anchor"></a><code><span class="keyword">val </span>th_combine : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Theory_combine/index.html#type-t">Sidekick_smt.Theory_combine.t</a></code></dt><dt id="val-add_theory"><a href="#val-add_theory" class="anchor"></a><code><span class="keyword">val </span>add_theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Theory/index.html#type-t">Sidekick_smt.Theory.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-cc"><a href="#val-cc" class="anchor"></a><code><span class="keyword">val </span>cc : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Congruence_closure/index.html#type-t">Sidekick_smt.Congruence_closure.t</a></code></dt><dt id="val-stats"><a href="#val-stats" class="anchor"></a><code><span class="keyword">val </span>stats : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Stat/index.html#type-t">Sidekick_smt.Stat.t</a></code></dt><dt id="val-tst"><a href="#val-tst" class="anchor"></a><code><span class="keyword">val </span>tst : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a></code></dt><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-assume_eq"><a href="#val-assume_eq" class="anchor"></a><code><span class="keyword">val </span>assume_eq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-assume_distinct"><a href="#val-assume_distinct" class="anchor"></a><code><span class="keyword">val </span>assume_distinct : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a> list <span>&#8209;&gt;</span> neq:<a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-solve"><a href="#val-solve" class="anchor"></a><code><span class="keyword">val </span>solve : ?&#8288;on_exit:(unit <span>&#8209;&gt;</span> unit) list <span>&#8209;&gt;</span> ?&#8288;check:bool <span>&#8209;&gt;</span> assumptions:<a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-res">res</a></code></dt><dd><p><code>solve s</code> checks the satisfiability of the statement added so far to <code>s</code></p><dl><dt>parameter check</dt><dd><p>if true, the model is checked before returning</p></dd></dl><dl><dt>parameter on_exit</dt><dd><p>functions to be run before this returns</p></dd></dl></dd></dl><dl><dt id="val-pp_term_graph"><a href="#val-pp_term_graph" class="anchor"></a><code><span class="keyword">val </span>pp_term_graph : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt><dt id="val-pp_stats"><a href="#val-pp_stats" class="anchor"></a><code><span class="keyword">val </span>pp_stats : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt><dt id="val-pp_unknown"><a href="#val-pp_unknown" class="anchor"></a><code><span class="keyword">val </span>pp_unknown : <a href="index.html#type-unknown">unknown</a> CCFormat.printer</code></dt></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Solver_types/.jbuilder-keep b/sidekick/Sidekick_smt__Solver_types/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Solver_types/index.html b/sidekick/Sidekick_smt__Solver_types/index.html
new file mode 100644
index 00000000..ecf4f8e0
--- /dev/null
+++ b/sidekick/Sidekick_smt__Solver_types/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Solver_types (sidekick.Sidekick_smt__Solver_types)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Solver_types</code></h1></header><article id="module-Fmt"><a href="#module-Fmt" class="anchor"></a><code><span class="keyword">module </span>Fmt = CCFormat</code></article><article id="module-Node_bits"><a href="#module-Node_bits" class="anchor"></a><code><span class="keyword">module </span>Node_bits : CCBitField.S</code></article><dl><dt id="type-lazily_expanded"><a href="#type-lazily_expanded" class="anchor"></a><code><span class="keyword">type </span>'a lazily_expanded</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-lazily_expanded.Lazy_some" class="anchored"><td class="def constructor"><a href="#type-lazily_expanded.Lazy_some" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lazy_some</span><span class="keyword"> of </span><span class="type-var">'a</span></code></td></tr><tr id="type-lazily_expanded.Lazy_none" class="anchored"><td class="def constructor"><a href="#type-lazily_expanded.Lazy_none" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lazy_none</span></code></td></tr></table><code></code></dt><dt id="type-term"><a href="#type-term" class="anchor"></a><code><span class="keyword">type </span>term</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-term.term_id" class="anchored"><td class="def field"><a href="#type-term.term_id" class="anchor"></a><code><span class="keyword">mutable </span>term_id : int;</code></td></tr><tr id="type-term.term_ty" class="anchored"><td class="def field"><a href="#type-term.term_ty" class="anchor"></a><code><span class="keyword">mutable </span>term_ty : <a href="index.html#type-ty">ty</a>;</code></td></tr><tr id="type-term.term_cell" class="anchored"><td class="def field"><a href="#type-term.term_cell" class="anchor"></a><code>term_cell : <a href="index.html#type-term">term</a> <a href="index.html#type-term_cell">term_cell</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-term_cell"><a href="#type-term_cell" class="anchor"></a><code><span class="keyword">type </span>'a term_cell</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-term_cell.Bool" class="anchored"><td class="def constructor"><a href="#type-term_cell.Bool" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bool</span><span class="keyword"> of </span>bool</code></td></tr><tr id="type-term_cell.App_cst" class="anchored"><td class="def constructor"><a href="#type-term_cell.App_cst" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">App_cst</span><span class="keyword"> of </span><a href="index.html#type-cst">cst</a><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></td></tr><tr id="type-term_cell.If" class="anchored"><td class="def constructor"><a href="#type-term_cell.If" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">If</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span></code></td></tr><tr id="type-term_cell.Case" class="anchored"><td class="def constructor"><a href="#type-term_cell.Case" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Case</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t</code></td></tr><tr id="type-term_cell.Custom" class="anchored"><td class="def constructor"><a href="#type-term_cell.Custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-term_cell.view" class="anchored"><td class="def field"><a href="#type-term_cell.view" class="anchor"></a><code>view : <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a>;</code></td></tr><tr id="type-term_cell.tc" class="anchored"><td class="def field"><a href="#type-term_cell.tc" class="anchor"></a><code>tc : <a href="index.html#type-term_view_tc">term_view_tc</a>;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-term_view_tc"><a href="#type-term_view_tc" class="anchor"></a><code><span class="keyword">type </span>term_view_tc</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-term_view_tc.tc_t_pp" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_pp" class="anchor"></a><code>tc_t_pp : a. <span class="type-var">'a</span> <a href="index.html#module-Fmt">Fmt</a>.printer <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <a href="index.html#module-Fmt">Fmt</a>.printer;</code></td></tr><tr id="type-term_view_tc.tc_t_equal" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_equal" class="anchor"></a><code>tc_t_equal : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> CCEqual.t;</code></td></tr><tr id="type-term_view_tc.tc_t_hash" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_hash" class="anchor"></a><code>tc_t_hash : a. <span class="type-var">'a</span> <a href="../Sidekick_smt/Hash/index.html#type-t">Sidekick_smt.Hash.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <a href="../Sidekick_smt/Hash/index.html#type-t">Sidekick_smt.Hash.t</a>;</code></td></tr><tr id="type-term_view_tc.tc_t_ty" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_ty" class="anchor"></a><code>tc_t_ty : a. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a>;</code></td></tr><tr id="type-term_view_tc.tc_t_is_semantic" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_is_semantic" class="anchor"></a><code>tc_t_is_semantic : a. <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> bool;</code></td></tr><tr id="type-term_view_tc.tc_t_solve" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_solve" class="anchor"></a><code>tc_t_solve : <a href="index.html#type-cc_node">cc_node</a> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-cc_node">cc_node</a> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-solve_result">solve_result</a>;</code></td></tr><tr id="type-term_view_tc.tc_t_sub" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_sub" class="anchor"></a><code>tc_t_sub : a. <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-term_view_tc.tc_t_abs" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_abs" class="anchor"></a><code>tc_t_abs : self:<a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a><span class="keyword"> * </span>bool;</code></td></tr><tr id="type-term_view_tc.tc_t_relevant" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_relevant" class="anchor"></a><code>tc_t_relevant : a. <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-term_view_tc.tc_t_subst" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_subst" class="anchor"></a><code>tc_t_subst : a b. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-term_view_custom">term_view_custom</a> option;</code></td></tr><tr id="type-term_view_tc.tc_t_explain" class="anchored"><td class="def field"><a href="#type-term_view_tc.tc_t_explain" class="anchor"></a><code>tc_t_explain : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-term_view_custom">term_view_custom</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span>) list;</code></td></tr></table><code>}</code><code></code></dt><dd><p>Methods on the custom term view whose leaves are <code>'a</code>. Terms must be comparable, hashable, printable, and provide some additional theory handles.</p><ul><li><code>tc_t_sub</code> must return all immediate subterms (all <code>'a</code> contained in the term)</li></ul><ul><li><code>tc_t_subst</code> must use the function to replace all subterms (all the <code>'a</code> returned by <code>tc_t_sub</code>) by <code>'b</code></li></ul><ul><li><code>tc_t_relevant</code> must return a subset of <code>tc_t_sub</code> (possibly the same set). The terms it returns will be activated and evaluated whenever possible. Terms in <code>tc_t_sub t \ tc_t_relevant t</code> are considered for congruence but not for evaluation.</li></ul><ul><li>If <code>t1</code> and <code>t2</code> satisfy <code>tc_t_is_semantic</code> and have the same type, then <code>tc_t_solve t1 t2</code> must succeed by returning some <code>solve_result</code>.</li></ul><ul><li>if <code>tc_t_equal eq a b = true</code>, then <code>tc_t_explain eq a b</code> must return all the pairs of equal subterms that are sufficient for <code>a</code> and <code>b</code> to be equal.</li></ul></dd></dl><dl><dt id="type-term_view_custom"><a href="#type-term_view_custom" class="anchor"></a><code><span class="keyword">type </span>'a term_view_custom</code><code></code><code><span class="keyword"> = </span></code><code><span class="keyword">..</span></code><code></code></dt><dd><p>Custom term view for theories</p></dd></dl><dl><dt id="type-solve_result"><a href="#type-solve_result" class="anchor"></a><code><span class="keyword">type </span>solve_result</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-solve_result.Solve_ok" class="anchored"><td class="def constructor"><a href="#type-solve_result.Solve_ok" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Solve_ok</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-solve_result.subst" class="anchored"><td class="def field"><a href="#type-solve_result.subst" class="anchor"></a><code>subst : (<a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-term">term</a>) list;</code></td><td class="doc"><p>binding leaves to other terms</p></td></tr></table><code>}</code><code></code></td><td class="doc"><p>Success, the two terms being equal is equivalent to the given substitution</p></td></tr><tr id="type-solve_result.Solve_fail" class="anchored"><td class="def constructor"><a href="#type-solve_result.Solve_fail" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Solve_fail</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-solve_result.expl" class="anchored"><td class="def field"><a href="#type-solve_result.expl" class="anchor"></a><code>expl : <a href="index.html#type-explanation">explanation</a>;</code></td></tr></table><code>}</code><code></code></td><td class="doc"><p>Failure, because of the given explanation. The two terms cannot be equal</p></td></tr></table><code></code></dt><dd><p>The result of a call to <code>solve</code>.</p></dd></dl><dl><dt id="type-cc_node"><a href="#type-cc_node" class="anchor"></a><code><span class="keyword">type </span>cc_node</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-cc_node.n_term" class="anchored"><td class="def field"><a href="#type-cc_node.n_term" class="anchor"></a><code>n_term : <a href="index.html#type-term">term</a>;</code></td></tr><tr id="type-cc_node.n_bits" class="anchored"><td class="def field"><a href="#type-cc_node.n_bits" class="anchor"></a><code><span class="keyword">mutable </span>n_bits : <a href="index.html#module-Node_bits">Node_bits</a>.t;</code></td></tr><tr id="type-cc_node.n_parents" class="anchored"><td class="def field"><a href="#type-cc_node.n_parents" class="anchor"></a><code><span class="keyword">mutable </span>n_parents : <a href="index.html#type-cc_node">cc_node</a> <a href="../Sidekick_smt/Bag/index.html#type-t">Sidekick_smt.Bag.t</a>;</code></td></tr><tr id="type-cc_node.n_root" class="anchored"><td class="def field"><a href="#type-cc_node.n_root" class="anchor"></a><code><span class="keyword">mutable </span>n_root : <a href="index.html#type-cc_node">cc_node</a>;</code></td></tr><tr id="type-cc_node.n_expl" class="anchored"><td class="def field"><a href="#type-cc_node.n_expl" class="anchor"></a><code><span class="keyword">mutable </span>n_expl : <a href="index.html#type-explanation_forest_link">explanation_forest_link</a>;</code></td></tr><tr id="type-cc_node.n_payload" class="anchored"><td class="def field"><a href="#type-cc_node.n_payload" class="anchor"></a><code><span class="keyword">mutable </span>n_payload : <a href="index.html#type-cc_node_payload">cc_node_payload</a> list;</code></td></tr><tr id="type-cc_node.n_tags" class="anchored"><td class="def field"><a href="#type-cc_node.n_tags" class="anchor"></a><code><span class="keyword">mutable </span>n_tags : (<a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-explanation">explanation</a>) <a href="../Sidekick_util__Util/index.html#module-Int_map">Sidekick_util.Util.Int_map</a>.t;</code></td></tr></table><code>}</code><code></code></dt><dd><p>A node of the congruence closure. An equivalence class is represented by its &quot;root&quot; element, the representative.</p><p>If there is a normal form in the congruence class, then the representative is a normal form</p></dd></dl><dl><dt id="type-cc_node_payload"><a href="#type-cc_node_payload" class="anchor"></a><code><span class="keyword">type </span>cc_node_payload</code><code></code><code><span class="keyword"> = </span></code><code><span class="keyword">..</span></code><code></code></dt><dd><p>Theory-extensible payloads</p></dd></dl><dl><dt id="type-explanation_forest_link"><a href="#type-explanation_forest_link" class="anchor"></a><code><span class="keyword">type </span>explanation_forest_link</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-explanation_forest_link.E_none" class="anchored"><td class="def constructor"><a href="#type-explanation_forest_link.E_none" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_none</span></code></td></tr><tr id="type-explanation_forest_link.E_some" class="anchored"><td class="def constructor"><a href="#type-explanation_forest_link.E_some" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_some</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-explanation_forest_link.next" class="anchored"><td class="def field"><a href="#type-explanation_forest_link.next" class="anchor"></a><code>next : <a href="index.html#type-cc_node">cc_node</a>;</code></td></tr><tr id="type-explanation_forest_link.expl" class="anchored"><td class="def field"><a href="#type-explanation_forest_link.expl" class="anchor"></a><code>expl : <a href="index.html#type-explanation">explanation</a>;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-explanation"><a href="#type-explanation" class="anchor"></a><code><span class="keyword">type </span>explanation</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-explanation.E_reduction" class="anchored"><td class="def constructor"><a href="#type-explanation.E_reduction" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_reduction</span></code></td></tr><tr id="type-explanation.E_lit" class="anchored"><td class="def constructor"><a href="#type-explanation.E_lit" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_lit</span><span class="keyword"> of </span><a href="index.html#type-lit">lit</a></code></td></tr><tr id="type-explanation.E_congruence" class="anchored"><td class="def constructor"><a href="#type-explanation.E_congruence" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_congruence</span><span class="keyword"> of </span><a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-cc_node">cc_node</a></code></td></tr><tr id="type-explanation.E_injectivity" class="anchored"><td class="def constructor"><a href="#type-explanation.E_injectivity" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_injectivity</span><span class="keyword"> of </span><a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-cc_node">cc_node</a></code></td></tr><tr id="type-explanation.E_reduce_eq" class="anchored"><td class="def constructor"><a href="#type-explanation.E_reduce_eq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_reduce_eq</span><span class="keyword"> of </span><a href="index.html#type-cc_node">cc_node</a><span class="keyword"> * </span><a href="index.html#type-cc_node">cc_node</a></code></td></tr><tr id="type-explanation.E_custom" class="anchored"><td class="def constructor"><a href="#type-explanation.E_custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">E_custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-explanation.name" class="anchored"><td class="def field"><a href="#type-explanation.name" class="anchor"></a><code>name : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a>;</code></td></tr><tr id="type-explanation.args" class="anchored"><td class="def field"><a href="#type-explanation.args" class="anchor"></a><code>args : <a href="index.html#type-explanation">explanation</a> list;</code></td></tr><tr id="type-explanation.pp" class="anchored"><td class="def field"><a href="#type-explanation.pp" class="anchor"></a><code>pp : (<a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="index.html#type-explanation">explanation</a> list) <a href="index.html#module-Fmt">Fmt</a>.printer;</code></td></tr></table><code>}</code><code></code></td><td class="doc"><p>Custom explanation, typically for theories</p></td></tr></table><code></code></dt><dt id="type-lit"><a href="#type-lit" class="anchor"></a><code><span class="keyword">type </span>lit</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-lit.lit_view" class="anchored"><td class="def field"><a href="#type-lit.lit_view" class="anchor"></a><code>lit_view : <a href="index.html#type-lit_view">lit_view</a>;</code></td></tr><tr id="type-lit.lit_sign" class="anchored"><td class="def field"><a href="#type-lit.lit_sign" class="anchor"></a><code>lit_sign : bool;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-lit_view"><a href="#type-lit_view" class="anchor"></a><code><span class="keyword">type </span>lit_view</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-lit_view.Lit_fresh" class="anchored"><td class="def constructor"><a href="#type-lit_view.Lit_fresh" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_fresh</span><span class="keyword"> of </span><a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></td></tr><tr id="type-lit_view.Lit_atom" class="anchored"><td class="def constructor"><a href="#type-lit_view.Lit_atom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_atom</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-lit_view.Lit_expanded" class="anchored"><td class="def constructor"><a href="#type-lit_view.Lit_expanded" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lit_expanded</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr></table><code></code></dt><dt id="type-cst"><a href="#type-cst" class="anchor"></a><code><span class="keyword">type </span>cst</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-cst.cst_id" class="anchored"><td class="def field"><a href="#type-cst.cst_id" class="anchor"></a><code>cst_id : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a>;</code></td></tr><tr id="type-cst.cst_kind" class="anchored"><td class="def field"><a href="#type-cst.cst_kind" class="anchor"></a><code>cst_kind : <a href="index.html#type-cst_kind">cst_kind</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-cst_kind"><a href="#type-cst_kind" class="anchor"></a><code><span class="keyword">type </span>cst_kind</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-cst_kind.Cst_undef" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_undef" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_undef</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a></code></td></tr><tr id="type-cst_kind.Cst_cstor" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_cstor" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_cstor</span><span class="keyword"> of </span><a href="index.html#type-data_cstor">data_cstor</a> lazy_t</code></td></tr><tr id="type-cst_kind.Cst_proj" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_proj" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_proj</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a><span class="keyword"> * </span><a href="index.html#type-data_cstor">data_cstor</a> lazy_t<span class="keyword"> * </span>int</code></td></tr><tr id="type-cst_kind.Cst_test" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_test" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_test</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a><span class="keyword"> * </span><a href="index.html#type-data_cstor">data_cstor</a> lazy_t</code></td></tr><tr id="type-cst_kind.Cst_defined" class="anchored"><td class="def constructor"><a href="#type-cst_kind.Cst_defined" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_defined</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a><span class="keyword"> * </span><a href="index.html#type-term">term</a> lazy_t<span class="keyword"> * </span><a href="index.html#type-cst_defined_info">cst_defined_info</a></code></td></tr></table><code></code></dt><dt id="type-cst_defined_info"><a href="#type-cst_defined_info" class="anchor"></a><code><span class="keyword">type </span>cst_defined_info</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-cst_defined_info.Cst_recursive" class="anchored"><td class="def constructor"><a href="#type-cst_defined_info.Cst_recursive" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_recursive</span></code></td></tr><tr id="type-cst_defined_info.Cst_non_recursive" class="anchored"><td class="def constructor"><a href="#type-cst_defined_info.Cst_non_recursive" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cst_non_recursive</span></code></td></tr></table><code></code></dt><dt id="type-cst_exist_conds"><a href="#type-cst_exist_conds" class="anchor"></a><code><span class="keyword">type </span>cst_exist_conds</code><code><span class="keyword"> = </span><a href="index.html#type-lit">lit</a> lazy_t list Pervasives.ref</code><code></code></dt><dt id="type-db_env"><a href="#type-db_env" class="anchor"></a><code><span class="keyword">type </span>'a db_env</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-db_env.db_st" class="anchored"><td class="def field"><a href="#type-db_env.db_st" class="anchor"></a><code>db_st : <span class="type-var">'a</span> option list;</code></td></tr><tr id="type-db_env.db_size" class="anchored"><td class="def field"><a href="#type-db_env.db_size" class="anchor"></a><code>db_size : int;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-ty"><a href="#type-ty" class="anchor"></a><code><span class="keyword">type </span>ty</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-ty.ty_id" class="anchored"><td class="def field"><a href="#type-ty.ty_id" class="anchor"></a><code><span class="keyword">mutable </span>ty_id : int;</code></td></tr><tr id="type-ty.ty_cell" class="anchored"><td class="def field"><a href="#type-ty.ty_cell" class="anchor"></a><code>ty_cell : <a href="index.html#type-ty_cell">ty_cell</a>;</code></td></tr><tr id="type-ty.ty_card" class="anchored"><td class="def field"><a href="#type-ty.ty_card" class="anchor"></a><code>ty_card : <a href="index.html#type-ty_card">ty_card</a> lazy_t;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-ty_card"><a href="#type-ty_card" class="anchor"></a><code><span class="keyword">type </span>ty_card</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-ty_card.Finite" class="anchored"><td class="def constructor"><a href="#type-ty_card.Finite" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Finite</span></code></td></tr><tr id="type-ty_card.Infinite" class="anchored"><td class="def constructor"><a href="#type-ty_card.Infinite" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Infinite</span></code></td></tr></table><code></code></dt><dt id="type-ty_def"><a href="#type-ty_def" class="anchor"></a><code><span class="keyword">type </span>ty_def</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-ty_def.Uninterpreted" class="anchored"><td class="def constructor"><a href="#type-ty_def.Uninterpreted" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Uninterpreted</span></code></td></tr><tr id="type-ty_def.Data" class="anchored"><td class="def constructor"><a href="#type-ty_def.Data" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Data</span><span class="keyword"> of </span><a href="index.html#type-datatype">datatype</a></code></td></tr></table><code></code></dt><dt id="type-datatype"><a href="#type-datatype" class="anchor"></a><code><span class="keyword">type </span>datatype</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-datatype.data_cstors" class="anchored"><td class="def field"><a href="#type-datatype.data_cstors" class="anchor"></a><code>data_cstors : <a href="index.html#type-data_cstor">data_cstor</a> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t lazy_t;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-data_cstor"><a href="#type-data_cstor" class="anchor"></a><code><span class="keyword">type </span>data_cstor</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-data_cstor.cstor_ty" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_ty" class="anchor"></a><code>cstor_ty : <a href="index.html#type-ty">ty</a>;</code></td></tr><tr id="type-data_cstor.cstor_args" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_args" class="anchor"></a><code>cstor_args : <a href="index.html#type-ty">ty</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a>;</code></td></tr><tr id="type-data_cstor.cstor_proj" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_proj" class="anchor"></a><code>cstor_proj : <a href="index.html#type-cst">cst</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> lazy_t;</code></td></tr><tr id="type-data_cstor.cstor_test" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_test" class="anchor"></a><code>cstor_test : <a href="index.html#type-cst">cst</a> lazy_t;</code></td></tr><tr id="type-data_cstor.cstor_cst" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_cst" class="anchor"></a><code>cstor_cst : <a href="index.html#type-cst">cst</a>;</code></td></tr><tr id="type-data_cstor.cstor_card" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_card" class="anchor"></a><code>cstor_card : <a href="index.html#type-ty_card">ty_card</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-ty_cell"><a href="#type-ty_cell" class="anchor"></a><code><span class="keyword">type </span>ty_cell</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-ty_cell.Prop" class="anchored"><td class="def constructor"><a href="#type-ty_cell.Prop" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Prop</span></code></td></tr><tr id="type-ty_cell.Atomic" class="anchored"><td class="def constructor"><a href="#type-ty_cell.Atomic" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Atomic</span><span class="keyword"> of </span><a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="index.html#type-ty_def">ty_def</a></code></td></tr><tr id="type-ty_cell.Arrow" class="anchored"><td class="def constructor"><a href="#type-ty_cell.Arrow" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Arrow</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a><span class="keyword"> * </span><a href="index.html#type-ty">ty</a></code></td></tr></table><code></code></dt></dl><dl><dt id="val-term_equal_"><a href="#val-term_equal_" class="anchor"></a><code><span class="keyword">val </span>term_equal_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-term_hash_"><a href="#val-term_hash_" class="anchor"></a><code><span class="keyword">val </span>term_hash_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-term_cmp_"><a href="#val-term_cmp_" class="anchor"></a><code><span class="keyword">val </span>term_cmp_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cmp_lit"><a href="#val-cmp_lit" class="anchor"></a><code><span class="keyword">val </span>cmp_lit : <a href="index.html#type-lit">lit</a> <span>&#8209;&gt;</span> <a href="index.html#type-lit">lit</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cst_compare"><a href="#val-cst_compare" class="anchor"></a><code><span class="keyword">val </span>cst_compare : <a href="index.html#type-cst">cst</a> <span>&#8209;&gt;</span> <a href="index.html#type-cst">cst</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-hash_lit"><a href="#val-hash_lit" class="anchor"></a><code><span class="keyword">val </span>hash_lit : <a href="index.html#type-lit">lit</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cmp_cc_node"><a href="#val-cmp_cc_node" class="anchor"></a><code><span class="keyword">val </span>cmp_cc_node : <a href="index.html#type-cc_node">cc_node</a> <span>&#8209;&gt;</span> <a href="index.html#type-cc_node">cc_node</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cmp_exp"><a href="#val-cmp_exp" class="anchor"></a><code><span class="keyword">val </span>cmp_exp : <a href="index.html#type-explanation">explanation</a> CCOrd.t</code></dt><dt id="val-pp_cst"><a href="#val-pp_cst" class="anchor"></a><code><span class="keyword">val </span>pp_cst : CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-cst">cst</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-id_of_cst"><a href="#val-id_of_cst" class="anchor"></a><code><span class="keyword">val </span>id_of_cst : <a href="index.html#type-cst">cst</a> <span>&#8209;&gt;</span> <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a></code></dt><dt id="val-pp_db"><a href="#val-pp_db" class="anchor"></a><code><span class="keyword">val </span>pp_db : Format.formatter <span>&#8209;&gt;</span> (int<span class="keyword"> * </span><span class="type-var">'a</span>) <span>&#8209;&gt;</span> unit</code></dt><dt id="val-ty_unfold"><a href="#val-ty_unfold" class="anchor"></a><code><span class="keyword">val </span>ty_unfold : <a href="index.html#type-ty">ty</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a> list<span class="keyword"> * </span><a href="index.html#type-ty">ty</a></code></dt><dt id="val-pp_ty"><a href="#val-pp_ty" class="anchor"></a><code><span class="keyword">val </span>pp_ty : <a href="index.html#type-ty">ty</a> <a href="../Sidekick_util/Util/index.html#type-printer">Sidekick_util.Util.printer</a></code></dt><dt id="val-pp_term_top"><a href="#val-pp_term_top" class="anchor"></a><code><span class="keyword">val </span>pp_term_top : ids:bool <span>&#8209;&gt;</span> CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_term"><a href="#val-pp_term" class="anchor"></a><code><span class="keyword">val </span>pp_term : CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_lit"><a href="#val-pp_lit" class="anchor"></a><code><span class="keyword">val </span>pp_lit : CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-lit">lit</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_cc_node"><a href="#val-pp_cc_node" class="anchor"></a><code><span class="keyword">val </span>pp_cc_node : CCFormat.t <span>&#8209;&gt;</span> <a href="index.html#type-cc_node">cc_node</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_explanation"><a href="#val-pp_explanation" class="anchor"></a><code><span class="keyword">val </span>pp_explanation : <a href="index.html#module-Fmt">Fmt</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-explanation">explanation</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Stat/.jbuilder-keep b/sidekick/Sidekick_smt__Stat/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Stat/index.html b/sidekick/Sidekick_smt__Stat/index.html
new file mode 100644
index 00000000..2eb7a220
--- /dev/null
+++ b/sidekick/Sidekick_smt__Stat/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Stat (sidekick.Sidekick_smt__Stat)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Stat</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.num_cst_expanded" class="anchored"><td class="def field"><a href="#type-t.num_cst_expanded" class="anchor"></a><code><span class="keyword">mutable </span>num_cst_expanded : int;</code></td></tr><tr id="type-t.num_uty_expanded" class="anchored"><td class="def field"><a href="#type-t.num_uty_expanded" class="anchor"></a><code><span class="keyword">mutable </span>num_uty_expanded : int;</code></td></tr><tr id="type-t.num_clause_push" class="anchored"><td class="def field"><a href="#type-t.num_clause_push" class="anchor"></a><code><span class="keyword">mutable </span>num_clause_push : int;</code></td></tr><tr id="type-t.num_clause_tautology" class="anchored"><td class="def field"><a href="#type-t.num_clause_tautology" class="anchor"></a><code><span class="keyword">mutable </span>num_clause_tautology : int;</code></td></tr><tr id="type-t.num_propagations" class="anchored"><td class="def field"><a href="#type-t.num_propagations" class="anchor"></a><code><span class="keyword">mutable </span>num_propagations : int;</code></td></tr><tr id="type-t.num_unif" class="anchored"><td class="def field"><a href="#type-t.num_unif" class="anchor"></a><code><span class="keyword">mutable </span>num_unif : int;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Term/.jbuilder-keep b/sidekick/Sidekick_smt__Term/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Term/index.html b/sidekick/Sidekick_smt__Term/index.html
new file mode 100644
index 00000000..76a036a1
--- /dev/null
+++ b/sidekick/Sidekick_smt__Term/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Term (sidekick.Sidekick_smt__Term)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Term</code></h1><nav><ul><li><a href="#views">Views</a></li><li><a href="#containers">Containers</a></li></ul></nav></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.term_id" class="anchored"><td class="def field"><a href="#type-t.term_id" class="anchor"></a><code><span class="keyword">mutable </span>term_id : int;</code></td></tr><tr id="type-t.term_ty" class="anchored"><td class="def field"><a href="#type-t.term_ty" class="anchor"></a><code><span class="keyword">mutable </span>term_ty : <a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a>;</code></td></tr><tr id="type-t.term_cell" class="anchored"><td class="def field"><a href="#type-t.term_cell" class="anchor"></a><code>term_cell : <a href="index.html#type-t">t</a> <a href="../Sidekick_smt/Solver_types/index.html#type-term_cell">Sidekick_smt.Solver_types.term_cell</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-cell"><a href="#type-cell" class="anchor"></a><code><span class="keyword">type </span>'a cell</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_cell">Sidekick_smt.Solver_types.term_cell</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-cell.Bool" class="anchored"><td class="def constructor"><a href="#type-cell.Bool" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bool</span><span class="keyword"> of </span>bool</code></td></tr><tr id="type-cell.App_cst" class="anchored"><td class="def constructor"><a href="#type-cell.App_cst" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">App_cst</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></td></tr><tr id="type-cell.If" class="anchored"><td class="def constructor"><a href="#type-cell.If" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">If</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span></code></td></tr><tr id="type-cell.Case" class="anchored"><td class="def constructor"><a href="#type-cell.Case" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Case</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t</code></td></tr><tr id="type-cell.Custom" class="anchored"><td class="def constructor"><a href="#type-cell.Custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-cell.view" class="anchored"><td class="def field"><a href="#type-cell.view" class="anchor"></a><code>view : <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a>;</code></td></tr><tr id="type-cell.tc" class="anchored"><td class="def field"><a href="#type-cell.tc" class="anchor"></a><code>tc : <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_tc">Sidekick_smt.Solver_types.term_view_tc</a>;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-custom"><a href="#type-custom" class="anchor"></a><code><span class="keyword">type </span>'a custom</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a></code><code><span class="keyword"> = </span></code><code><span class="keyword">..</span></code><code></code></dt><dt id="type-tc"><a href="#type-tc" class="anchor"></a><code><span class="keyword">type </span>tc</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-term_view_tc">Sidekick_smt.Solver_types.term_view_tc</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-tc.tc_t_pp" class="anchored"><td class="def field"><a href="#type-tc.tc_t_pp" class="anchor"></a><code>tc_t_pp : a. <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer;</code></td></tr><tr id="type-tc.tc_t_equal" class="anchored"><td class="def field"><a href="#type-tc.tc_t_equal" class="anchor"></a><code>tc_t_equal : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> CCEqual.t;</code></td></tr><tr id="type-tc.tc_t_hash" class="anchored"><td class="def field"><a href="#type-tc.tc_t_hash" class="anchor"></a><code>tc_t_hash : a. <span class="type-var">'a</span> <a href="../Sidekick_smt/Hash/index.html#type-t">Sidekick_smt.Hash.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <a href="../Sidekick_smt/Hash/index.html#type-t">Sidekick_smt.Hash.t</a>;</code></td></tr><tr id="type-tc.tc_t_ty" class="anchored"><td class="def field"><a href="#type-tc.tc_t_ty" class="anchor"></a><code>tc_t_ty : a. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a>;</code></td></tr><tr id="type-tc.tc_t_is_semantic" class="anchored"><td class="def field"><a href="#type-tc.tc_t_is_semantic" class="anchor"></a><code>tc_t_is_semantic : a. <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> bool;</code></td></tr><tr id="type-tc.tc_t_solve" class="anchored"><td class="def field"><a href="#type-tc.tc_t_solve" class="anchor"></a><code>tc_t_solve : <a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-solve_result">Sidekick_smt.Solver_types.solve_result</a>;</code></td></tr><tr id="type-tc.tc_t_sub" class="anchored"><td class="def field"><a href="#type-tc.tc_t_sub" class="anchor"></a><code>tc_t_sub : a. <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-tc.tc_t_abs" class="anchored"><td class="def field"><a href="#type-tc.tc_t_abs" class="anchor"></a><code>tc_t_abs : self:<a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a><span class="keyword"> * </span>bool;</code></td></tr><tr id="type-tc.tc_t_relevant" class="anchored"><td class="def field"><a href="#type-tc.tc_t_relevant" class="anchor"></a><code>tc_t_relevant : a. <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-tc.tc_t_subst" class="anchored"><td class="def field"><a href="#type-tc.tc_t_subst" class="anchor"></a><code>tc_t_subst : a b. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-custom">custom</a> option;</code></td></tr><tr id="type-tc.tc_t_explain" class="anchored"><td class="def field"><a href="#type-tc.tc_t_explain" class="anchor"></a><code>tc_t_explain : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span>) list;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-cell"><a href="#val-cell" class="anchor"></a><code><span class="keyword">val </span>cell : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <a href="../Sidekick_smt/Solver_types/index.html#type-term_cell">Sidekick_smt.Solver_types.term_cell</a></code></dt><dt id="val-ty"><a href="#val-ty" class="anchor"></a><code><span class="keyword">val </span>ty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : ?&#8288;size:int <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <a href="../Sidekick_smt/Solver_types/index.html#type-term_cell">Sidekick_smt.Solver_types.term_cell</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-true_"><a href="#val-true_" class="anchor"></a><code><span class="keyword">val </span>true_ : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-false_"><a href="#val-false_" class="anchor"></a><code><span class="keyword">val </span>false_ : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-const"><a href="#val-const" class="anchor"></a><code><span class="keyword">val </span>const : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-app_cst"><a href="#val-app_cst" class="anchor"></a><code><span class="keyword">val </span>app_cst : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-if_"><a href="#val-if_" class="anchor"></a><code><span class="keyword">val </span>if_ : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-case"><a href="#val-case" class="anchor"></a><code><span class="keyword">val </span>case : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-and_eager"><a href="#val-and_eager" class="anchor"></a><code><span class="keyword">val </span>and_eager : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-custom"><a href="#val-custom" class="anchor"></a><code><span class="keyword">val </span>custom : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> tc:<a href="index.html#type-tc">tc</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_test"><a href="#val-cstor_test" class="anchor"></a><code><span class="keyword">val </span>cstor_test : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_proj"><a href="#val-cstor_proj" class="anchor"></a><code><span class="keyword">val </span>cstor_proj : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-abs"><a href="#val-abs" class="anchor"></a><code><span class="keyword">val </span>abs : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span>bool</code></dt><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> Sequence.t</code></dt><dt id="val-all_terms"><a href="#val-all_terms" class="anchor"></a><code><span class="keyword">val </span>all_terms : <a href="index.html#type-state">state</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> Sequence.t</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer</code></dt></dl><section><header><h4 id="views"><a href="#views" class="anchor"></a>Views</h4></header><dl><dt id="val-is_true"><a href="#val-is_true" class="anchor"></a><code><span class="keyword">val </span>is_true : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_false"><a href="#val-is_false" class="anchor"></a><code><span class="keyword">val </span>is_false : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_const"><a href="#val-is_const" class="anchor"></a><code><span class="keyword">val </span>is_const : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_custom"><a href="#val-is_custom" class="anchor"></a><code><span class="keyword">val </span>is_custom : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_semantic"><a href="#val-is_semantic" class="anchor"></a><code><span class="keyword">val </span>is_semantic : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Custom term that is Shostak-ready (ie can be solved)</p></dd></dl><dl><dt id="val-as_cst_undef"><a href="#val-as_cst_undef" class="anchor"></a><code><span class="keyword">val </span>as_cst_undef : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a><span class="keyword"> * </span><a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a>) option</code></dt><dt id="val-as_cstor_app"><a href="#val-as_cstor_app" class="anchor"></a><code><span class="keyword">val </span>as_cstor_app : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a><span class="keyword"> * </span><a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a><span class="keyword"> * </span><a href="index.html#type-t">t</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a>) option</code></dt></dl><dl><dt id="type-unif_form"><a href="#type-unif_form" class="anchor"></a><code><span class="keyword">type </span>unif_form</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-unif_form.Unif_cst" class="anchored"><td class="def constructor"><a href="#type-unif_form.Unif_cst" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unif_cst</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a><span class="keyword"> * </span><a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a></code></td></tr><tr id="type-unif_form.Unif_cstor" class="anchored"><td class="def constructor"><a href="#type-unif_form.Unif_cstor" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unif_cstor</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a><span class="keyword"> * </span><a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a><span class="keyword"> * </span><a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></td></tr><tr id="type-unif_form.Unif_none" class="anchored"><td class="def constructor"><a href="#type-unif_form.Unif_none" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Unif_none</span></code></td></tr></table><code></code></dt></dl><dl><dt id="val-as_unif"><a href="#val-as_unif" class="anchor"></a><code><span class="keyword">val </span>as_unif : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-unif_form">unif_form</a></code></dt></dl></section><section><header><h4 id="containers"><a href="#containers" class="anchor"></a>Containers</h4></header><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-Map"><a href="#module-Map" class="anchor"></a><code><span class="keyword">module </span>Map : CCMap.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Map">Map</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Term_cell/.jbuilder-keep b/sidekick/Sidekick_smt__Term_cell/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Term_cell/Make_eq/argument-1-X/index.html b/sidekick/Sidekick_smt__Term_cell/Make_eq/argument-1-X/index.html
new file mode 100644
index 00000000..37230330
--- /dev/null
+++ b/sidekick/Sidekick_smt__Term_cell/Make_eq/argument-1-X/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-X (sidekick.Sidekick_smt__Term_cell.Make_eq.1-X)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_smt__Term_cell.Make_eq.1-X</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Term_cell/Make_eq/index.html b/sidekick/Sidekick_smt__Term_cell/Make_eq/index.html
new file mode 100644
index 00000000..2bf7a31b
--- /dev/null
+++ b/sidekick/Sidekick_smt__Term_cell/Make_eq/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make_eq (sidekick.Sidekick_smt__Term_cell.Make_eq)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Term_cell.Make_eq</code></h1></header><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-X/index.html">X</a> : <a href="../index.html#module-type-ARG">ARG</a></code></dl><h3 class="heading">Signature</h3><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="argument-1-X/index.html#type-t">X.t</a> <a href="../../Sidekick_smt/Solver_types/index.html#type-term_cell">Sidekick_smt.Solver_types.term_cell</a> <span>&#8209;&gt;</span> <a href="argument-1-X/index.html#type-t">X.t</a> <a href="../../Sidekick_smt/Solver_types/index.html#type-term_cell">Sidekick_smt.Solver_types.term_cell</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="argument-1-X/index.html#type-t">X.t</a> <a href="../../Sidekick_smt/Solver_types/index.html#type-term_cell">Sidekick_smt.Solver_types.term_cell</a> <span>&#8209;&gt;</span> int</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Term_cell/index.html b/sidekick/Sidekick_smt__Term_cell/index.html
new file mode 100644
index 00000000..a29fe31b
--- /dev/null
+++ b/sidekick/Sidekick_smt__Term_cell/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Term_cell (sidekick.Sidekick_smt__Term_cell)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Term_cell</code></h1></header><dl><dt id="type-cell"><a href="#type-cell" class="anchor"></a><code><span class="keyword">type </span>'a cell</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_cell">Sidekick_smt.Solver_types.term_cell</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-cell.Bool" class="anchored"><td class="def constructor"><a href="#type-cell.Bool" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Bool</span><span class="keyword"> of </span>bool</code></td></tr><tr id="type-cell.App_cst" class="anchored"><td class="def constructor"><a href="#type-cell.App_cst" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">App_cst</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code></td></tr><tr id="type-cell.If" class="anchored"><td class="def constructor"><a href="#type-cell.If" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">If</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span></code></td></tr><tr id="type-cell.Case" class="anchored"><td class="def constructor"><a href="#type-cell.Case" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Case</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t</code></td></tr><tr id="type-cell.Custom" class="anchored"><td class="def constructor"><a href="#type-cell.Custom" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Custom</span><span class="keyword"> of </span></code><code>{</code><table class="record"><tr id="type-cell.view" class="anchored"><td class="def field"><a href="#type-cell.view" class="anchor"></a><code>view : <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a>;</code></td></tr><tr id="type-cell.tc" class="anchored"><td class="def field"><a href="#type-cell.tc" class="anchor"></a><code>tc : <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_tc">Sidekick_smt.Solver_types.term_view_tc</a>;</code></td></tr></table><code>}</code><code></code></td></tr></table><code></code></dt><dt id="type-custom"><a href="#type-custom" class="anchor"></a><code><span class="keyword">type </span>'a custom</code><code><span class="keyword"> = </span><span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a></code><code><span class="keyword"> = </span></code><code><span class="keyword">..</span></code><code></code></dt><dt id="type-tc"><a href="#type-tc" class="anchor"></a><code><span class="keyword">type </span>tc</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-term_view_tc">Sidekick_smt.Solver_types.term_view_tc</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-tc.tc_t_pp" class="anchored"><td class="def field"><a href="#type-tc.tc_t_pp" class="anchor"></a><code>tc_t_pp : a. <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <a href="../Sidekick_smt/Solver_types/index.html#module-Fmt">Sidekick_smt.Solver_types.Fmt</a>.printer;</code></td></tr><tr id="type-tc.tc_t_equal" class="anchored"><td class="def field"><a href="#type-tc.tc_t_equal" class="anchor"></a><code>tc_t_equal : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> CCEqual.t;</code></td></tr><tr id="type-tc.tc_t_hash" class="anchored"><td class="def field"><a href="#type-tc.tc_t_hash" class="anchor"></a><code>tc_t_hash : a. <span class="type-var">'a</span> <a href="../Sidekick_smt/Hash/index.html#type-t">Sidekick_smt.Hash.t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <a href="../Sidekick_smt/Hash/index.html#type-t">Sidekick_smt.Hash.t</a>;</code></td></tr><tr id="type-tc.tc_t_ty" class="anchored"><td class="def field"><a href="#type-tc.tc_t_ty" class="anchor"></a><code>tc_t_ty : a. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a>;</code></td></tr><tr id="type-tc.tc_t_is_semantic" class="anchored"><td class="def field"><a href="#type-tc.tc_t_is_semantic" class="anchor"></a><code>tc_t_is_semantic : a. <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> bool;</code></td></tr><tr id="type-tc.tc_t_solve" class="anchored"><td class="def field"><a href="#type-tc.tc_t_solve" class="anchor"></a><code>tc_t_solve : <a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-cc_node">Sidekick_smt.Solver_types.cc_node</a> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-solve_result">Sidekick_smt.Solver_types.solve_result</a>;</code></td></tr><tr id="type-tc.tc_t_sub" class="anchored"><td class="def field"><a href="#type-tc.tc_t_sub" class="anchor"></a><code>tc_t_sub : a. <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-tc.tc_t_abs" class="anchored"><td class="def field"><a href="#type-tc.tc_t_abs" class="anchor"></a><code>tc_t_abs : self:<a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <a href="index.html#type-custom">custom</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a><span class="keyword"> * </span>bool;</code></td></tr><tr id="type-tc.tc_t_relevant" class="anchored"><td class="def field"><a href="#type-tc.tc_t_relevant" class="anchor"></a><code>tc_t_relevant : a. <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t;</code></td></tr><tr id="type-tc.tc_t_subst" class="anchored"><td class="def field"><a href="#type-tc.tc_t_subst" class="anchor"></a><code>tc_t_subst : a b. (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> option;</code></td></tr><tr id="type-tc.tc_t_explain" class="anchored"><td class="def field"><a href="#type-tc.tc_t_explain" class="anchor"></a><code>tc_t_explain : a. <span class="type-var">'a</span> CCEqual.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span>) list;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <a href="../Sidekick_smt/Solver_types/index.html#type-term_cell">Sidekick_smt.Solver_types.term_cell</a></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-true_"><a href="#val-true_" class="anchor"></a><code><span class="keyword">val </span>true_ : <a href="index.html#type-t">t</a></code></dt><dt id="val-false_"><a href="#val-false_" class="anchor"></a><code><span class="keyword">val </span>false_ : <a href="index.html#type-t">t</a></code></dt><dt id="val-const"><a href="#val-const" class="anchor"></a><code><span class="keyword">val </span>const : <a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-app_cst"><a href="#val-app_cst" class="anchor"></a><code><span class="keyword">val </span>app_cst : <a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_test"><a href="#val-cstor_test" class="anchor"></a><code><span class="keyword">val </span>cstor_test : <a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-cstor_proj"><a href="#val-cstor_proj" class="anchor"></a><code><span class="keyword">val </span>cstor_proj : <a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-case"><a href="#val-case" class="anchor"></a><code><span class="keyword">val </span>case : <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-if_"><a href="#val-if_" class="anchor"></a><code><span class="keyword">val </span>if_ : <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-custom"><a href="#val-custom" class="anchor"></a><code><span class="keyword">val </span>custom : tc:<a href="../Sidekick_smt/Solver_types/index.html#type-term_view_tc">Sidekick_smt.Solver_types.term_view_tc</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver_types/index.html#type-term">Sidekick_smt.Solver_types.term</a> <a href="../Sidekick_smt/Solver_types/index.html#type-term_view_custom">Sidekick_smt.Solver_types.term_view_custom</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-ty"><a href="#val-ty" class="anchor"></a><code><span class="keyword">val </span>ty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a></code></dt><dd><p>Compute the type of this term cell. Not totally free</p></dd></dl><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-type-ARG"><a href="#module-type-ARG" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-ARG/index.html">ARG</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Make_eq"><a href="#module-Make_eq" class="anchor"></a><code><span class="keyword">module </span><a href="Make_eq/index.html">Make_eq</a> : <span class="keyword">functor</span> (<a href="Make_eq/argument-1-X/index.html">X</a> : <a href="index.html#module-type-ARG">ARG</a>) -&gt; <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Term_cell/module-type-ARG/index.html b/sidekick/Sidekick_smt__Term_cell/module-type-ARG/index.html
new file mode 100644
index 00000000..9ffe48b8
--- /dev/null
+++ b/sidekick/Sidekick_smt__Term_cell/module-type-ARG/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>ARG (sidekick.Sidekick_smt__Term_cell.ARG)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_smt__Term_cell.ARG</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Theory/.jbuilder-keep b/sidekick/Sidekick_smt__Theory/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Theory/Clause/index.html b/sidekick/Sidekick_smt__Theory/Clause/index.html
new file mode 100644
index 00000000..cb621f2b
--- /dev/null
+++ b/sidekick/Sidekick_smt__Theory/Clause/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Clause (sidekick.Sidekick_smt__Theory.Clause)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Theory.Clause</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <a href="../../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Theory/index.html b/sidekick/Sidekick_smt__Theory/index.html
new file mode 100644
index 00000000..ee4c1ac2
--- /dev/null
+++ b/sidekick/Sidekick_smt__Theory/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Theory (sidekick.Sidekick_smt__Theory)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Theory</code></h1></header><article id="module-Clause"><a href="#module-Clause" class="anchor"></a><code><span class="keyword">module </span><a href="Clause/index.html">Clause</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-state"><a href="#type-state" class="anchor"></a><code><span class="keyword">type </span>state</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-state.State" class="anchored"><td class="def constructor"><a href="#type-state.State" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">State</span><span class="keyword"> : </span></code><code>{</code><table class="record"><tr id="type-state.st" class="anchored"><td class="def field"><a href="#type-state.st" class="anchor"></a><code><span class="keyword">mutable </span>st : <span class="type-var">'a</span>;</code></td></tr><tr id="type-state.on_merge" class="anchored"><td class="def field"><a href="#type-state.on_merge" class="anchor"></a><code>on_merge : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Equiv_class/index.html#type-t">Sidekick_smt.Equiv_class.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Equiv_class/index.html#type-t">Sidekick_smt.Equiv_class.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Explanation/index.html#type-t">Sidekick_smt.Explanation.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Called when two classes are merged</p></td></tr><tr id="type-state.on_assert" class="anchored"><td class="def field"><a href="#type-state.on_assert" class="anchor"></a><code>on_assert : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Called when a literal becomes true</p></td></tr><tr id="type-state.final_check" class="anchored"><td class="def field"><a href="#type-state.final_check" class="anchor"></a><code>final_check : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> Sequence.t <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Final check, must be complete (i.e. must raise a conflict if the set of literals is not satisfiable)</p></td></tr></table><code>}</code><code> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></td></tr></table><code></code></dt><dd><p>Runtime state of a theory, with all the operations it provides. <code>'a</code> is the internal state</p></dd></dl><dl><dt id="type-conflict"><a href="#type-conflict" class="anchor"></a><code><span class="keyword">type </span>conflict</code><code><span class="keyword"> = </span><a href="../Sidekick_smt__Lit/index.html#module-Set">Sidekick_smt.Lit.Set</a>.t</code><code></code></dt><dd><p>Unsatisfiable conjunction. Its negation will become a conflict clause</p></dd></dl><dl><dt id="type-actions"><a href="#type-actions" class="anchor"></a><code><span class="keyword">type </span>actions</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-actions.on_backtrack" class="anchored"><td class="def field"><a href="#type-actions.on_backtrack" class="anchor"></a><code>on_backtrack : (unit <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Register an action to do when we backtrack</p></td></tr><tr id="type-actions.raise_conflict" class="anchored"><td class="def field"><a href="#type-actions.raise_conflict" class="anchor"></a><code>raise_conflict : a. <a href="index.html#type-conflict">conflict</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span>;</code></td><td class="doc"><p>Give a conflict clause to the solver</p></td></tr><tr id="type-actions.propagate_eq" class="anchored"><td class="def field"><a href="#type-actions.propagate_eq" class="anchor"></a><code>propagate_eq : <a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Explanation/index.html#type-t">Sidekick_smt.Explanation.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Propagate an equality <code>t = u</code> because <code>e</code></p></td></tr><tr id="type-actions.propagate_distinct" class="anchored"><td class="def field"><a href="#type-actions.propagate_distinct" class="anchor"></a><code>propagate_distinct : <a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a> list <span>&#8209;&gt;</span> neq:<a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Explanation/index.html#type-t">Sidekick_smt.Explanation.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Propagate a <code>distinct l</code> because <code>e</code> (where <code>e = atom neq</code></p></td></tr><tr id="type-actions.propagate" class="anchored"><td class="def field"><a href="#type-actions.propagate" class="anchor"></a><code>propagate : <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Explanation/index.html#type-t">Sidekick_smt.Explanation.t</a> <a href="../Sidekick_smt/Bag/index.html#type-t">Sidekick_smt.Bag.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Propagate a boolean using a unit clause. <code>expl =&gt; lit</code> must be a theory lemma, that is, a T-tautology</p></td></tr><tr id="type-actions.add_local_axiom" class="anchored"><td class="def field"><a href="#type-actions.add_local_axiom" class="anchor"></a><code>add_local_axiom : <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Add local clause to the SAT solver. This clause will be removed when the solver backtracks.</p></td></tr><tr id="type-actions.add_persistent_axiom" class="anchored"><td class="def field"><a href="#type-actions.add_persistent_axiom" class="anchor"></a><code>add_persistent_axiom : <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> <span>&#8209;&gt;</span> unit;</code></td><td class="doc"><p>Add toplevel clause to the SAT solver. This clause will not be backtracked.</p></td></tr><tr id="type-actions.find" class="anchored"><td class="def field"><a href="#type-actions.find" class="anchor"></a><code>find : <a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Equiv_class/index.html#type-t">Sidekick_smt.Equiv_class.t</a>;</code></td><td class="doc"><p>Find representative of this term</p></td></tr><tr id="type-actions.all_classes" class="anchored"><td class="def field"><a href="#type-actions.all_classes" class="anchor"></a><code>all_classes : <a href="../Sidekick_smt/Equiv_class/index.html#type-t">Sidekick_smt.Equiv_class.t</a> Sequence.t;</code></td><td class="doc"><p>All current equivalence classes (caution: linear in the number of terms existing in the solver)</p></td></tr></table><code>}</code><code></code></dt><dd><p>Actions available to a theory during its lifetime</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.name" class="anchored"><td class="def field"><a href="#type-t.name" class="anchor"></a><code>name : string;</code></td></tr><tr id="type-t.make" class="anchored"><td class="def field"><a href="#type-t.make" class="anchor"></a><code>make : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-actions">actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a>;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : name:string <span>&#8209;&gt;</span> make:(<a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-actions">actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a>) <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make_st"><a href="#val-make_st" class="anchor"></a><code><span class="keyword">val </span>make_st : ?&#8288;on_merge:(<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Equiv_class/index.html#type-t">Sidekick_smt.Equiv_class.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Equiv_class/index.html#type-t">Sidekick_smt.Equiv_class.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Explanation/index.html#type-t">Sidekick_smt.Explanation.t</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> ?&#8288;on_assert:(<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> final_check:(<span class="type-var">'a</span> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a> Sequence.t <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> st:<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-state">state</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Theory_combine/.jbuilder-keep b/sidekick/Sidekick_smt__Theory_combine/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Theory_combine/Form/index.html b/sidekick/Sidekick_smt__Theory_combine/Form/index.html
new file mode 100644
index 00000000..92a06f3b
--- /dev/null
+++ b/sidekick/Sidekick_smt__Theory_combine/Form/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Form (sidekick.Sidekick_smt__Theory_combine.Form)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Theory_combine.Form</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../index.html#type-formula">formula</a></code><code></code></dt><dd><p>The type of atomic formulas.</p></dd></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Equality over formulas.</p></dd></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Hashing function for formulas. Should be such that two formulas equal according to <span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S.equal&quot;"><span class="xref-unresolved" title="unresolved reference to &quot;Expr_intf.S&quot;"><code>Expr_intf</code>.S</span>.equal</span> have the same hash.</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Printing function used among other thing for debugging.</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Formula constant. A valid formula should never be physically equal to <code>dummy</code></p></dd></dl><dl><dt id="val-neg"><a href="#val-neg" class="anchor"></a><code><span class="keyword">val </span>neg : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Formula negation. Should be an involution, i.e. <code>equal a (neg neg a)</code> should always hold.</p></dd></dl><dl><dt id="val-norm"><a href="#val-norm" class="anchor"></a><code><span class="keyword">val </span>norm : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a><span class="keyword"> * </span><a href="../../Sidekick_sat/Theory_intf/index.html#type-negated">Sidekick_sat.Theory_intf.negated</a></code></dt><dd><p>Returns a 'normalized' form of the formula, possibly negated (in which case return <code>Negated</code>). This function is used to recognize the link between a formula <code>a</code> and its negation <code>neg a</code>, so the goal is that <code>a</code> and <code>neg a</code> normalise to the same formula, but one returns <code>Same_sign</code> and the other one returns <code>Negated</code></p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Theory_combine/Proof/index.html b/sidekick/Sidekick_smt__Theory_combine/Proof/index.html
new file mode 100644
index 00000000..83c0fe86
--- /dev/null
+++ b/sidekick/Sidekick_smt__Theory_combine/Proof/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Proof (sidekick.Sidekick_smt__Theory_combine.Proof)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Theory_combine.Proof</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-t.Proof" class="anchored"><td class="def constructor"><a href="#type-t.Proof" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Proof</span></code></td></tr></table><code></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Theory_combine/index.html b/sidekick/Sidekick_smt__Theory_combine/index.html
new file mode 100644
index 00000000..ecd79fa9
--- /dev/null
+++ b/sidekick/Sidekick_smt__Theory_combine/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Theory_combine (sidekick.Sidekick_smt__Theory_combine)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Theory_combine</code></h1><h1 id="main-theory"><a href="#main-theory" class="anchor"></a>Main theory</h1></header><aside><p>Combine the congruence closure with a number of plugins</p></aside><article id="module-Proof"><a href="#module-Proof" class="anchor"></a><code><span class="keyword">module </span><a href="Proof/index.html">Proof</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../Sidekick_sat/Theory_intf/index.html#module-type-S">Sidekick_sat.Theory_intf.S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_sat/Theory_intf/module-type-S/index.html#type-formula">formula</a><span class="keyword"> = </span><a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a><span class="keyword"> and </span><span class="keyword">type </span><a href="../Sidekick_sat/Theory_intf/module-type-S/index.html#type-proof">proof</a><span class="keyword"> = </span><a href="Proof/index.html#type-t">Proof.t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>State of the theory</p></dd></dl><dl><dt id="type-formula"><a href="#type-formula" class="anchor"></a><code><span class="keyword">type </span>formula</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a></code><code></code></dt><dd><p>The type of formulas. Should be compatble with Formula_intf.S</p></dd></dl><dl><dt id="type-proof"><a href="#type-proof" class="anchor"></a><code><span class="keyword">type </span>proof</code><code><span class="keyword"> = </span><a href="Proof/index.html#type-t">Proof.t</a></code><code></code></dt><dd><p>A custom type for the proofs of lemmas produced by the theory.</p></dd></dl><article id="module-Form"><a href="#module-Form" class="anchor"></a><code><span class="keyword">module </span><a href="Form/index.html">Form</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../Sidekick_sat/Theory_intf/index.html#type-actions">Sidekick_sat.Theory_intf.actions</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a new instance of the theory</p></dd></dl><dl><dt id="val-assume"><a href="#val-assume" class="anchor"></a><code><span class="keyword">val </span>assume : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Assume the formulas in the slice, possibly pushing new formulas to be propagated, and returns the result of the new assumptions.</p></dd></dl><dl><dt id="val-if_sat"><a href="#val-if_sat" class="anchor"></a><code><span class="keyword">val </span>if_sat : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../Sidekick_sat/Theory_intf/index.html#type-slice_actions">Sidekick_sat.Theory_intf.slice_actions</a> <span>&#8209;&gt;</span> (<a href="index.html#type-formula">formula</a>, <a href="index.html#type-proof">proof</a>) <a href="../Sidekick_sat/Theory_intf/index.html#type-res">Sidekick_sat.Theory_intf.res</a></code></dt><dd><p>Called at the end of the search in case a model has been found. If no new clause is pushed, then 'sat' is returned, else search is resumed.</p></dd></dl></details></div></div></article><dl><dt id="val-cc"><a href="#val-cc" class="anchor"></a><code><span class="keyword">val </span>cc : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Congruence_closure/index.html#type-t">Sidekick_smt.Congruence_closure.t</a></code></dt><dt id="val-tst"><a href="#val-tst" class="anchor"></a><code><span class="keyword">val </span>tst : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a></code></dt><dt id="val-theories"><a href="#val-theories" class="anchor"></a><code><span class="keyword">val </span>theories : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Theory/index.html#type-state">Sidekick_smt.Theory.state</a> Sequence.t</code></dt><dt id="val-add_theory"><a href="#val-add_theory" class="anchor"></a><code><span class="keyword">val </span>add_theory : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Theory/index.html#type-t">Sidekick_smt.Theory.t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>How to add new theories</p></dd></dl><dl><dt id="val-add_theory_l"><a href="#val-add_theory_l" class="anchor"></a><code><span class="keyword">val </span>add_theory_l : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Theory/index.html#type-t">Sidekick_smt.Theory.t</a> list <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Ty/.jbuilder-keep b/sidekick/Sidekick_smt__Ty/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Ty/index.html b/sidekick/Sidekick_smt__Ty/index.html
new file mode 100644
index 00000000..e25a0acd
--- /dev/null
+++ b/sidekick/Sidekick_smt__Ty/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Ty (sidekick.Sidekick_smt__Ty)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Ty</code></h1><h1 id="hashconsed-types"><a href="#hashconsed-types" class="anchor"></a>Hashconsed Types</h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a></code><code></code></dt><dt id="type-cell"><a href="#type-cell" class="anchor"></a><code><span class="keyword">type </span>cell</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-ty_cell">Sidekick_smt.Solver_types.ty_cell</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-cell.Prop" class="anchored"><td class="def constructor"><a href="#type-cell.Prop" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Prop</span></code></td></tr><tr id="type-cell.Atomic" class="anchored"><td class="def constructor"><a href="#type-cell.Atomic" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Atomic</span><span class="keyword"> of </span><a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a><span class="keyword"> * </span><a href="../Sidekick_smt/Solver_types/index.html#type-ty_def">Sidekick_smt.Solver_types.ty_def</a></code></td></tr><tr id="type-cell.Arrow" class="anchored"><td class="def constructor"><a href="#type-cell.Arrow" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Arrow</span><span class="keyword"> of </span><a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a><span class="keyword"> * </span><a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a></code></td></tr></table><code></code></dt><dt id="type-def"><a href="#type-def" class="anchor"></a><code><span class="keyword">type </span>def</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-ty_def">Sidekick_smt.Solver_types.ty_def</a></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-def.Uninterpreted" class="anchored"><td class="def constructor"><a href="#type-def.Uninterpreted" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Uninterpreted</span></code></td></tr><tr id="type-def.Data" class="anchored"><td class="def constructor"><a href="#type-def.Data" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Data</span><span class="keyword"> of </span><a href="index.html#type-datatype">datatype</a></code></td></tr></table><code></code></dt><dt id="type-datatype"><a href="#type-datatype" class="anchor"></a><code><span class="keyword">type </span>datatype</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-datatype">Sidekick_smt.Solver_types.datatype</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-datatype.data_cstors" class="anchored"><td class="def field"><a href="#type-datatype.data_cstors" class="anchor"></a><code>data_cstors : <a href="index.html#type-data_cstor">data_cstor</a> <a href="../Sidekick_util__ID/index.html#module-Map">Sidekick_util.ID.Map</a>.t lazy_t;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-data_cstor"><a href="#type-data_cstor" class="anchor"></a><code><span class="keyword">type </span>data_cstor</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-data_cstor">Sidekick_smt.Solver_types.data_cstor</a></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-data_cstor.cstor_ty" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_ty" class="anchor"></a><code>cstor_ty : <a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a>;</code></td></tr><tr id="type-data_cstor.cstor_args" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_args" class="anchor"></a><code>cstor_args : <a href="../Sidekick_smt/Solver_types/index.html#type-ty">Sidekick_smt.Solver_types.ty</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a>;</code></td></tr><tr id="type-data_cstor.cstor_proj" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_proj" class="anchor"></a><code>cstor_proj : <a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> lazy_t;</code></td></tr><tr id="type-data_cstor.cstor_test" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_test" class="anchor"></a><code>cstor_test : <a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a> lazy_t;</code></td></tr><tr id="type-data_cstor.cstor_cst" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_cst" class="anchor"></a><code>cstor_cst : <a href="../Sidekick_smt/Solver_types/index.html#type-cst">Sidekick_smt.Solver_types.cst</a>;</code></td></tr><tr id="type-data_cstor.cstor_card" class="anchored"><td class="def field"><a href="#type-data_cstor.cstor_card" class="anchor"></a><code>cstor_card : <a href="../Sidekick_smt/Solver_types/index.html#type-ty_card">Sidekick_smt.Solver_types.ty_card</a>;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-view"><a href="#val-view" class="anchor"></a><code><span class="keyword">val </span>view : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-cell">cell</a></code></dt><dt id="val-prop"><a href="#val-prop" class="anchor"></a><code><span class="keyword">val </span>prop : <a href="index.html#type-t">t</a></code></dt><dt id="val-atomic"><a href="#val-atomic" class="anchor"></a><code><span class="keyword">val </span>atomic : <a href="../Sidekick_util/ID/index.html#type-t">Sidekick_util.ID.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-def">def</a> <span>&#8209;&gt;</span> card:<a href="../Sidekick_smt/Ty_card/index.html#type-t">Sidekick_smt.Ty_card.t</a> lazy_t <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-arrow"><a href="#val-arrow" class="anchor"></a><code><span class="keyword">val </span>arrow : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-arrow_l"><a href="#val-arrow_l" class="anchor"></a><code><span class="keyword">val </span>arrow_l : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-is_prop"><a href="#val-is_prop" class="anchor"></a><code><span class="keyword">val </span>is_prop : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_data"><a href="#val-is_data" class="anchor"></a><code><span class="keyword">val </span>is_data : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_uninterpreted"><a href="#val-is_uninterpreted" class="anchor"></a><code><span class="keyword">val </span>is_uninterpreted : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-is_arrow"><a href="#val-is_arrow" class="anchor"></a><code><span class="keyword">val </span>is_arrow : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-unfold"><a href="#val-unfold" class="anchor"></a><code><span class="keyword">val </span>unfold : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> list<span class="keyword"> * </span><a href="index.html#type-t">t</a></code></dt><dt id="val-unfold_n"><a href="#val-unfold_n" class="anchor"></a><code><span class="keyword">val </span>unfold_n : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int<span class="keyword"> * </span><a href="index.html#type-t">t</a></code></dt><dt id="val-mangle"><a href="#val-mangle" class="anchor"></a><code><span class="keyword">val </span>mangle : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt></dl><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../Sidekick_util/Intf/index.html#module-type-EQ">Sidekick_util.Intf.EQ</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_util/Intf/module-type-EQ/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></details></div></div></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../Sidekick_util/Intf/index.html#module-type-ORD">Sidekick_util.Intf.ORD</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_util/Intf/module-type-ORD/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></details></div></div></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../Sidekick_util/Intf/index.html#module-type-HASH">Sidekick_util.Intf.HASH</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_util/Intf/module-type-HASH/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></details></div></div></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../Sidekick_util/Intf/index.html#module-type-PRINT">Sidekick_util.Intf.PRINT</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_util/Intf/module-type-PRINT/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></details></div></div></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smt__Ty_card/.jbuilder-keep b/sidekick/Sidekick_smt__Ty_card/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smt__Ty_card/index.html b/sidekick/Sidekick_smt__Ty_card/index.html
new file mode 100644
index 00000000..6aaed767
--- /dev/null
+++ b/sidekick/Sidekick_smt__Ty_card/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smt__Ty_card (sidekick.Sidekick_smt__Ty_card)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smt__Ty_card</code></h1><h1 id="type-cardinality"><a href="#type-cardinality" class="anchor"></a>Type Cardinality</h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Solver_types/index.html#type-ty_card">Sidekick_smt.Solver_types.ty_card</a></code><code></code></dt></dl><dl><dt id="val-(+)"><a href="#val-(+)" class="anchor"></a><code><span class="keyword">val </span>(+) : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-(*)"><a href="#val-(*)" class="anchor"></a><code><span class="keyword">val </span>(*) : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-(^)"><a href="#val-(^)" class="anchor"></a><code><span class="keyword">val </span>(^) : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-finite"><a href="#val-finite" class="anchor"></a><code><span class="keyword">val </span>finite : <a href="index.html#type-t">t</a></code></dt><dt id="val-infinite"><a href="#val-infinite" class="anchor"></a><code><span class="keyword">val </span>infinite : <a href="index.html#type-t">t</a></code></dt><dt id="val-sum"><a href="#val-sum" class="anchor"></a><code><span class="keyword">val </span>sum : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-product"><a href="#val-product" class="anchor"></a><code><span class="keyword">val </span>product : <a href="index.html#type-t">t</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> <a href="../Sidekick_util/Intf/index.html#type-printer">Sidekick_util.Intf.printer</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib/.jbuilder-keep b/sidekick/Sidekick_smtlib/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smtlib/Process/index.html b/sidekick/Sidekick_smtlib/Process/index.html
new file mode 100644
index 00000000..a3fd530e
--- /dev/null
+++ b/sidekick/Sidekick_smtlib/Process/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Process (sidekick.Sidekick_smtlib.Process)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib.Process</code></h1></header><div class="doc"><h1 id="process-statements"><a href="#process-statements" class="anchor"></a>Process Statements</h1></div><dl><dt id="type-or_error"><a href="#type-or_error" class="anchor"></a><code><span class="keyword">type </span>'a or_error</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span>, string) CCResult.t</code><code></code></dt></dl><dl><dt id="val-conv_ty"><a href="#val-conv_ty" class="anchor"></a><code><span class="keyword">val </span>conv_ty : <a href="../../Sidekick_smt/Ast/Ty/index.html#type-t">Sidekick_smt.Ast.Ty.t</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a></code></dt><dt id="val-conv_term"><a href="#val-conv_term" class="anchor"></a><code><span class="keyword">val </span>conv_term : <a href="../../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_smt/Ast/index.html#type-term">Sidekick_smt.Ast.term</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a></code></dt><dt id="val-process_stmt"><a href="#val-process_stmt" class="anchor"></a><code><span class="keyword">val </span>process_stmt : ?&#8288;gc:bool <span>&#8209;&gt;</span> ?&#8288;restarts:bool <span>&#8209;&gt;</span> ?&#8288;pp_cnf:bool <span>&#8209;&gt;</span> ?&#8288;dot_proof:string <span>&#8209;&gt;</span> ?&#8288;pp_model:bool <span>&#8209;&gt;</span> ?&#8288;check:bool <span>&#8209;&gt;</span> ?&#8288;time:float <span>&#8209;&gt;</span> ?&#8288;memory:float <span>&#8209;&gt;</span> ?&#8288;progress:bool <span>&#8209;&gt;</span> <a href="../../Sidekick_smt/Solver/index.html#type-t">Sidekick_smt.Solver.t</a> <span>&#8209;&gt;</span> <a href="../../Sidekick_smt/Ast/index.html#type-statement">Sidekick_smt.Ast.statement</a> <span>&#8209;&gt;</span> unit <a href="index.html#type-or_error">or_error</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib/index.html b/sidekick/Sidekick_smtlib/index.html
new file mode 100644
index 00000000..fa7b2295
--- /dev/null
+++ b/sidekick/Sidekick_smtlib/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smtlib (sidekick.Sidekick_smtlib)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib</code></h1><h1 id="smtlib-2-interface"><a href="#smtlib-2-interface" class="anchor"></a>SMTLib-2 Interface</h1></header><aside><p>This library provides a parser, a type-checker, and a solver interface for processing SMTLib-2 problems.</p></aside><dl><dt id="type-or_error"><a href="#type-or_error" class="anchor"></a><code><span class="keyword">type </span>'a or_error</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span>, string) CCResult.t</code><code></code></dt></dl><article id="module-Ast"><a href="#module-Ast" class="anchor"></a><code><span class="keyword">module </span>Ast = <a href="../Sidekick_smt/index.html#module-Ast">Sidekick_smt.Ast</a></code></article><article id="module-Process"><a href="#module-Process" class="anchor"></a><code><span class="keyword">module </span><a href="Process/index.html">Process</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-parse"><a href="#val-parse" class="anchor"></a><code><span class="keyword">val </span>parse : string <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ast/index.html#type-statement">Ast.statement</a> list <a href="index.html#type-or_error">or_error</a></code></dt><dt id="val-parse_stdin"><a href="#val-parse_stdin" class="anchor"></a><code><span class="keyword">val </span>parse_stdin : unit <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ast/index.html#type-statement">Ast.statement</a> list <a href="index.html#type-or_error">or_error</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__/.jbuilder-keep b/sidekick/Sidekick_smtlib__/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smtlib__/Lexer/index.html b/sidekick/Sidekick_smtlib__/Lexer/index.html
new file mode 100644
index 00000000..5ee203cf
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__/Lexer/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lexer (sidekick.Sidekick_smtlib__.Lexer)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__.Lexer</code></h1></header><article id="module-A"><a href="#module-A" class="anchor"></a><code><span class="keyword">module </span>A = <a href="../index.html#module-Parse_ast">Sidekick_smtlib__.Parse_ast</a></code></article><article id="module-Loc"><a href="#module-Loc" class="anchor"></a><code><span class="keyword">module </span>Loc = <a href="../index.html#module-Locations">Sidekick_smtlib__.Locations</a></code></article><dl><dt id="val-__ocaml_lex_tables"><a href="#val-__ocaml_lex_tables" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_tables : Lexing.lex_tables</code></dt><dt id="val-token"><a href="#val-token" class="anchor"></a><code><span class="keyword">val </span>token : Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Parser/index.html#type-token">Sidekick_smtlib__.Parser.token</a></code></dt><dt id="val-__ocaml_lex_token_rec"><a href="#val-__ocaml_lex_token_rec" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_token_rec : Lexing.lexbuf <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Parser/index.html#type-token">Sidekick_smtlib__.Parser.token</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__/Locations/index.html b/sidekick/Sidekick_smtlib__/Locations/index.html
new file mode 100644
index 00000000..df9422c7
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__/Locations/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Locations (sidekick.Sidekick_smtlib__.Locations)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__.Locations</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__/Parse_ast/index.html b/sidekick/Sidekick_smtlib__/Parse_ast/index.html
new file mode 100644
index 00000000..9e665ede
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__/Parse_ast/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Parse_ast (sidekick.Sidekick_smtlib__.Parse_ast)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__.Parse_ast</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__/Parser/index.html b/sidekick/Sidekick_smtlib__/Parser/index.html
new file mode 100644
index 00000000..16a10bd2
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__/Parser/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Parser (sidekick.Sidekick_smtlib__.Parser)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__.Parser</code></h1></header><dl><dt id="type-token"><a href="#type-token" class="anchor"></a><code><span class="keyword">type </span>token</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-token.XOR" class="anchored"><td class="def constructor"><a href="#type-token.XOR" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">XOR</span></code></td></tr><tr id="type-token.TRUE" class="anchored"><td class="def constructor"><a href="#type-token.TRUE" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">TRUE</span></code></td></tr><tr id="type-token.SET_OPTION" class="anchored"><td class="def constructor"><a href="#type-token.SET_OPTION" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">SET_OPTION</span></code></td></tr><tr id="type-token.SET_LOGIC" class="anchored"><td class="def constructor"><a href="#type-token.SET_LOGIC" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">SET_LOGIC</span></code></td></tr><tr id="type-token.SET_INFO" class="anchored"><td class="def constructor"><a href="#type-token.SET_INFO" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">SET_INFO</span></code></td></tr><tr id="type-token.RIGHT_PAREN" class="anchored"><td class="def constructor"><a href="#type-token.RIGHT_PAREN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">RIGHT_PAREN</span></code></td></tr><tr id="type-token.QUOTED" class="anchored"><td class="def constructor"><a href="#type-token.QUOTED" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">QUOTED</span><span class="keyword"> of </span>string</code></td></tr><tr id="type-token.PROD" class="anchored"><td class="def constructor"><a href="#type-token.PROD" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">PROD</span></code></td></tr><tr id="type-token.PAR" class="anchored"><td class="def constructor"><a href="#type-token.PAR" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">PAR</span></code></td></tr><tr id="type-token.OR" class="anchored"><td class="def constructor"><a href="#type-token.OR" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">OR</span></code></td></tr><tr id="type-token.NOT" class="anchored"><td class="def constructor"><a href="#type-token.NOT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">NOT</span></code></td></tr><tr id="type-token.MINUS" class="anchored"><td class="def constructor"><a href="#type-token.MINUS" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">MINUS</span></code></td></tr><tr id="type-token.MATCH" class="anchored"><td class="def constructor"><a href="#type-token.MATCH" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">MATCH</span></code></td></tr><tr id="type-token.LT" class="anchored"><td class="def constructor"><a href="#type-token.LT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LT</span></code></td></tr><tr id="type-token.LET" class="anchored"><td class="def constructor"><a href="#type-token.LET" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LET</span></code></td></tr><tr id="type-token.LEQ" class="anchored"><td class="def constructor"><a href="#type-token.LEQ" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LEQ</span></code></td></tr><tr id="type-token.LEMMA" class="anchored"><td class="def constructor"><a href="#type-token.LEMMA" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LEMMA</span></code></td></tr><tr id="type-token.LEFT_PAREN" class="anchored"><td class="def constructor"><a href="#type-token.LEFT_PAREN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LEFT_PAREN</span></code></td></tr><tr id="type-token.IF" class="anchored"><td class="def constructor"><a href="#type-token.IF" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">IF</span></code></td></tr><tr id="type-token.IDENT" class="anchored"><td class="def constructor"><a href="#type-token.IDENT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">IDENT</span><span class="keyword"> of </span>string</code></td></tr><tr id="type-token.GT" class="anchored"><td class="def constructor"><a href="#type-token.GT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">GT</span></code></td></tr><tr id="type-token.GEQ" class="anchored"><td class="def constructor"><a href="#type-token.GEQ" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">GEQ</span></code></td></tr><tr id="type-token.FUN" class="anchored"><td class="def constructor"><a href="#type-token.FUN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">FUN</span></code></td></tr><tr id="type-token.FORALL" class="anchored"><td class="def constructor"><a href="#type-token.FORALL" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">FORALL</span></code></td></tr><tr id="type-token.FALSE" class="anchored"><td class="def constructor"><a href="#type-token.FALSE" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">FALSE</span></code></td></tr><tr id="type-token.EXIT" class="anchored"><td class="def constructor"><a href="#type-token.EXIT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EXIT</span></code></td></tr><tr id="type-token.EXISTS" class="anchored"><td class="def constructor"><a href="#type-token.EXISTS" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EXISTS</span></code></td></tr><tr id="type-token.ESCAPED" class="anchored"><td class="def constructor"><a href="#type-token.ESCAPED" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ESCAPED</span><span class="keyword"> of </span>string</code></td></tr><tr id="type-token.EQ" class="anchored"><td class="def constructor"><a href="#type-token.EQ" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EQ</span></code></td></tr><tr id="type-token.EOI" class="anchored"><td class="def constructor"><a href="#type-token.EOI" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EOI</span></code></td></tr><tr id="type-token.DIV" class="anchored"><td class="def constructor"><a href="#type-token.DIV" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DIV</span></code></td></tr><tr id="type-token.DISTINCT" class="anchored"><td class="def constructor"><a href="#type-token.DISTINCT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DISTINCT</span></code></td></tr><tr id="type-token.DEFINE_FUN_REC" class="anchored"><td class="def constructor"><a href="#type-token.DEFINE_FUN_REC" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DEFINE_FUN_REC</span></code></td></tr><tr id="type-token.DEFINE_FUNS_REC" class="anchored"><td class="def constructor"><a href="#type-token.DEFINE_FUNS_REC" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DEFINE_FUNS_REC</span></code></td></tr><tr id="type-token.DEFINE_FUN" class="anchored"><td class="def constructor"><a href="#type-token.DEFINE_FUN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DEFINE_FUN</span></code></td></tr><tr id="type-token.DEFAULT" class="anchored"><td class="def constructor"><a href="#type-token.DEFAULT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DEFAULT</span></code></td></tr><tr id="type-token.DECLARE_SORT" class="anchored"><td class="def constructor"><a href="#type-token.DECLARE_SORT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DECLARE_SORT</span></code></td></tr><tr id="type-token.DECLARE_FUN" class="anchored"><td class="def constructor"><a href="#type-token.DECLARE_FUN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DECLARE_FUN</span></code></td></tr><tr id="type-token.DECLARE_CONST" class="anchored"><td class="def constructor"><a href="#type-token.DECLARE_CONST" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DECLARE_CONST</span></code></td></tr><tr id="type-token.DATA" class="anchored"><td class="def constructor"><a href="#type-token.DATA" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DATA</span></code></td></tr><tr id="type-token.CHECK_SAT" class="anchored"><td class="def constructor"><a href="#type-token.CHECK_SAT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">CHECK_SAT</span></code></td></tr><tr id="type-token.CASE" class="anchored"><td class="def constructor"><a href="#type-token.CASE" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">CASE</span></code></td></tr><tr id="type-token.AT" class="anchored"><td class="def constructor"><a href="#type-token.AT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">AT</span></code></td></tr><tr id="type-token.ASSERT_NOT" class="anchored"><td class="def constructor"><a href="#type-token.ASSERT_NOT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ASSERT_NOT</span></code></td></tr><tr id="type-token.ASSERT" class="anchored"><td class="def constructor"><a href="#type-token.ASSERT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ASSERT</span></code></td></tr><tr id="type-token.AS" class="anchored"><td class="def constructor"><a href="#type-token.AS" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">AS</span></code></td></tr><tr id="type-token.ARROW" class="anchored"><td class="def constructor"><a href="#type-token.ARROW" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ARROW</span></code></td></tr><tr id="type-token.AND" class="anchored"><td class="def constructor"><a href="#type-token.AND" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">AND</span></code></td></tr><tr id="type-token.ADD" class="anchored"><td class="def constructor"><a href="#type-token.ADD" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ADD</span></code></td></tr></table><code></code></dt></dl><dl><dt id="exception-Error"><a href="#exception-Error" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Error</span></code></dt></dl><dl><dt id="val-parse_ty"><a href="#val-parse_ty" class="anchor"></a><code><span class="keyword">val </span>parse_ty : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Parse_ast/index.html#type-ty">Sidekick_smtlib__.Parse_ast.ty</a></code></dt><dt id="val-parse_term"><a href="#val-parse_term" class="anchor"></a><code><span class="keyword">val </span>parse_term : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Parse_ast/index.html#type-term">Sidekick_smtlib__.Parse_ast.term</a></code></dt><dt id="val-parse_list"><a href="#val-parse_list" class="anchor"></a><code><span class="keyword">val </span>parse_list : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Parse_ast/index.html#type-statement">Sidekick_smtlib__.Parse_ast.statement</a> list</code></dt><dt id="val-parse"><a href="#val-parse" class="anchor"></a><code><span class="keyword">val </span>parse : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Parse_ast/index.html#type-statement">Sidekick_smtlib__.Parse_ast.statement</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__/Process/index.html b/sidekick/Sidekick_smtlib__/Process/index.html
new file mode 100644
index 00000000..e993ddeb
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__/Process/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Process (sidekick.Sidekick_smtlib__.Process)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__.Process</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__/Typecheck/index.html b/sidekick/Sidekick_smtlib__/Typecheck/index.html
new file mode 100644
index 00000000..6466ff49
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__/Typecheck/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Typecheck (sidekick.Sidekick_smtlib__.Typecheck)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__.Typecheck</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__/index.html b/sidekick/Sidekick_smtlib__/index.html
new file mode 100644
index 00000000..cc397f44
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smtlib__ (sidekick.Sidekick_smtlib__)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__</code></h1></header><article id="module-Lexer"><a href="#module-Lexer" class="anchor"></a><code><span class="keyword">module </span><a href="Lexer/index.html">Lexer</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Locations"><a href="#module-Locations" class="anchor"></a><code><span class="keyword">module </span><a href="Locations/index.html">Locations</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Parse_ast"><a href="#module-Parse_ast" class="anchor"></a><code><span class="keyword">module </span><a href="Parse_ast/index.html">Parse_ast</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Parser"><a href="#module-Parser" class="anchor"></a><code><span class="keyword">module </span><a href="Parser/index.html">Parser</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Process"><a href="#module-Process" class="anchor"></a><code><span class="keyword">module </span><a href="Process/index.html">Process</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Sidekick_smtlib"><a href="#module-Sidekick_smtlib" class="anchor"></a><code><span class="keyword">module </span>Sidekick_smtlib = <a href="../Sidekick_smtlib/index.html">Sidekick_smtlib</a></code></article><article id="module-Typecheck"><a href="#module-Typecheck" class="anchor"></a><code><span class="keyword">module </span><a href="Typecheck/index.html">Typecheck</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__Lexer/.jbuilder-keep b/sidekick/Sidekick_smtlib__Lexer/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smtlib__Lexer/index.html b/sidekick/Sidekick_smtlib__Lexer/index.html
new file mode 100644
index 00000000..1041e691
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__Lexer/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smtlib__Lexer (sidekick.Sidekick_smtlib__Lexer)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__Lexer</code></h1></header><article id="module-A"><a href="#module-A" class="anchor"></a><code><span class="keyword">module </span>A = <a href="../Sidekick_smtlib__/index.html#module-Parse_ast">Sidekick_smtlib__.Parse_ast</a></code></article><article id="module-Loc"><a href="#module-Loc" class="anchor"></a><code><span class="keyword">module </span>Loc = <a href="../Sidekick_smtlib__/index.html#module-Locations">Sidekick_smtlib__.Locations</a></code></article><dl><dt id="val-__ocaml_lex_tables"><a href="#val-__ocaml_lex_tables" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_tables : Lexing.lex_tables</code></dt><dt id="val-token"><a href="#val-token" class="anchor"></a><code><span class="keyword">val </span>token : Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Sidekick_smtlib__/Parser/index.html#type-token">Sidekick_smtlib__.Parser.token</a></code></dt><dt id="val-__ocaml_lex_token_rec"><a href="#val-__ocaml_lex_token_rec" class="anchor"></a><code><span class="keyword">val </span>__ocaml_lex_token_rec : Lexing.lexbuf <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="../Sidekick_smtlib__/Parser/index.html#type-token">Sidekick_smtlib__.Parser.token</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__Locations/.jbuilder-keep b/sidekick/Sidekick_smtlib__Locations/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smtlib__Locations/index.html b/sidekick/Sidekick_smtlib__Locations/index.html
new file mode 100644
index 00000000..3d148ddb
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__Locations/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smtlib__Locations (sidekick.Sidekick_smtlib__Locations)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__Locations</code></h1><h1 id="locations"><a href="#locations" class="anchor"></a>Locations</h1><nav><ul><li><a href="#lexbuf">Lexbuf</a></li></ul></nav></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-t.file" class="anchored"><td class="def field"><a href="#type-t.file" class="anchor"></a><code>file : string;</code></td></tr><tr id="type-t.start_line" class="anchored"><td class="def field"><a href="#type-t.start_line" class="anchor"></a><code>start_line : int;</code></td></tr><tr id="type-t.start_column" class="anchored"><td class="def field"><a href="#type-t.start_column" class="anchor"></a><code>start_column : int;</code></td></tr><tr id="type-t.stop_line" class="anchored"><td class="def field"><a href="#type-t.stop_line" class="anchor"></a><code>stop_line : int;</code></td></tr><tr id="type-t.stop_column" class="anchored"><td class="def field"><a href="#type-t.stop_column" class="anchor"></a><code>stop_column : int;</code></td></tr></table><code>}</code><code></code></dt></dl><dl><dt id="val-mk"><a href="#val-mk" class="anchor"></a><code><span class="keyword">val </span>mk : string <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-mk_pair"><a href="#val-mk_pair" class="anchor"></a><code><span class="keyword">val </span>mk_pair : string <span>&#8209;&gt;</span> (int<span class="keyword"> * </span>int) <span>&#8209;&gt;</span> (int<span class="keyword"> * </span>int) <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-mk_pos"><a href="#val-mk_pos" class="anchor"></a><code><span class="keyword">val </span>mk_pos : Lexing.position <span>&#8209;&gt;</span> Lexing.position <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_opt"><a href="#val-pp_opt" class="anchor"></a><code><span class="keyword">val </span>pp_opt : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> option <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_to_string"><a href="#val-pp_to_string" class="anchor"></a><code><span class="keyword">val </span>pp_to_string : (Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> string</code></dt><dt id="val-to_string_opt"><a href="#val-to_string_opt" class="anchor"></a><code><span class="keyword">val </span>to_string_opt : <a href="index.html#type-t">t</a> option <span>&#8209;&gt;</span> string</code></dt></dl><section><header><h2 id="lexbuf"><a href="#lexbuf" class="anchor"></a>Lexbuf</h2></header><dl><dt id="val-set_file"><a href="#val-set_file" class="anchor"></a><code><span class="keyword">val </span>set_file : Lexing.lexbuf <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> unit</code></dt><dt id="val-get_file"><a href="#val-get_file" class="anchor"></a><code><span class="keyword">val </span>get_file : Lexing.lexbuf <span>&#8209;&gt;</span> string</code></dt><dt id="val-of_lexbuf"><a href="#val-of_lexbuf" class="anchor"></a><code><span class="keyword">val </span>of_lexbuf : Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__Parse_ast/.jbuilder-keep b/sidekick/Sidekick_smtlib__Parse_ast/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smtlib__Parse_ast/index.html b/sidekick/Sidekick_smtlib__Parse_ast/index.html
new file mode 100644
index 00000000..19432026
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__Parse_ast/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smtlib__Parse_ast (sidekick.Sidekick_smtlib__Parse_ast)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__Parse_ast</code></h1><h1 id="simple-ast-for-parsing"><a href="#simple-ast-for-parsing" class="anchor"></a>Simple AST for parsing</h1><nav><ul><li><a href="#errors">Errors</a></li></ul></nav></header><article id="module-Loc"><a href="#module-Loc" class="anchor"></a><code><span class="keyword">module </span>Loc = <a href="../Sidekick_smtlib__/index.html#module-Locations">Sidekick_smtlib__.Locations</a></code></article><article id="module-Fmt"><a href="#module-Fmt" class="anchor"></a><code><span class="keyword">module </span>Fmt = CCFormat</code></article><dl><dt id="val-pp_str"><a href="#val-pp_str" class="anchor"></a><code><span class="keyword">val </span>pp_str : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_to_string"><a href="#val-pp_to_string" class="anchor"></a><code><span class="keyword">val </span>pp_to_string : (Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> string</code></dt></dl><dl><dt id="type-var"><a href="#type-var" class="anchor"></a><code><span class="keyword">type </span>var</code><code><span class="keyword"> = </span>string</code><code></code></dt><dt id="type-ty_var"><a href="#type-ty_var" class="anchor"></a><code><span class="keyword">type </span>ty_var</code><code><span class="keyword"> = </span>string</code><code></code></dt><dt id="type-ty"><a href="#type-ty" class="anchor"></a><code><span class="keyword">type </span>ty</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-ty.Ty_bool" class="anchored"><td class="def constructor"><a href="#type-ty.Ty_bool" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Ty_bool</span></code></td></tr><tr id="type-ty.Ty_app" class="anchored"><td class="def constructor"><a href="#type-ty.Ty_app" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Ty_app</span><span class="keyword"> of </span><a href="index.html#type-ty_var">ty_var</a><span class="keyword"> * </span><a href="index.html#type-ty">ty</a> list</code></td></tr><tr id="type-ty.Ty_arrow" class="anchored"><td class="def constructor"><a href="#type-ty.Ty_arrow" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Ty_arrow</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a> list<span class="keyword"> * </span><a href="index.html#type-ty">ty</a></code></td></tr></table><code></code></dt><dd><p>Polymorphic types</p></dd></dl><dl><dt id="type-typed_var"><a href="#type-typed_var" class="anchor"></a><code><span class="keyword">type </span>typed_var</code><code><span class="keyword"> = </span><a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-ty">ty</a></code><code></code></dt><dt id="type-arith_op"><a href="#type-arith_op" class="anchor"></a><code><span class="keyword">type </span>arith_op</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-arith_op.Leq" class="anchored"><td class="def constructor"><a href="#type-arith_op.Leq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Leq</span></code></td></tr><tr id="type-arith_op.Lt" class="anchored"><td class="def constructor"><a href="#type-arith_op.Lt" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Lt</span></code></td></tr><tr id="type-arith_op.Geq" class="anchored"><td class="def constructor"><a href="#type-arith_op.Geq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Geq</span></code></td></tr><tr id="type-arith_op.Gt" class="anchored"><td class="def constructor"><a href="#type-arith_op.Gt" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Gt</span></code></td></tr><tr id="type-arith_op.Add" class="anchored"><td class="def constructor"><a href="#type-arith_op.Add" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Add</span></code></td></tr><tr id="type-arith_op.Minus" class="anchored"><td class="def constructor"><a href="#type-arith_op.Minus" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Minus</span></code></td></tr><tr id="type-arith_op.Mult" class="anchored"><td class="def constructor"><a href="#type-arith_op.Mult" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Mult</span></code></td></tr><tr id="type-arith_op.Div" class="anchored"><td class="def constructor"><a href="#type-arith_op.Div" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Div</span></code></td></tr></table><code></code></dt><dt id="type-term"><a href="#type-term" class="anchor"></a><code><span class="keyword">type </span>term</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-term.True" class="anchored"><td class="def constructor"><a href="#type-term.True" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">True</span></code></td></tr><tr id="type-term.False" class="anchored"><td class="def constructor"><a href="#type-term.False" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">False</span></code></td></tr><tr id="type-term.Const" class="anchored"><td class="def constructor"><a href="#type-term.Const" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Const</span><span class="keyword"> of </span>string</code></td></tr><tr id="type-term.Arith" class="anchored"><td class="def constructor"><a href="#type-term.Arith" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Arith</span><span class="keyword"> of </span><a href="index.html#type-arith_op">arith_op</a><span class="keyword"> * </span><a href="index.html#type-term">term</a> list</code></td></tr><tr id="type-term.App" class="anchored"><td class="def constructor"><a href="#type-term.App" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">App</span><span class="keyword"> of </span>string<span class="keyword"> * </span><a href="index.html#type-term">term</a> list</code></td></tr><tr id="type-term.HO_app" class="anchored"><td class="def constructor"><a href="#type-term.HO_app" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">HO_app</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term.Match" class="anchored"><td class="def constructor"><a href="#type-term.Match" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Match</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-match_branch">match_branch</a> list</code></td></tr><tr id="type-term.If" class="anchored"><td class="def constructor"><a href="#type-term.If" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">If</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term.Let" class="anchored"><td class="def constructor"><a href="#type-term.Let" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Let</span><span class="keyword"> of </span>(<a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-term">term</a>) list<span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term.Fun" class="anchored"><td class="def constructor"><a href="#type-term.Fun" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Fun</span><span class="keyword"> of </span><a href="index.html#type-typed_var">typed_var</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term.Eq" class="anchored"><td class="def constructor"><a href="#type-term.Eq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Eq</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term.Imply" class="anchored"><td class="def constructor"><a href="#type-term.Imply" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Imply</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term.And" class="anchored"><td class="def constructor"><a href="#type-term.And" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">And</span><span class="keyword"> of </span><a href="index.html#type-term">term</a> list</code></td></tr><tr id="type-term.Or" class="anchored"><td class="def constructor"><a href="#type-term.Or" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Or</span><span class="keyword"> of </span><a href="index.html#type-term">term</a> list</code></td></tr><tr id="type-term.Not" class="anchored"><td class="def constructor"><a href="#type-term.Not" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Not</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term.Xor" class="anchored"><td class="def constructor"><a href="#type-term.Xor" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Xor</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term.Distinct" class="anchored"><td class="def constructor"><a href="#type-term.Distinct" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Distinct</span><span class="keyword"> of </span><a href="index.html#type-term">term</a> list</code></td></tr><tr id="type-term.Cast" class="anchored"><td class="def constructor"><a href="#type-term.Cast" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Cast</span><span class="keyword"> of </span><a href="index.html#type-term">term</a><span class="keyword"> * </span><a href="index.html#type-ty">ty</a></code></td></tr><tr id="type-term.Forall" class="anchored"><td class="def constructor"><a href="#type-term.Forall" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Forall</span><span class="keyword"> of </span>(<a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-ty">ty</a>) list<span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-term.Exists" class="anchored"><td class="def constructor"><a href="#type-term.Exists" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Exists</span><span class="keyword"> of </span>(<a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-ty">ty</a>) list<span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr></table><code></code></dt><dd><h2 id="ast:-s-expressions-with-locations"><a href="#ast:-s-expressions-with-locations" class="anchor"></a>AST: S-expressions with locations</h2></dd></dl><dl><dt id="type-match_branch"><a href="#type-match_branch" class="anchor"></a><code><span class="keyword">type </span>match_branch</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-match_branch.Match_default" class="anchored"><td class="def constructor"><a href="#type-match_branch.Match_default" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Match_default</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-match_branch.Match_case" class="anchored"><td class="def constructor"><a href="#type-match_branch.Match_case" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Match_case</span><span class="keyword"> of </span>string<span class="keyword"> * </span><a href="index.html#type-var">var</a> list<span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr></table><code></code></dt><dt id="type-cstor"><a href="#type-cstor" class="anchor"></a><code><span class="keyword">type </span>cstor</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-cstor.cstor_name" class="anchored"><td class="def field"><a href="#type-cstor.cstor_name" class="anchor"></a><code>cstor_name : string;</code></td></tr><tr id="type-cstor.cstor_args" class="anchored"><td class="def field"><a href="#type-cstor.cstor_args" class="anchor"></a><code>cstor_args : (string<span class="keyword"> * </span><a href="index.html#type-ty">ty</a>) list;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-fun_decl"><a href="#type-fun_decl" class="anchor"></a><code><span class="keyword">type </span>'arg fun_decl</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-fun_decl.fun_ty_vars" class="anchored"><td class="def field"><a href="#type-fun_decl.fun_ty_vars" class="anchor"></a><code>fun_ty_vars : <a href="index.html#type-ty_var">ty_var</a> list;</code></td></tr><tr id="type-fun_decl.fun_name" class="anchored"><td class="def field"><a href="#type-fun_decl.fun_name" class="anchor"></a><code>fun_name : string;</code></td></tr><tr id="type-fun_decl.fun_args" class="anchored"><td class="def field"><a href="#type-fun_decl.fun_args" class="anchor"></a><code>fun_args : <span class="type-var">'arg</span> list;</code></td></tr><tr id="type-fun_decl.fun_ret" class="anchored"><td class="def field"><a href="#type-fun_decl.fun_ret" class="anchor"></a><code>fun_ret : <a href="index.html#type-ty">ty</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-fun_def"><a href="#type-fun_def" class="anchor"></a><code><span class="keyword">type </span>fun_def</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-fun_def.fr_decl" class="anchored"><td class="def field"><a href="#type-fun_def.fr_decl" class="anchor"></a><code>fr_decl : <a href="index.html#type-typed_var">typed_var</a> <a href="index.html#type-fun_decl">fun_decl</a>;</code></td></tr><tr id="type-fun_def.fr_body" class="anchored"><td class="def field"><a href="#type-fun_def.fr_body" class="anchor"></a><code>fr_body : <a href="index.html#type-term">term</a>;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-funs_rec_def"><a href="#type-funs_rec_def" class="anchor"></a><code><span class="keyword">type </span>funs_rec_def</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-funs_rec_def.fsr_decls" class="anchored"><td class="def field"><a href="#type-funs_rec_def.fsr_decls" class="anchor"></a><code>fsr_decls : <a href="index.html#type-typed_var">typed_var</a> <a href="index.html#type-fun_decl">fun_decl</a> list;</code></td></tr><tr id="type-funs_rec_def.fsr_bodies" class="anchored"><td class="def field"><a href="#type-funs_rec_def.fsr_bodies" class="anchor"></a><code>fsr_bodies : <a href="index.html#type-term">term</a> list;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-statement"><a href="#type-statement" class="anchor"></a><code><span class="keyword">type </span>statement</code><code></code><code><span class="keyword"> = </span></code><code>{</code><table class="record"><tr id="type-statement.stmt" class="anchored"><td class="def field"><a href="#type-statement.stmt" class="anchor"></a><code>stmt : <a href="index.html#type-stmt">stmt</a>;</code></td></tr><tr id="type-statement.loc" class="anchored"><td class="def field"><a href="#type-statement.loc" class="anchor"></a><code>loc : <a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> option;</code></td></tr></table><code>}</code><code></code></dt><dt id="type-stmt"><a href="#type-stmt" class="anchor"></a><code><span class="keyword">type </span>stmt</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-stmt.Stmt_decl_sort" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_decl_sort" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_decl_sort</span><span class="keyword"> of </span>string<span class="keyword"> * </span>int</code></td></tr><tr id="type-stmt.Stmt_decl" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_decl" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_decl</span><span class="keyword"> of </span><a href="index.html#type-ty">ty</a> <a href="index.html#type-fun_decl">fun_decl</a></code></td></tr><tr id="type-stmt.Stmt_fun_def" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_fun_def" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_fun_def</span><span class="keyword"> of </span><a href="index.html#type-fun_def">fun_def</a></code></td></tr><tr id="type-stmt.Stmt_fun_rec" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_fun_rec" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_fun_rec</span><span class="keyword"> of </span><a href="index.html#type-fun_def">fun_def</a></code></td></tr><tr id="type-stmt.Stmt_funs_rec" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_funs_rec" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_funs_rec</span><span class="keyword"> of </span><a href="index.html#type-funs_rec_def">funs_rec_def</a></code></td></tr><tr id="type-stmt.Stmt_data" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_data" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_data</span><span class="keyword"> of </span><a href="index.html#type-ty_var">ty_var</a> list<span class="keyword"> * </span>(string<span class="keyword"> * </span><a href="index.html#type-cstor">cstor</a> list) list</code></td></tr><tr id="type-stmt.Stmt_assert" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_assert" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_assert</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-stmt.Stmt_lemma" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_lemma" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_lemma</span><span class="keyword"> of </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-stmt.Stmt_assert_not" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_assert_not" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_assert_not</span><span class="keyword"> of </span><a href="index.html#type-ty_var">ty_var</a> list<span class="keyword"> * </span><a href="index.html#type-term">term</a></code></td></tr><tr id="type-stmt.Stmt_set_logic" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_set_logic" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_set_logic</span><span class="keyword"> of </span>string</code></td></tr><tr id="type-stmt.Stmt_set_option" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_set_option" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_set_option</span><span class="keyword"> of </span>string list</code></td></tr><tr id="type-stmt.Stmt_set_info" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_set_info" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_set_info</span><span class="keyword"> of </span>string list</code></td></tr><tr id="type-stmt.Stmt_check_sat" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_check_sat" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_check_sat</span></code></td></tr><tr id="type-stmt.Stmt_exit" class="anchored"><td class="def constructor"><a href="#type-stmt.Stmt_exit" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">Stmt_exit</span></code></td></tr></table><code></code></dt></dl><dl><dt id="val-ty_bool"><a href="#val-ty_bool" class="anchor"></a><code><span class="keyword">val </span>ty_bool : <a href="index.html#type-ty">ty</a></code></dt><dt id="val-ty_app"><a href="#val-ty_app" class="anchor"></a><code><span class="keyword">val </span>ty_app : <a href="index.html#type-ty_var">ty_var</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a> list <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a></code></dt><dt id="val-ty_const"><a href="#val-ty_const" class="anchor"></a><code><span class="keyword">val </span>ty_const : <a href="index.html#type-ty_var">ty_var</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a></code></dt><dt id="val-ty_arrow_l"><a href="#val-ty_arrow_l" class="anchor"></a><code><span class="keyword">val </span>ty_arrow_l : <a href="index.html#type-ty">ty</a> list <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a></code></dt><dt id="val-ty_arrow"><a href="#val-ty_arrow" class="anchor"></a><code><span class="keyword">val </span>ty_arrow : <a href="index.html#type-ty">ty</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a></code></dt><dt id="val-true_"><a href="#val-true_" class="anchor"></a><code><span class="keyword">val </span>true_ : <a href="index.html#type-term">term</a></code></dt><dt id="val-false_"><a href="#val-false_" class="anchor"></a><code><span class="keyword">val </span>false_ : <a href="index.html#type-term">term</a></code></dt><dt id="val-const"><a href="#val-const" class="anchor"></a><code><span class="keyword">val </span>const : string <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-app"><a href="#val-app" class="anchor"></a><code><span class="keyword">val </span>app : string <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-ho_app"><a href="#val-ho_app" class="anchor"></a><code><span class="keyword">val </span>ho_app : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-ho_app_l"><a href="#val-ho_app_l" class="anchor"></a><code><span class="keyword">val </span>ho_app_l : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-match_"><a href="#val-match_" class="anchor"></a><code><span class="keyword">val </span>match_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-match_branch">match_branch</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-if_"><a href="#val-if_" class="anchor"></a><code><span class="keyword">val </span>if_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-fun_"><a href="#val-fun_" class="anchor"></a><code><span class="keyword">val </span>fun_ : <a href="index.html#type-typed_var">typed_var</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-fun_l"><a href="#val-fun_l" class="anchor"></a><code><span class="keyword">val </span>fun_l : <a href="index.html#type-typed_var">typed_var</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-let_"><a href="#val-let_" class="anchor"></a><code><span class="keyword">val </span>let_ : (<a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-term">term</a>) list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-eq"><a href="#val-eq" class="anchor"></a><code><span class="keyword">val </span>eq : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-imply"><a href="#val-imply" class="anchor"></a><code><span class="keyword">val </span>imply : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-xor"><a href="#val-xor" class="anchor"></a><code><span class="keyword">val </span>xor : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-and_"><a href="#val-and_" class="anchor"></a><code><span class="keyword">val </span>and_ : <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-or_"><a href="#val-or_" class="anchor"></a><code><span class="keyword">val </span>or_ : <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-distinct"><a href="#val-distinct" class="anchor"></a><code><span class="keyword">val </span>distinct : <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-cast"><a href="#val-cast" class="anchor"></a><code><span class="keyword">val </span>cast : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> ty:<a href="index.html#type-ty">ty</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-forall"><a href="#val-forall" class="anchor"></a><code><span class="keyword">val </span>forall : (<a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-ty">ty</a>) list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-exists"><a href="#val-exists" class="anchor"></a><code><span class="keyword">val </span>exists : (<a href="index.html#type-var">var</a><span class="keyword"> * </span><a href="index.html#type-ty">ty</a>) list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-not_"><a href="#val-not_" class="anchor"></a><code><span class="keyword">val </span>not_ : <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-arith"><a href="#val-arith" class="anchor"></a><code><span class="keyword">val </span>arith : <a href="index.html#type-arith_op">arith_op</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-_mk"><a href="#val-_mk" class="anchor"></a><code><span class="keyword">val </span>_mk : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-stmt">stmt</a> <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-mk_cstor"><a href="#val-mk_cstor" class="anchor"></a><code><span class="keyword">val </span>mk_cstor : string <span>&#8209;&gt;</span> (string<span class="keyword"> * </span><a href="index.html#type-ty">ty</a>) list <span>&#8209;&gt;</span> <a href="index.html#type-cstor">cstor</a></code></dt><dt id="val-mk_fun_decl"><a href="#val-mk_fun_decl" class="anchor"></a><code><span class="keyword">val </span>mk_fun_decl : ty_vars:<a href="index.html#type-ty_var">ty_var</a> list <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <span class="type-var">'a</span> list <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-fun_decl">fun_decl</a></code></dt><dt id="val-mk_fun_rec"><a href="#val-mk_fun_rec" class="anchor"></a><code><span class="keyword">val </span>mk_fun_rec : ty_vars:<a href="index.html#type-ty_var">ty_var</a> list <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-typed_var">typed_var</a> list <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-fun_def">fun_def</a></code></dt><dt id="val-decl_sort"><a href="#val-decl_sort" class="anchor"></a><code><span class="keyword">val </span>decl_sort : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> arity:int <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-decl_fun"><a href="#val-decl_fun" class="anchor"></a><code><span class="keyword">val </span>decl_fun : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> tyvars:<a href="index.html#type-ty_var">ty_var</a> list <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a> list <span>&#8209;&gt;</span> <a href="index.html#type-ty">ty</a> <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-fun_def"><a href="#val-fun_def" class="anchor"></a><code><span class="keyword">val </span>fun_def : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-fun_def">fun_def</a> <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-fun_rec"><a href="#val-fun_rec" class="anchor"></a><code><span class="keyword">val </span>fun_rec : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-fun_def">fun_def</a> <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-funs_rec"><a href="#val-funs_rec" class="anchor"></a><code><span class="keyword">val </span>funs_rec : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-typed_var">typed_var</a> <a href="index.html#type-fun_decl">fun_decl</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-data"><a href="#val-data" class="anchor"></a><code><span class="keyword">val </span>data : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-ty_var">ty_var</a> list <span>&#8209;&gt;</span> (string<span class="keyword"> * </span><a href="index.html#type-cstor">cstor</a> list) list <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-assert_"><a href="#val-assert_" class="anchor"></a><code><span class="keyword">val </span>assert_ : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-lemma"><a href="#val-lemma" class="anchor"></a><code><span class="keyword">val </span>lemma : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-assert_not"><a href="#val-assert_not" class="anchor"></a><code><span class="keyword">val </span>assert_not : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> ty_vars:<a href="index.html#type-ty_var">ty_var</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-set_logic"><a href="#val-set_logic" class="anchor"></a><code><span class="keyword">val </span>set_logic : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-set_option"><a href="#val-set_option" class="anchor"></a><code><span class="keyword">val </span>set_option : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> string list <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-set_info"><a href="#val-set_info" class="anchor"></a><code><span class="keyword">val </span>set_info : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> string list <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-check_sat"><a href="#val-check_sat" class="anchor"></a><code><span class="keyword">val </span>check_sat : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-exit"><a href="#val-exit" class="anchor"></a><code><span class="keyword">val </span>exit : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> unit <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a></code></dt><dt id="val-loc"><a href="#val-loc" class="anchor"></a><code><span class="keyword">val </span>loc : <a href="index.html#type-statement">statement</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> option</code></dt><dt id="val-view"><a href="#val-view" class="anchor"></a><code><span class="keyword">val </span>view : <a href="index.html#type-statement">statement</a> <span>&#8209;&gt;</span> <a href="index.html#type-stmt">stmt</a></code></dt><dt id="val-fpf"><a href="#val-fpf" class="anchor"></a><code><span class="keyword">val </span>fpf : Format.formatter <span>&#8209;&gt;</span> (<span class="type-var">'a</span>, Format.formatter, unit) Pervasives.format <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-pp_tyvar"><a href="#val-pp_tyvar" class="anchor"></a><code><span class="keyword">val </span>pp_tyvar : Format.formatter <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_ty"><a href="#val-pp_ty" class="anchor"></a><code><span class="keyword">val </span>pp_ty : <a href="index.html#type-ty">ty</a> <a href="../Sidekick_util/Util/index.html#type-printer">Sidekick_util.Util.printer</a></code></dt><dt id="val-pp_arith"><a href="#val-pp_arith" class="anchor"></a><code><span class="keyword">val </span>pp_arith : <a href="index.html#module-Fmt">Fmt</a>.t <span>&#8209;&gt;</span> <a href="index.html#type-arith_op">arith_op</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_term"><a href="#val-pp_term" class="anchor"></a><code><span class="keyword">val </span>pp_term : <a href="index.html#type-term">term</a> <a href="../Sidekick_util/Util/index.html#type-printer">Sidekick_util.Util.printer</a></code></dt><dt id="val-pp_typed_var"><a href="#val-pp_typed_var" class="anchor"></a><code><span class="keyword">val </span>pp_typed_var : <a href="index.html#type-typed_var">typed_var</a> <a href="../Sidekick_util/Util/index.html#type-printer">Sidekick_util.Util.printer</a></code></dt><dt id="val-pp_par"><a href="#val-pp_par" class="anchor"></a><code><span class="keyword">val </span>pp_par : (CCFormat.t <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> CCFormat.t <span>&#8209;&gt;</span> (string list<span class="keyword"> * </span><span class="type-var">'a</span>) <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_fun_decl"><a href="#val-pp_fun_decl" class="anchor"></a><code><span class="keyword">val </span>pp_fun_decl : <span class="type-var">'a</span> <a href="../Sidekick_util/Util/index.html#type-printer">Sidekick_util.Util.printer</a> <span>&#8209;&gt;</span> Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-fun_decl">fun_decl</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_fr"><a href="#val-pp_fr" class="anchor"></a><code><span class="keyword">val </span>pp_fr : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-fun_def">fun_def</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-pp_stmt"><a href="#val-pp_stmt" class="anchor"></a><code><span class="keyword">val </span>pp_stmt : Format.formatter <span>&#8209;&gt;</span> <a href="index.html#type-statement">statement</a> <span>&#8209;&gt;</span> unit</code></dt></dl><section><header><h2 id="errors"><a href="#errors" class="anchor"></a>Errors</h2></header><dl><dt id="exception-Parse_error"><a href="#exception-Parse_error" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Parse_error</span><span class="keyword"> of </span><a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> option<span class="keyword"> * </span>string</code></dt></dl><dl><dt id="val-parse_error"><a href="#val-parse_error" class="anchor"></a><code><span class="keyword">val </span>parse_error : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-parse_errorf"><a href="#val-parse_errorf" class="anchor"></a><code><span class="keyword">val </span>parse_errorf : ?&#8288;loc:<a href="../Sidekick_smtlib__/Locations/index.html#type-t">Loc.t</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span>, unit, string, <span class="type-var">'b</span>) Pervasives.format4 <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__Parser/.jbuilder-keep b/sidekick/Sidekick_smtlib__Parser/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smtlib__Parser/index.html b/sidekick/Sidekick_smtlib__Parser/index.html
new file mode 100644
index 00000000..8f7a6071
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__Parser/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smtlib__Parser (sidekick.Sidekick_smtlib__Parser)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__Parser</code></h1></header><dl><dt id="type-token"><a href="#type-token" class="anchor"></a><code><span class="keyword">type </span>token</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-token.XOR" class="anchored"><td class="def constructor"><a href="#type-token.XOR" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">XOR</span></code></td></tr><tr id="type-token.TRUE" class="anchored"><td class="def constructor"><a href="#type-token.TRUE" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">TRUE</span></code></td></tr><tr id="type-token.SET_OPTION" class="anchored"><td class="def constructor"><a href="#type-token.SET_OPTION" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">SET_OPTION</span></code></td></tr><tr id="type-token.SET_LOGIC" class="anchored"><td class="def constructor"><a href="#type-token.SET_LOGIC" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">SET_LOGIC</span></code></td></tr><tr id="type-token.SET_INFO" class="anchored"><td class="def constructor"><a href="#type-token.SET_INFO" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">SET_INFO</span></code></td></tr><tr id="type-token.RIGHT_PAREN" class="anchored"><td class="def constructor"><a href="#type-token.RIGHT_PAREN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">RIGHT_PAREN</span></code></td></tr><tr id="type-token.QUOTED" class="anchored"><td class="def constructor"><a href="#type-token.QUOTED" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">QUOTED</span><span class="keyword"> of </span>string</code></td></tr><tr id="type-token.PROD" class="anchored"><td class="def constructor"><a href="#type-token.PROD" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">PROD</span></code></td></tr><tr id="type-token.PAR" class="anchored"><td class="def constructor"><a href="#type-token.PAR" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">PAR</span></code></td></tr><tr id="type-token.OR" class="anchored"><td class="def constructor"><a href="#type-token.OR" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">OR</span></code></td></tr><tr id="type-token.NOT" class="anchored"><td class="def constructor"><a href="#type-token.NOT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">NOT</span></code></td></tr><tr id="type-token.MINUS" class="anchored"><td class="def constructor"><a href="#type-token.MINUS" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">MINUS</span></code></td></tr><tr id="type-token.MATCH" class="anchored"><td class="def constructor"><a href="#type-token.MATCH" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">MATCH</span></code></td></tr><tr id="type-token.LT" class="anchored"><td class="def constructor"><a href="#type-token.LT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LT</span></code></td></tr><tr id="type-token.LET" class="anchored"><td class="def constructor"><a href="#type-token.LET" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LET</span></code></td></tr><tr id="type-token.LEQ" class="anchored"><td class="def constructor"><a href="#type-token.LEQ" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LEQ</span></code></td></tr><tr id="type-token.LEMMA" class="anchored"><td class="def constructor"><a href="#type-token.LEMMA" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LEMMA</span></code></td></tr><tr id="type-token.LEFT_PAREN" class="anchored"><td class="def constructor"><a href="#type-token.LEFT_PAREN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">LEFT_PAREN</span></code></td></tr><tr id="type-token.IF" class="anchored"><td class="def constructor"><a href="#type-token.IF" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">IF</span></code></td></tr><tr id="type-token.IDENT" class="anchored"><td class="def constructor"><a href="#type-token.IDENT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">IDENT</span><span class="keyword"> of </span>string</code></td></tr><tr id="type-token.GT" class="anchored"><td class="def constructor"><a href="#type-token.GT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">GT</span></code></td></tr><tr id="type-token.GEQ" class="anchored"><td class="def constructor"><a href="#type-token.GEQ" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">GEQ</span></code></td></tr><tr id="type-token.FUN" class="anchored"><td class="def constructor"><a href="#type-token.FUN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">FUN</span></code></td></tr><tr id="type-token.FORALL" class="anchored"><td class="def constructor"><a href="#type-token.FORALL" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">FORALL</span></code></td></tr><tr id="type-token.FALSE" class="anchored"><td class="def constructor"><a href="#type-token.FALSE" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">FALSE</span></code></td></tr><tr id="type-token.EXIT" class="anchored"><td class="def constructor"><a href="#type-token.EXIT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EXIT</span></code></td></tr><tr id="type-token.EXISTS" class="anchored"><td class="def constructor"><a href="#type-token.EXISTS" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EXISTS</span></code></td></tr><tr id="type-token.ESCAPED" class="anchored"><td class="def constructor"><a href="#type-token.ESCAPED" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ESCAPED</span><span class="keyword"> of </span>string</code></td></tr><tr id="type-token.EQ" class="anchored"><td class="def constructor"><a href="#type-token.EQ" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EQ</span></code></td></tr><tr id="type-token.EOI" class="anchored"><td class="def constructor"><a href="#type-token.EOI" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">EOI</span></code></td></tr><tr id="type-token.DIV" class="anchored"><td class="def constructor"><a href="#type-token.DIV" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DIV</span></code></td></tr><tr id="type-token.DISTINCT" class="anchored"><td class="def constructor"><a href="#type-token.DISTINCT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DISTINCT</span></code></td></tr><tr id="type-token.DEFINE_FUN_REC" class="anchored"><td class="def constructor"><a href="#type-token.DEFINE_FUN_REC" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DEFINE_FUN_REC</span></code></td></tr><tr id="type-token.DEFINE_FUNS_REC" class="anchored"><td class="def constructor"><a href="#type-token.DEFINE_FUNS_REC" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DEFINE_FUNS_REC</span></code></td></tr><tr id="type-token.DEFINE_FUN" class="anchored"><td class="def constructor"><a href="#type-token.DEFINE_FUN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DEFINE_FUN</span></code></td></tr><tr id="type-token.DEFAULT" class="anchored"><td class="def constructor"><a href="#type-token.DEFAULT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DEFAULT</span></code></td></tr><tr id="type-token.DECLARE_SORT" class="anchored"><td class="def constructor"><a href="#type-token.DECLARE_SORT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DECLARE_SORT</span></code></td></tr><tr id="type-token.DECLARE_FUN" class="anchored"><td class="def constructor"><a href="#type-token.DECLARE_FUN" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DECLARE_FUN</span></code></td></tr><tr id="type-token.DECLARE_CONST" class="anchored"><td class="def constructor"><a href="#type-token.DECLARE_CONST" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DECLARE_CONST</span></code></td></tr><tr id="type-token.DATA" class="anchored"><td class="def constructor"><a href="#type-token.DATA" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">DATA</span></code></td></tr><tr id="type-token.CHECK_SAT" class="anchored"><td class="def constructor"><a href="#type-token.CHECK_SAT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">CHECK_SAT</span></code></td></tr><tr id="type-token.CASE" class="anchored"><td class="def constructor"><a href="#type-token.CASE" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">CASE</span></code></td></tr><tr id="type-token.AT" class="anchored"><td class="def constructor"><a href="#type-token.AT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">AT</span></code></td></tr><tr id="type-token.ASSERT_NOT" class="anchored"><td class="def constructor"><a href="#type-token.ASSERT_NOT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ASSERT_NOT</span></code></td></tr><tr id="type-token.ASSERT" class="anchored"><td class="def constructor"><a href="#type-token.ASSERT" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ASSERT</span></code></td></tr><tr id="type-token.AS" class="anchored"><td class="def constructor"><a href="#type-token.AS" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">AS</span></code></td></tr><tr id="type-token.ARROW" class="anchored"><td class="def constructor"><a href="#type-token.ARROW" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ARROW</span></code></td></tr><tr id="type-token.AND" class="anchored"><td class="def constructor"><a href="#type-token.AND" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">AND</span></code></td></tr><tr id="type-token.ADD" class="anchored"><td class="def constructor"><a href="#type-token.ADD" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">ADD</span></code></td></tr></table><code></code></dt></dl><dl><dt id="exception-Error"><a href="#exception-Error" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Error</span></code></dt></dl><dl><dt id="val-parse_ty"><a href="#val-parse_ty" class="anchor"></a><code><span class="keyword">val </span>parse_ty : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Sidekick_smtlib__/Parse_ast/index.html#type-ty">Sidekick_smtlib__.Parse_ast.ty</a></code></dt><dt id="val-parse_term"><a href="#val-parse_term" class="anchor"></a><code><span class="keyword">val </span>parse_term : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Sidekick_smtlib__/Parse_ast/index.html#type-term">Sidekick_smtlib__.Parse_ast.term</a></code></dt><dt id="val-parse_list"><a href="#val-parse_list" class="anchor"></a><code><span class="keyword">val </span>parse_list : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Sidekick_smtlib__/Parse_ast/index.html#type-statement">Sidekick_smtlib__.Parse_ast.statement</a> list</code></dt><dt id="val-parse"><a href="#val-parse" class="anchor"></a><code><span class="keyword">val </span>parse : (Lexing.lexbuf <span>&#8209;&gt;</span> <a href="index.html#type-token">token</a>) <span>&#8209;&gt;</span> Lexing.lexbuf <span>&#8209;&gt;</span> <a href="../Sidekick_smtlib__/Parse_ast/index.html#type-statement">Sidekick_smtlib__.Parse_ast.statement</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__Process/.jbuilder-keep b/sidekick/Sidekick_smtlib__Process/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smtlib__Process/index.html b/sidekick/Sidekick_smtlib__Process/index.html
new file mode 100644
index 00000000..cff64afd
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__Process/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smtlib__Process (sidekick.Sidekick_smtlib__Process)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__Process</code></h1><h1 id="process-statements"><a href="#process-statements" class="anchor"></a>Process Statements</h1></header><dl><dt id="type-or_error"><a href="#type-or_error" class="anchor"></a><code><span class="keyword">type </span>'a or_error</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span>, string) CCResult.t</code><code></code></dt></dl><dl><dt id="val-conv_ty"><a href="#val-conv_ty" class="anchor"></a><code><span class="keyword">val </span>conv_ty : <a href="../Sidekick_smt/Ast/Ty/index.html#type-t">Sidekick_smt.Ast.Ty.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ty/index.html#type-t">Sidekick_smt.Ty.t</a></code></dt><dt id="val-conv_term"><a href="#val-conv_term" class="anchor"></a><code><span class="keyword">val </span>conv_term : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ast/index.html#type-term">Sidekick_smt.Ast.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a></code></dt><dt id="val-process_stmt"><a href="#val-process_stmt" class="anchor"></a><code><span class="keyword">val </span>process_stmt : ?&#8288;gc:bool <span>&#8209;&gt;</span> ?&#8288;restarts:bool <span>&#8209;&gt;</span> ?&#8288;pp_cnf:bool <span>&#8209;&gt;</span> ?&#8288;dot_proof:string <span>&#8209;&gt;</span> ?&#8288;pp_model:bool <span>&#8209;&gt;</span> ?&#8288;check:bool <span>&#8209;&gt;</span> ?&#8288;time:float <span>&#8209;&gt;</span> ?&#8288;memory:float <span>&#8209;&gt;</span> ?&#8288;progress:bool <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Solver/index.html#type-t">Sidekick_smt.Solver.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ast/index.html#type-statement">Sidekick_smt.Ast.statement</a> <span>&#8209;&gt;</span> unit <a href="index.html#type-or_error">or_error</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__Typecheck/.jbuilder-keep b/sidekick/Sidekick_smtlib__Typecheck/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_smtlib__Typecheck/Ctx/index.html b/sidekick/Sidekick_smtlib__Typecheck/Ctx/index.html
new file mode 100644
index 00000000..8d73cf96
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__Typecheck/Ctx/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Ctx (sidekick.Sidekick_smtlib__Typecheck.Ctx)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__Typecheck.Ctx</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_smtlib__Typecheck/index.html b/sidekick/Sidekick_smtlib__Typecheck/index.html
new file mode 100644
index 00000000..faadb3c3
--- /dev/null
+++ b/sidekick/Sidekick_smtlib__Typecheck/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_smtlib__Typecheck (sidekick.Sidekick_smtlib__Typecheck)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_smtlib__Typecheck</code></h1><h1 id="preprocessing-ast"><a href="#preprocessing-ast" class="anchor"></a>Preprocessing AST</h1><nav><ul><li><a href="#parsing-and-typing">Parsing and Typing</a></li></ul></nav></header><article id="module-Loc"><a href="#module-Loc" class="anchor"></a><code><span class="keyword">module </span>Loc = <a href="../Sidekick_smtlib__/index.html#module-Locations">Sidekick_smtlib__.Locations</a></code></article><dl><dt id="type-or_error"><a href="#type-or_error" class="anchor"></a><code><span class="keyword">type </span>'a or_error</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span>, string) CCResult.t</code><code></code></dt></dl><section><header><h2 id="parsing-and-typing"><a href="#parsing-and-typing" class="anchor"></a>Parsing and Typing</h2></header><article id="module-Ctx"><a href="#module-Ctx" class="anchor"></a><code><span class="keyword">module </span><a href="Ctx/index.html">Ctx</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-PA"><a href="#module-PA" class="anchor"></a><code><span class="keyword">module </span>PA = <a href="../Sidekick_smtlib__/index.html#module-Parse_ast">Sidekick_smtlib__.Parse_ast</a></code></article><article id="module-A"><a href="#module-A" class="anchor"></a><code><span class="keyword">module </span>A = <a href="../Sidekick_smt/index.html#module-Ast">Sidekick_smt.Ast</a></code></article><dl><dt id="val-conv_term"><a href="#val-conv_term" class="anchor"></a><code><span class="keyword">val </span>conv_term : <a href="Ctx/index.html#type-t">Ctx.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smtlib__/Parse_ast/index.html#type-term">PA.term</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ast/index.html#type-term">A.term</a></code></dt><dt id="val-conv_statement"><a href="#val-conv_statement" class="anchor"></a><code><span class="keyword">val </span>conv_statement : <a href="Ctx/index.html#type-t">Ctx.t</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smtlib__/Parse_ast/index.html#type-statement">PA.statement</a> <span>&#8209;&gt;</span> <a href="../Sidekick_smt/Ast/index.html#type-statement">A.statement</a> list</code></dt></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_th_bool/.jbuilder-keep b/sidekick/Sidekick_th_bool/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_th_bool/Lit/index.html b/sidekick/Sidekick_th_bool/Lit/index.html
new file mode 100644
index 00000000..1bf7c6f1
--- /dev/null
+++ b/sidekick/Sidekick_th_bool/Lit/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Lit (sidekick.Sidekick_th_bool.Lit)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_th_bool.Lit</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../../Sidekick_smt/Lit/index.html#type-t">Sidekick_smt.Lit.t</a></code><code></code></dt></dl><dl><dt id="val-eq"><a href="#val-eq" class="anchor"></a><code><span class="keyword">val </span>eq : <a href="../../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-neq"><a href="#val-neq" class="anchor"></a><code><span class="keyword">val </span>neq : <a href="../../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_th_bool/T_cell/index.html b/sidekick/Sidekick_th_bool/T_cell/index.html
new file mode 100644
index 00000000..0012db39
--- /dev/null
+++ b/sidekick/Sidekick_th_bool/T_cell/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>T_cell (sidekick.Sidekick_th_bool.T_cell)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_th_bool.T_cell</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><a href="../../Sidekick_smt/Term_cell/index.html#type-t">Sidekick_smt.Term_cell.t</a></code><code></code></dt></dl><dl><dt id="val-builtin"><a href="#val-builtin" class="anchor"></a><code><span class="keyword">val </span>builtin : <a href="../index.html#type-term">term</a> <a href="../index.html#type-builtin">builtin</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-and_"><a href="#val-and_" class="anchor"></a><code><span class="keyword">val </span>and_ : <a href="../index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-or_"><a href="#val-or_" class="anchor"></a><code><span class="keyword">val </span>or_ : <a href="../index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-not_"><a href="#val-not_" class="anchor"></a><code><span class="keyword">val </span>not_ : <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-imply"><a href="#val-imply" class="anchor"></a><code><span class="keyword">val </span>imply : <a href="../index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-eq"><a href="#val-eq" class="anchor"></a><code><span class="keyword">val </span>eq : <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-neq"><a href="#val-neq" class="anchor"></a><code><span class="keyword">val </span>neq : <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="../index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-distinct"><a href="#val-distinct" class="anchor"></a><code><span class="keyword">val </span>distinct : <a href="../index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_th_bool/index.html b/sidekick/Sidekick_th_bool/index.html
new file mode 100644
index 00000000..381e20e3
--- /dev/null
+++ b/sidekick/Sidekick_th_bool/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_th_bool (sidekick.Sidekick_th_bool)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_th_bool</code></h1><h1 id="theory-of-booleans"><a href="#theory-of-booleans" class="anchor"></a>Theory of Booleans</h1></header><dl><dt id="type-term"><a href="#type-term" class="anchor"></a><code><span class="keyword">type </span>term</code><code><span class="keyword"> = </span><a href="../Sidekick_smt/Term/index.html#type-t">Sidekick_smt.Term.t</a></code><code></code></dt><dt id="type-builtin"><a href="#type-builtin" class="anchor"></a><code><span class="keyword">type </span>'a builtin</code><code></code><code><span class="keyword"> = </span></code><table class="variant"><tr id="type-builtin.B_not" class="anchored"><td class="def constructor"><a href="#type-builtin.B_not" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">B_not</span><span class="keyword"> of </span><span class="type-var">'a</span></code></td></tr><tr id="type-builtin.B_eq" class="anchored"><td class="def constructor"><a href="#type-builtin.B_eq" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">B_eq</span><span class="keyword"> of </span><span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'a</span></code></td></tr><tr id="type-builtin.B_and" class="anchored"><td class="def constructor"><a href="#type-builtin.B_and" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">B_and</span><span class="keyword"> of </span><span class="type-var">'a</span> list</code></td></tr><tr id="type-builtin.B_or" class="anchored"><td class="def constructor"><a href="#type-builtin.B_or" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">B_or</span><span class="keyword"> of </span><span class="type-var">'a</span> list</code></td></tr><tr id="type-builtin.B_imply" class="anchored"><td class="def constructor"><a href="#type-builtin.B_imply" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">B_imply</span><span class="keyword"> of </span><span class="type-var">'a</span> list<span class="keyword"> * </span><span class="type-var">'a</span></code></td></tr><tr id="type-builtin.B_distinct" class="anchored"><td class="def constructor"><a href="#type-builtin.B_distinct" class="anchor"></a><code><span class="keyword">| </span></code><code><span class="constructor">B_distinct</span><span class="keyword"> of </span><span class="type-var">'a</span> list</code></td></tr></table><code></code></dt></dl><dl><dt id="val-map_builtin"><a href="#val-map_builtin" class="anchor"></a><code><span class="keyword">val </span>map_builtin : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-builtin">builtin</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-builtin">builtin</a></code></dt><dt id="val-builtin_to_seq"><a href="#val-builtin_to_seq" class="anchor"></a><code><span class="keyword">val </span>builtin_to_seq : <span class="type-var">'a</span> <a href="index.html#type-builtin">builtin</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t</code></dt></dl><article id="module-T_cell"><a href="#module-T_cell" class="anchor"></a><code><span class="keyword">module </span><a href="T_cell/index.html">T_cell</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-builtin"><a href="#val-builtin" class="anchor"></a><code><span class="keyword">val </span>builtin : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <a href="index.html#type-builtin">builtin</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-and_"><a href="#val-and_" class="anchor"></a><code><span class="keyword">val </span>and_ : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-or_"><a href="#val-or_" class="anchor"></a><code><span class="keyword">val </span>or_ : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-not_"><a href="#val-not_" class="anchor"></a><code><span class="keyword">val </span>not_ : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-imply"><a href="#val-imply" class="anchor"></a><code><span class="keyword">val </span>imply : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-eq"><a href="#val-eq" class="anchor"></a><code><span class="keyword">val </span>eq : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-neq"><a href="#val-neq" class="anchor"></a><code><span class="keyword">val </span>neq : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-distinct"><a href="#val-distinct" class="anchor"></a><code><span class="keyword">val </span>distinct : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-and_l"><a href="#val-and_l" class="anchor"></a><code><span class="keyword">val </span>and_l : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt><dt id="val-or_l"><a href="#val-or_l" class="anchor"></a><code><span class="keyword">val </span>or_l : <a href="../Sidekick_smt/Term/index.html#type-state">Sidekick_smt.Term.state</a> <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a> list <span>&#8209;&gt;</span> <a href="index.html#type-term">term</a></code></dt></dl><article id="module-Lit"><a href="#module-Lit" class="anchor"></a><code><span class="keyword">module </span><a href="Lit/index.html">Lit</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="val-th"><a href="#val-th" class="anchor"></a><code><span class="keyword">val </span>th : <a href="../Sidekick_smt/Theory/index.html#type-t">Sidekick_smt.Theory.t</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/.jbuilder-keep b/sidekick/Sidekick_util/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util/BitField/index.html b/sidekick/Sidekick_util/BitField/index.html
new file mode 100644
index 00000000..c9fb24ed
--- /dev/null
+++ b/sidekick/Sidekick_util/BitField/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>BitField (sidekick.Sidekick_util.BitField)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.BitField</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Heap/Make/argument-1-X/index.html b/sidekick/Sidekick_util/Heap/Make/argument-1-X/index.html
new file mode 100644
index 00000000..f46361a5
--- /dev/null
+++ b/sidekick/Sidekick_util/Heap/Make/argument-1-X/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-X (sidekick.Sidekick_util.Heap.Make.1-X)</title><link rel="stylesheet" href="../../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_util.Heap.Make.1-X</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Index in heap. return -1 if never set</p></dd></dl><dl><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Index in heap. return -1 if never set</p><p>Update index in heap</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Update index in heap</p></dd></dl><dl><dt id="val-cmp"><a href="#val-cmp" class="anchor"></a><code><span class="keyword">val </span>cmp : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Heap/Make/index.html b/sidekick/Sidekick_util/Heap/Make/index.html
new file mode 100644
index 00000000..a7f648a1
--- /dev/null
+++ b/sidekick/Sidekick_util/Heap/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_util.Heap.Make)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.Heap.Make</code></h1></header><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-X/index.html">X</a> : <a href="../index.html#module-type-RANKED">RANKED</a></code></dl><h3 class="heading">Signature</h3><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code><span class="keyword"> = </span><a href="argument-1-X/index.html#type-t">X.t</a></code><code></code></dt><dd><p>Type of elements</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Heap of <a href="index.html#type-elt"><code>elt</code></a>, whose priority is increased or decreased incrementally (see <a href="index.html#val-decrease"><code>decrease</code></a> for instance)</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a heap</p></dd></dl><dl><dt id="val-decrease"><a href="#val-decrease" class="anchor"></a><code><span class="keyword">val </span>decrease : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>decrease h x</code> decreases the value associated to <code>x</code> within <code>h</code>, making it closer to the root (so, more prioritary)</p></dd></dl><dl><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Number of integers within the heap</p></dd></dl><dl><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the content of the heap</p></dd></dl><dl><dt id="val-insert"><a href="#val-insert" class="anchor"></a><code><span class="keyword">val </span>insert : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Insert a new element into the heap</p></dd></dl><dl><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Hint: augment the internal capacity of the heap until it reaches at least the given integer</p></dd></dl><dl><dt id="val-remove_min"><a href="#val-remove_min" class="anchor"></a><code><span class="keyword">val </span>remove_min : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dd><p>Remove and return the integer that has the lowest value from the heap</p><dl><dt>raises Not_found</dt><dd><p>if the heap is empty</p></dd></dl></dd></dl><dl><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Remove element from the heap. precond: <code>in_heap elt</code></p></dd></dl><dl><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Filter out values that don't satisfy the predicate</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Heap/index.html b/sidekick/Sidekick_util/Heap/index.html
new file mode 100644
index 00000000..d033ac5f
--- /dev/null
+++ b/sidekick/Sidekick_util/Heap/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Heap (sidekick.Sidekick_util.Heap)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.Heap</code></h1></header><article id="module-type-RANKED"><a href="#module-type-RANKED" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-RANKED/index.html">RANKED</a> = <a href="../Heap_intf/index.html#module-type-RANKED">Heap_intf.RANKED</a></code></article><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Heap_intf/index.html#module-type-S">Heap_intf.S</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-X/index.html">X</a> : <a href="index.html#module-type-RANKED">RANKED</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-elt">elt</a><span class="keyword"> = </span><a href="Make/argument-1-X/index.html#type-t">X.t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Heap/module-type-RANKED/index.html b/sidekick/Sidekick_util/Heap/module-type-RANKED/index.html
new file mode 100644
index 00000000..811e455b
--- /dev/null
+++ b/sidekick/Sidekick_util/Heap/module-type-RANKED/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>RANKED (sidekick.Sidekick_util.Heap.RANKED)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util.Heap.RANKED</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Index in heap. return -1 if never set</p></dd></dl><dl><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Index in heap. return -1 if never set</p><p>Update index in heap</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Update index in heap</p></dd></dl><dl><dt id="val-cmp"><a href="#val-cmp" class="anchor"></a><code><span class="keyword">val </span>cmp : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Heap/module-type-S/index.html b/sidekick/Sidekick_util/Heap/module-type-S/index.html
new file mode 100644
index 00000000..e054e5ef
--- /dev/null
+++ b/sidekick/Sidekick_util/Heap/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_util.Heap.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util.Heap.S</code></h1></header><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code></code><code></code></dt><dd><p>Type of elements</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Heap of <a href="index.html#type-elt"><code>elt</code></a>, whose priority is increased or decreased incrementally (see <a href="index.html#val-decrease"><code>decrease</code></a> for instance)</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a heap</p></dd></dl><dl><dt id="val-decrease"><a href="#val-decrease" class="anchor"></a><code><span class="keyword">val </span>decrease : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>decrease h x</code> decreases the value associated to <code>x</code> within <code>h</code>, making it closer to the root (so, more prioritary)</p></dd></dl><dl><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Number of integers within the heap</p></dd></dl><dl><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the content of the heap</p></dd></dl><dl><dt id="val-insert"><a href="#val-insert" class="anchor"></a><code><span class="keyword">val </span>insert : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Insert a new element into the heap</p></dd></dl><dl><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Hint: augment the internal capacity of the heap until it reaches at least the given integer</p></dd></dl><dl><dt id="val-remove_min"><a href="#val-remove_min" class="anchor"></a><code><span class="keyword">val </span>remove_min : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dd><p>Remove and return the integer that has the lowest value from the heap</p><dl><dt>raises Not_found</dt><dd><p>if the heap is empty</p></dd></dl></dd></dl><dl><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Remove element from the heap. precond: <code>in_heap elt</code></p></dd></dl><dl><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Filter out values that don't satisfy the predicate</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Heap_intf/index.html b/sidekick/Sidekick_util/Heap_intf/index.html
new file mode 100644
index 00000000..6d544ef1
--- /dev/null
+++ b/sidekick/Sidekick_util/Heap_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Heap_intf (sidekick.Sidekick_util.Heap_intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.Heap_intf</code></h1></header><article id="module-type-RANKED"><a href="#module-type-RANKED" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-RANKED/index.html">RANKED</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Heap_intf/module-type-RANKED/index.html b/sidekick/Sidekick_util/Heap_intf/module-type-RANKED/index.html
new file mode 100644
index 00000000..4edae874
--- /dev/null
+++ b/sidekick/Sidekick_util/Heap_intf/module-type-RANKED/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>RANKED (sidekick.Sidekick_util.Heap_intf.RANKED)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util.Heap_intf.RANKED</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Index in heap. return -1 if never set</p></dd></dl><dl><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Index in heap. return -1 if never set</p><p>Update index in heap</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Update index in heap</p></dd></dl><dl><dt id="val-cmp"><a href="#val-cmp" class="anchor"></a><code><span class="keyword">val </span>cmp : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Heap_intf/module-type-S/index.html b/sidekick/Sidekick_util/Heap_intf/module-type-S/index.html
new file mode 100644
index 00000000..855f8d0e
--- /dev/null
+++ b/sidekick/Sidekick_util/Heap_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_util.Heap_intf.S)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util.Heap_intf.S</code></h1></header><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code></code><code></code></dt><dd><p>Type of elements</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Heap of <a href="index.html#type-elt"><code>elt</code></a>, whose priority is increased or decreased incrementally (see <a href="index.html#val-decrease"><code>decrease</code></a> for instance)</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a heap</p></dd></dl><dl><dt id="val-decrease"><a href="#val-decrease" class="anchor"></a><code><span class="keyword">val </span>decrease : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>decrease h x</code> decreases the value associated to <code>x</code> within <code>h</code>, making it closer to the root (so, more prioritary)</p></dd></dl><dl><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Number of integers within the heap</p></dd></dl><dl><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the content of the heap</p></dd></dl><dl><dt id="val-insert"><a href="#val-insert" class="anchor"></a><code><span class="keyword">val </span>insert : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Insert a new element into the heap</p></dd></dl><dl><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Hint: augment the internal capacity of the heap until it reaches at least the given integer</p></dd></dl><dl><dt id="val-remove_min"><a href="#val-remove_min" class="anchor"></a><code><span class="keyword">val </span>remove_min : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dd><p>Remove and return the integer that has the lowest value from the heap</p><dl><dt>raises Not_found</dt><dd><p>if the heap is empty</p></dd></dl></dd></dl><dl><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Remove element from the heap. precond: <code>in_heap elt</code></p></dd></dl><dl><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Filter out values that don't satisfy the predicate</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/IArray/index.html b/sidekick/Sidekick_util/IArray/index.html
new file mode 100644
index 00000000..6fc528df
--- /dev/null
+++ b/sidekick/Sidekick_util/IArray/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>IArray (sidekick.Sidekick_util.IArray)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.IArray</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code></code><code></code></dt><dd><p>Array of values of type 'a. The underlying type really is an array, but it will never be modified.</p><p>It should be covariant but OCaml will not accept it.</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <span class="type-var">_</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">_</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-singleton"><a href="#val-singleton" class="anchor"></a><code><span class="keyword">val </span>singleton : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-doubleton"><a href="#val-doubleton" class="anchor"></a><code><span class="keyword">val </span>doubleton : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make n x</code> makes an array of <code>n</code> times <code>x</code></p></dd></dl><dl><dt id="val-init"><a href="#val-init" class="anchor"></a><code><span class="keyword">val </span>init : int <span>&#8209;&gt;</span> (int <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>init n f</code> makes the array <code>[| f 0; f 1; ... ; f (n-1) |]</code>.</p><dl><dt>raises Invalid_argument</dt><dd><p>if <code>n &lt; 0</code></p></dd></dl></dd></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>Access the element</p></dd></dl><dl><dt id="val-unsafe_get"><a href="#val-unsafe_get" class="anchor"></a><code><span class="keyword">val </span>unsafe_get : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>Unsafe access, not bound-checked. Use with caution</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Copy the array and modify its copy</p></dd></dl><dl><dt id="val-map"><a href="#val-map" class="anchor"></a><code><span class="keyword">val </span>map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-mapi"><a href="#val-mapi" class="anchor"></a><code><span class="keyword">val </span>mapi : (int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-append"><a href="#val-append" class="anchor"></a><code><span class="keyword">val </span>append : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-iteri"><a href="#val-iteri" class="anchor"></a><code><span class="keyword">val </span>iteri : (int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-foldi"><a href="#val-foldi" class="anchor"></a><code><span class="keyword">val </span>foldi : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-for_all"><a href="#val-for_all" class="anchor"></a><code><span class="keyword">val </span>for_all : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-exists"><a href="#val-exists" class="anchor"></a><code><span class="keyword">val </span>exists : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl><section><header><h2 id="conversions"><a href="#conversions" class="anchor"></a>Conversions</h2></header><dl><dt id="type-sequence"><a href="#type-sequence" class="anchor"></a><code><span class="keyword">type </span>'a sequence</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code><code></code></dt><dt id="type-gen"><a href="#type-gen" class="anchor"></a><code><span class="keyword">type </span>'a gen</code><code><span class="keyword"> = </span>unit <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code><code></code></dt></dl><dl><dt id="val-of_list"><a href="#val-of_list" class="anchor"></a><code><span class="keyword">val </span>of_list : <span class="type-var">'a</span> list <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list"><a href="#val-to_list" class="anchor"></a><code><span class="keyword">val </span>to_list : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-of_list_map"><a href="#val-of_list_map" class="anchor"></a><code><span class="keyword">val </span>of_list_map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> list <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list_map"><a href="#val-to_list_map" class="anchor"></a><code><span class="keyword">val </span>to_list_map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> list</code></dt><dt id="val-of_array_map"><a href="#val-of_array_map" class="anchor"></a><code><span class="keyword">val </span>of_array_map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> array <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_array_map"><a href="#val-to_array_map" class="anchor"></a><code><span class="keyword">val </span>to_array_map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> array</code></dt><dt id="val-of_array_unsafe"><a href="#val-of_array_unsafe" class="anchor"></a><code><span class="keyword">val </span>of_array_unsafe : <span class="type-var">'a</span> array <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Take ownership of the given array. Careful, the array must <b>NOT</b> be modified afterwards!</p></dd></dl><dl><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-sequence">sequence</a></code></dt><dt id="val-of_seq"><a href="#val-of_seq" class="anchor"></a><code><span class="keyword">val </span>of_seq : <span class="type-var">'a</span> <a href="index.html#type-sequence">sequence</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_gen"><a href="#val-of_gen" class="anchor"></a><code><span class="keyword">val </span>of_gen : <span class="type-var">'a</span> <a href="index.html#type-gen">gen</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_gen"><a href="#val-to_gen" class="anchor"></a><code><span class="keyword">val </span>to_gen : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-gen">gen</a></code></dt></dl></section><section><header><h2 id="io"><a href="#io" class="anchor"></a>IO</h2></header><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : ?&#8288;start:string <span>&#8209;&gt;</span> ?&#8288;stop:string <span>&#8209;&gt;</span> ?&#8288;sep:string <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-printer">printer</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <a href="index.html#type-printer">printer</a></code></dt></dl></section><section><header><h2 id="binary"><a href="#binary" class="anchor"></a>Binary</h2></header><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> int) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-for_all2"><a href="#val-for_all2" class="anchor"></a><code><span class="keyword">val </span>for_all2 : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-exists2"><a href="#val-exists2" class="anchor"></a><code><span class="keyword">val </span>exists2 : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-map2"><a href="#val-map2" class="anchor"></a><code><span class="keyword">val </span>map2 : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'c</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'c</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-fold2"><a href="#val-fold2" class="anchor"></a><code><span class="keyword">val </span>fold2 : (<span class="type-var">'acc</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'acc</span>) <span>&#8209;&gt;</span> <span class="type-var">'acc</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'acc</span></code></dt><dt id="val-iter2"><a href="#val-iter2" class="anchor"></a><code><span class="keyword">val </span>iter2 : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/ID/index.html b/sidekick/Sidekick_util/ID/index.html
new file mode 100644
index 00000000..292f6573
--- /dev/null
+++ b/sidekick/Sidekick_util/ID/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>ID (sidekick.Sidekick_util.ID)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.ID</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Intf/index.html b/sidekick/Sidekick_util/Intf/index.html
new file mode 100644
index 00000000..721b693b
--- /dev/null
+++ b/sidekick/Sidekick_util/Intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Intf (sidekick.Sidekick_util.Intf)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.Intf</code></h1></header><article id="module-type-EQ"><a href="#module-type-EQ" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-EQ/index.html">EQ</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-ORD"><a href="#module-type-ORD" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-ORD/index.html">ORD</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-HASH"><a href="#module-type-HASH" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-HASH/index.html">HASH</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-PRINT"><a href="#module-type-PRINT" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-PRINT/index.html">PRINT</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Intf/module-type-EQ/index.html b/sidekick/Sidekick_util/Intf/module-type-EQ/index.html
new file mode 100644
index 00000000..9b371daa
--- /dev/null
+++ b/sidekick/Sidekick_util/Intf/module-type-EQ/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>EQ (sidekick.Sidekick_util.Intf.EQ)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util.Intf.EQ</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Intf/module-type-HASH/index.html b/sidekick/Sidekick_util/Intf/module-type-HASH/index.html
new file mode 100644
index 00000000..c2dc32ff
--- /dev/null
+++ b/sidekick/Sidekick_util/Intf/module-type-HASH/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>HASH (sidekick.Sidekick_util.Intf.HASH)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util.Intf.HASH</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Intf/module-type-ORD/index.html b/sidekick/Sidekick_util/Intf/module-type-ORD/index.html
new file mode 100644
index 00000000..6b51f5d5
--- /dev/null
+++ b/sidekick/Sidekick_util/Intf/module-type-ORD/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>ORD (sidekick.Sidekick_util.Intf.ORD)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util.Intf.ORD</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Intf/module-type-PRINT/index.html b/sidekick/Sidekick_util/Intf/module-type-PRINT/index.html
new file mode 100644
index 00000000..61377614
--- /dev/null
+++ b/sidekick/Sidekick_util/Intf/module-type-PRINT/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>PRINT (sidekick.Sidekick_util.Intf.PRINT)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util.Intf.PRINT</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Log/index.html b/sidekick/Sidekick_util/Log/index.html
new file mode 100644
index 00000000..680347c5
--- /dev/null
+++ b/sidekick/Sidekick_util/Log/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Log (sidekick.Sidekick_util.Log)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.Log</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Util/index.html b/sidekick/Sidekick_util/Util/index.html
new file mode 100644
index 00000000..e3b135f8
--- /dev/null
+++ b/sidekick/Sidekick_util/Util/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Util (sidekick.Sidekick_util.Util)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.Util</code></h1></header></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/Vec/index.html b/sidekick/Sidekick_util/Vec/index.html
new file mode 100644
index 00000000..dd3d11b1
--- /dev/null
+++ b/sidekick/Sidekick_util/Vec/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Vec (sidekick.Sidekick_util.Vec)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util.Vec</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code></code><code></code></dt><dd><p>Abstract type of vectors of 'a</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make cap dummy</code> creates a new vector filled with <code>dummy</code>. The vector is initially empty but its underlying array has capacity <code>cap</code>. <code>dummy</code> will stay alive as long as the vector</p></dd></dl><dl><dt id="val-make_empty"><a href="#val-make_empty" class="anchor"></a><code><span class="keyword">val </span>make_empty : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Vector with an empty capacity. The only argument is the dummy.</p></dd></dl><dl><dt id="val-init"><a href="#val-init" class="anchor"></a><code><span class="keyword">val </span>init : int <span>&#8209;&gt;</span> (int <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Same as <span class="xref-unresolved" title="unresolved reference to &quot;Array.init&quot;"><code>Array</code>.init</span>, but also with a dummy element</p></dd></dl><dl><dt id="val-from_array"><a href="#val-from_array" class="anchor"></a><code><span class="keyword">val </span>from_array : <span class="type-var">'a</span> array <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>from_array arr size dummy</code> takes ownership of <code>data</code> (no copy) to create a vector. <code>size</code> is the length of the slice of <code>data</code> that is used (<code>size &lt;= Array.length data</code> must hold)</p></dd></dl><dl><dt id="val-from_list"><a href="#val-from_list" class="anchor"></a><code><span class="keyword">val </span>from_list : <span class="type-var">'a</span> list <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list"><a href="#val-to_list" class="anchor"></a><code><span class="keyword">val </span>to_list : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dd><p>Returns the list of elements of the vector</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Set size to 0, doesn't free elements</p></dd></dl><dl><dt id="val-shrink"><a href="#val-shrink" class="anchor"></a><code><span class="keyword">val </span>shrink : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>shrink vec sz</code> resets size of <code>vec</code> to <code>sz</code>. Assumes <code>sz &gt;=0 &amp;&amp; sz &lt;= size vec</code></p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Pop last element</p><dl><dt>raises Invalid_argument</dt><dd><p>if the vector is empty</p></dd></dl></dd></dl><dl><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-grow_to_exact"><a href="#val-grow_to_exact" class="anchor"></a><code><span class="keyword">val </span>grow_to_exact : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-grow_to_double_size"><a href="#val-grow_to_double_size" class="anchor"></a><code><span class="keyword">val </span>grow_to_double_size : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>grow_to_at_least vec n</code> ensures that <code>capacity vec &gt;= n</code> in the most efficient way</p></dd></dl><dl><dt id="val-is_full"><a href="#val-is_full" class="anchor"></a><code><span class="keyword">val </span>is_full : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Is the capacity of the vector equal to the number of its elements?</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-append"><a href="#val-append" class="anchor"></a><code><span class="keyword">val </span>append : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>append v1 v2</code> pushes all elements of <code>v2</code> into <code>v1</code></p></dd></dl><dl><dt id="val-last"><a href="#val-last" class="anchor"></a><code><span class="keyword">val </span>last : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>Last element, or</p><dl><dt>raises Invalid_argument</dt><dd><p>if the vector is empty</p></dd></dl></dd></dl><dl><dt id="val-pop_last"><a href="#val-pop_last" class="anchor"></a><code><span class="keyword">val </span>pop_last : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>Combine <a href="index.html#val-last"><code>last</code></a> and <a href="index.html#val-pop"><code>pop</code></a>: remove last element and return it</p><dl><dt>raises Invalid_argument</dt><dd><p>if empty</p></dd></dl></dd></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>get the element at the given index, or</p><dl><dt>raises Invalid_argument</dt><dd><p>if the index is not valid</p></dd></dl></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dd><p>set the element at the given index, either already set or the first free slot if <code>not (is_full vec)</code>, or</p><dl><dt>raises Invalid_argument</dt><dd><p>if the index is not valid</p></dd></dl></dd></dl><dl><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Fresh copy</p></dd></dl><dl><dt id="val-move_to"><a href="#val-move_to" class="anchor"></a><code><span class="keyword">val </span>move_to : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>move_to a b</code> copies the content of <code>a</code> to <code>b</code>, discarding <code>b</code>'s old content</p></dd></dl><dl><dt id="val-fast_remove"><a href="#val-fast_remove" class="anchor"></a><code><span class="keyword">val </span>fast_remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Remove element at index <code>i</code> without preserving order (swap with last element)</p></dd></dl><dl><dt id="val-filter_in_place"><a href="#val-filter_in_place" class="anchor"></a><code><span class="keyword">val </span>filter_in_place : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>filter_in_place f v</code> removes from <code>v</code> the elements that do not satisfy <code>f</code></p></dd></dl><dl><dt id="val-sort"><a href="#val-sort" class="anchor"></a><code><span class="keyword">val </span>sort : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> int) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Sort in place the array</p></dd></dl><dl><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Iterate on elements</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dd><p>Fold over elements</p></dd></dl><dl><dt id="val-exists"><a href="#val-exists" class="anchor"></a><code><span class="keyword">val </span>exists : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Does there exist an element that satisfies the predicate?</p></dd></dl><dl><dt id="val-for_all"><a href="#val-for_all" class="anchor"></a><code><span class="keyword">val </span>for_all : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Do all elements satisfy the predicate?</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : ?&#8288;sep:string <span>&#8209;&gt;</span> (Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util/index.html b/sidekick/Sidekick_util/index.html
new file mode 100644
index 00000000..32d46938
--- /dev/null
+++ b/sidekick/Sidekick_util/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util (sidekick.Sidekick_util)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util</code></h1></header><article id="module-BitField"><a href="#module-BitField" class="anchor"></a><code><span class="keyword">module </span><a href="BitField/index.html">BitField</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Heap"><a href="#module-Heap" class="anchor"></a><code><span class="keyword">module </span><a href="Heap/index.html">Heap</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Heap_intf"><a href="#module-Heap_intf" class="anchor"></a><code><span class="keyword">module </span><a href="Heap_intf/index.html">Heap_intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-IArray"><a href="#module-IArray" class="anchor"></a><code><span class="keyword">module </span><a href="IArray/index.html">IArray</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-ID"><a href="#module-ID" class="anchor"></a><code><span class="keyword">module </span><a href="ID/index.html">ID</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Intf"><a href="#module-Intf" class="anchor"></a><code><span class="keyword">module </span><a href="Intf/index.html">Intf</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Log"><a href="#module-Log" class="anchor"></a><code><span class="keyword">module </span><a href="Log/index.html">Log</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Util"><a href="#module-Util" class="anchor"></a><code><span class="keyword">module </span><a href="Util/index.html">Util</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Vec"><a href="#module-Vec" class="anchor"></a><code><span class="keyword">module </span><a href="Vec/index.html">Vec</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__BitField/.jbuilder-keep b/sidekick/Sidekick_util__BitField/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util__BitField/Make/index.html b/sidekick/Sidekick_util__BitField/Make/index.html
new file mode 100644
index 00000000..0c7d4609
--- /dev/null
+++ b/sidekick/Sidekick_util__BitField/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_util__BitField.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__BitField.Make</code></h1></header><div class="doc"><p>Create a new bitfield type</p></div><h3 class="heading">Parameters</h3><dl></dl><h3 class="heading">Signature</h3><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><span class="keyword">private </span>int</code><code></code></dt><dd><p>Generative type of bitfields. Each instantiation of the functor should create a new, incompatible type</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>Empty bitfields (all bits 0)</p></dd></dl><dl><dt id="type-field"><a href="#type-field" class="anchor"></a><code><span class="keyword">type </span>field</code><code></code><code></code></dt></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Get the value of this field</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Set the value of this field</p></dd></dl><dl><dt id="val-mk_field"><a href="#val-mk_field" class="anchor"></a><code><span class="keyword">val </span>mk_field : unit <span>&#8209;&gt;</span> <a href="index.html#type-field">field</a></code></dt><dd><p>Make a new field</p></dd></dl><dl><dt id="val-freeze"><a href="#val-freeze" class="anchor"></a><code><span class="keyword">val </span>freeze : unit <span>&#8209;&gt;</span> unit</code></dt><dd><p>Prevent new fields from being added. From now on, creating a field will raise Frozen</p></dd></dl><dl><dt id="val-total_width"><a href="#val-total_width" class="anchor"></a><code><span class="keyword">val </span>total_width : unit <span>&#8209;&gt;</span> int</code></dt><dd><p>Current width of the bitfield</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__BitField/index.html b/sidekick/Sidekick_util__BitField/index.html
new file mode 100644
index 00000000..5805e8b5
--- /dev/null
+++ b/sidekick/Sidekick_util__BitField/index.html
@@ -0,0 +1,14 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util__BitField (sidekick.Sidekick_util__BitField)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__BitField</code></h1><h1 id="bit-field"><a href="#bit-field" class="anchor"></a>Bit Field</h1><p>This module defines efficient bitfields up to 30 or 62 bits (depending on the architecture) in a relatively type-safe way.</p><pre><code>module B = CCBitField.Make(struct end);;
+
+#install_printer B.pp;;
+
+let x = B.mk_field ()
+let y = B.mk_field ()
+let z = B.mk_field ()
+
+let f = B.empty |&gt; B.set x true |&gt; B.set y true;;
+
+assert (not (B.get z f)) ;;
+
+assert (f |&gt; B.set z true |&gt; B.get z);;</code></pre></header><dl><dt id="exception-TooManyFields"><a href="#exception-TooManyFields" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">TooManyFields</span></code></dt><dd><p>Raised when too many fields are packed into one bitfield</p></dd></dl><dl><dt id="exception-Frozen"><a href="#exception-Frozen" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Frozen</span></code></dt><dd><p>Raised when a frozen bitfield is modified</p></dd></dl><dl><dt id="val-max_width"><a href="#val-max_width" class="anchor"></a><code><span class="keyword">val </span>max_width : int</code></dt><dd><p>System-dependent maximum width for a bitfield, typically 30 or 62</p></dd></dl><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> () <a href="index.html#module-type-S">S</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__BitField/module-type-S/index.html b/sidekick/Sidekick_util__BitField/module-type-S/index.html
new file mode 100644
index 00000000..da1a1b4e
--- /dev/null
+++ b/sidekick/Sidekick_util__BitField/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_util__BitField.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util__BitField.S</code></h1></header><div class="doc"><h2 id="bitfield-signature"><a href="#bitfield-signature" class="anchor"></a>Bitfield Signature</h2></div><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code><span class="keyword"> = </span><span class="keyword">private </span>int</code><code></code></dt><dd><p>Generative type of bitfields. Each instantiation of the functor should create a new, incompatible type</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <a href="index.html#type-t">t</a></code></dt><dd><p>Empty bitfields (all bits 0)</p></dd></dl><dl><dt id="type-field"><a href="#type-field" class="anchor"></a><code><span class="keyword">type </span>field</code><code></code><code></code></dt></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Get the value of this field</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <a href="index.html#type-field">field</a> <span>&#8209;&gt;</span> bool <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Set the value of this field</p></dd></dl><dl><dt id="val-mk_field"><a href="#val-mk_field" class="anchor"></a><code><span class="keyword">val </span>mk_field : unit <span>&#8209;&gt;</span> <a href="index.html#type-field">field</a></code></dt><dd><p>Make a new field</p></dd></dl><dl><dt id="val-freeze"><a href="#val-freeze" class="anchor"></a><code><span class="keyword">val </span>freeze : unit <span>&#8209;&gt;</span> unit</code></dt><dd><p>Prevent new fields from being added. From now on, creating a field will raise Frozen</p></dd></dl><dl><dt id="val-total_width"><a href="#val-total_width" class="anchor"></a><code><span class="keyword">val </span>total_width : unit <span>&#8209;&gt;</span> int</code></dt><dd><p>Current width of the bitfield</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Heap/.jbuilder-keep b/sidekick/Sidekick_util__Heap/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util__Heap/Make/argument-1-X/index.html b/sidekick/Sidekick_util__Heap/Make/argument-1-X/index.html
new file mode 100644
index 00000000..ea85d5ee
--- /dev/null
+++ b/sidekick/Sidekick_util__Heap/Make/argument-1-X/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>1-X (sidekick.Sidekick_util__Heap.Make.1-X)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../../index.html">sidekick</a></nav><h1>Parameter <code>Sidekick_util__Heap.Make.1-X</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Index in heap. return -1 if never set</p></dd></dl><dl><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Index in heap. return -1 if never set</p><p>Update index in heap</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Update index in heap</p></dd></dl><dl><dt id="val-cmp"><a href="#val-cmp" class="anchor"></a><code><span class="keyword">val </span>cmp : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Heap/Make/index.html b/sidekick/Sidekick_util__Heap/Make/index.html
new file mode 100644
index 00000000..9c2ec822
--- /dev/null
+++ b/sidekick/Sidekick_util__Heap/Make/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Make (sidekick.Sidekick_util__Heap.Make)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__Heap.Make</code></h1></header><h3 class="heading">Parameters</h3><dl><code><a href="argument-1-X/index.html">X</a> : <a href="../index.html#module-type-RANKED">RANKED</a></code></dl><h3 class="heading">Signature</h3><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code><span class="keyword"> = </span><a href="argument-1-X/index.html#type-t">X.t</a></code><code></code></dt><dd><p>Type of elements</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Heap of <a href="index.html#type-elt"><code>elt</code></a>, whose priority is increased or decreased incrementally (see <a href="index.html#val-decrease"><code>decrease</code></a> for instance)</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a heap</p></dd></dl><dl><dt id="val-decrease"><a href="#val-decrease" class="anchor"></a><code><span class="keyword">val </span>decrease : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>decrease h x</code> decreases the value associated to <code>x</code> within <code>h</code>, making it closer to the root (so, more prioritary)</p></dd></dl><dl><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Number of integers within the heap</p></dd></dl><dl><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the content of the heap</p></dd></dl><dl><dt id="val-insert"><a href="#val-insert" class="anchor"></a><code><span class="keyword">val </span>insert : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Insert a new element into the heap</p></dd></dl><dl><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Hint: augment the internal capacity of the heap until it reaches at least the given integer</p></dd></dl><dl><dt id="val-remove_min"><a href="#val-remove_min" class="anchor"></a><code><span class="keyword">val </span>remove_min : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dd><p>Remove and return the integer that has the lowest value from the heap</p><dl><dt>raises Not_found</dt><dd><p>if the heap is empty</p></dd></dl></dd></dl><dl><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Remove element from the heap. precond: <code>in_heap elt</code></p></dd></dl><dl><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Filter out values that don't satisfy the predicate</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Heap/index.html b/sidekick/Sidekick_util__Heap/index.html
new file mode 100644
index 00000000..cd649e31
--- /dev/null
+++ b/sidekick/Sidekick_util__Heap/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util__Heap (sidekick.Sidekick_util__Heap)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__Heap</code></h1></header><article id="module-type-RANKED"><a href="#module-type-RANKED" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-RANKED/index.html">RANKED</a> = <a href="../Sidekick_util/Heap_intf/index.html#module-type-RANKED">Sidekick_util.Heap_intf.RANKED</a></code></article><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> = <a href="../Sidekick_util/Heap_intf/index.html#module-type-S">Sidekick_util.Heap_intf.S</a></code></article><article id="module-Make"><a href="#module-Make" class="anchor"></a><code><span class="keyword">module </span><a href="Make/index.html">Make</a> : <span class="keyword">functor</span> (<a href="Make/argument-1-X/index.html">X</a> : <a href="index.html#module-type-RANKED">RANKED</a>) -&gt; <a href="index.html#module-type-S">S</a><span class="keyword"> with </span><span class="keyword">type </span><a href="Make/index.html#type-elt">elt</a><span class="keyword"> = </span><a href="Make/argument-1-X/index.html#type-t">X.t</a></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Heap/module-type-RANKED/index.html b/sidekick/Sidekick_util__Heap/module-type-RANKED/index.html
new file mode 100644
index 00000000..90f0ec26
--- /dev/null
+++ b/sidekick/Sidekick_util__Heap/module-type-RANKED/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>RANKED (sidekick.Sidekick_util__Heap.RANKED)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util__Heap.RANKED</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Index in heap. return -1 if never set</p></dd></dl><dl><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Index in heap. return -1 if never set</p><p>Update index in heap</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Update index in heap</p></dd></dl><dl><dt id="val-cmp"><a href="#val-cmp" class="anchor"></a><code><span class="keyword">val </span>cmp : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Heap/module-type-S/index.html b/sidekick/Sidekick_util__Heap/module-type-S/index.html
new file mode 100644
index 00000000..2a08a97b
--- /dev/null
+++ b/sidekick/Sidekick_util__Heap/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_util__Heap.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util__Heap.S</code></h1></header><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code></code><code></code></dt><dd><p>Type of elements</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Heap of <a href="index.html#type-elt"><code>elt</code></a>, whose priority is increased or decreased incrementally (see <a href="index.html#val-decrease"><code>decrease</code></a> for instance)</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a heap</p></dd></dl><dl><dt id="val-decrease"><a href="#val-decrease" class="anchor"></a><code><span class="keyword">val </span>decrease : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>decrease h x</code> decreases the value associated to <code>x</code> within <code>h</code>, making it closer to the root (so, more prioritary)</p></dd></dl><dl><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Number of integers within the heap</p></dd></dl><dl><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the content of the heap</p></dd></dl><dl><dt id="val-insert"><a href="#val-insert" class="anchor"></a><code><span class="keyword">val </span>insert : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Insert a new element into the heap</p></dd></dl><dl><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Hint: augment the internal capacity of the heap until it reaches at least the given integer</p></dd></dl><dl><dt id="val-remove_min"><a href="#val-remove_min" class="anchor"></a><code><span class="keyword">val </span>remove_min : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dd><p>Remove and return the integer that has the lowest value from the heap</p><dl><dt>raises Not_found</dt><dd><p>if the heap is empty</p></dd></dl></dd></dl><dl><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Remove element from the heap. precond: <code>in_heap elt</code></p></dd></dl><dl><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Filter out values that don't satisfy the predicate</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Heap_intf/.jbuilder-keep b/sidekick/Sidekick_util__Heap_intf/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util__Heap_intf/index.html b/sidekick/Sidekick_util__Heap_intf/index.html
new file mode 100644
index 00000000..331f88f6
--- /dev/null
+++ b/sidekick/Sidekick_util__Heap_intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util__Heap_intf (sidekick.Sidekick_util__Heap_intf)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__Heap_intf</code></h1></header><article id="module-type-RANKED"><a href="#module-type-RANKED" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-RANKED/index.html">RANKED</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-S"><a href="#module-type-S" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-S/index.html">S</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Heap_intf/module-type-RANKED/index.html b/sidekick/Sidekick_util__Heap_intf/module-type-RANKED/index.html
new file mode 100644
index 00000000..3c2bfe1d
--- /dev/null
+++ b/sidekick/Sidekick_util__Heap_intf/module-type-RANKED/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>RANKED (sidekick.Sidekick_util__Heap_intf.RANKED)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util__Heap_intf.RANKED</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-idx"><a href="#val-idx" class="anchor"></a><code><span class="keyword">val </span>idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Index in heap. return -1 if never set</p></dd></dl><dl><dt id="val-set_idx"><a href="#val-set_idx" class="anchor"></a><code><span class="keyword">val </span>set_idx : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Index in heap. return -1 if never set</p><p>Update index in heap</p></dd></dl><dl><dt id="val-dummy"><a href="#val-dummy" class="anchor"></a><code><span class="keyword">val </span>dummy : <a href="index.html#type-t">t</a></code></dt><dd><p>Update index in heap</p></dd></dl><dl><dt id="val-cmp"><a href="#val-cmp" class="anchor"></a><code><span class="keyword">val </span>cmp : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Heap_intf/module-type-S/index.html b/sidekick/Sidekick_util__Heap_intf/module-type-S/index.html
new file mode 100644
index 00000000..adc62af5
--- /dev/null
+++ b/sidekick/Sidekick_util__Heap_intf/module-type-S/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>S (sidekick.Sidekick_util__Heap_intf.S)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util__Heap_intf.S</code></h1></header><dl><dt id="type-elt"><a href="#type-elt" class="anchor"></a><code><span class="keyword">type </span>elt</code><code></code><code></code></dt><dd><p>Type of elements</p></dd></dl><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt><dd><p>Heap of <a href="index.html#type-elt"><code>elt</code></a>, whose priority is increased or decreased incrementally (see <a href="index.html#val-decrease"><code>decrease</code></a> for instance)</p></dd></dl><dl><dt id="val-create"><a href="#val-create" class="anchor"></a><code><span class="keyword">val </span>create : unit <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Create a heap</p></dd></dl><dl><dt id="val-decrease"><a href="#val-decrease" class="anchor"></a><code><span class="keyword">val </span>decrease : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>decrease h x</code> decreases the value associated to <code>x</code> within <code>h</code>, making it closer to the root (so, more prioritary)</p></dd></dl><dl><dt id="val-in_heap"><a href="#val-in_heap" class="anchor"></a><code><span class="keyword">val </span>in_heap : <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dd><p>Number of integers within the heap</p></dd></dl><dl><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Clear the content of the heap</p></dd></dl><dl><dt id="val-insert"><a href="#val-insert" class="anchor"></a><code><span class="keyword">val </span>insert : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Insert a new element into the heap</p></dd></dl><dl><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Hint: augment the internal capacity of the heap until it reaches at least the given integer</p></dd></dl><dl><dt id="val-remove_min"><a href="#val-remove_min" class="anchor"></a><code><span class="keyword">val </span>remove_min : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a></code></dt><dd><p>Remove and return the integer that has the lowest value from the heap</p><dl><dt>raises Not_found</dt><dd><p>if the heap is empty</p></dd></dl></dd></dl><dl><dt id="val-remove"><a href="#val-remove" class="anchor"></a><code><span class="keyword">val </span>remove : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Remove element from the heap. precond: <code>in_heap elt</code></p></dd></dl><dl><dt id="val-filter"><a href="#val-filter" class="anchor"></a><code><span class="keyword">val </span>filter : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<a href="index.html#type-elt">elt</a> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Filter out values that don't satisfy the predicate</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__IArray/.jbuilder-keep b/sidekick/Sidekick_util__IArray/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util__IArray/index.html b/sidekick/Sidekick_util__IArray/index.html
new file mode 100644
index 00000000..7e2561f9
--- /dev/null
+++ b/sidekick/Sidekick_util__IArray/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util__IArray (sidekick.Sidekick_util__IArray)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__IArray</code></h1><nav><ul><li><a href="#conversions">Conversions</a></li><li><a href="#io">IO</a></li><li><a href="#binary">Binary</a></li></ul></nav></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code></code><code></code></dt><dd><p>Array of values of type 'a. The underlying type really is an array, but it will never be modified.</p><p>It should be covariant but OCaml will not accept it.</p></dd></dl><dl><dt id="val-empty"><a href="#val-empty" class="anchor"></a><code><span class="keyword">val </span>empty : <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <span class="type-var">_</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-length"><a href="#val-length" class="anchor"></a><code><span class="keyword">val </span>length : <span class="type-var">_</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-singleton"><a href="#val-singleton" class="anchor"></a><code><span class="keyword">val </span>singleton : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-doubleton"><a href="#val-doubleton" class="anchor"></a><code><span class="keyword">val </span>doubleton : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make n x</code> makes an array of <code>n</code> times <code>x</code></p></dd></dl><dl><dt id="val-init"><a href="#val-init" class="anchor"></a><code><span class="keyword">val </span>init : int <span>&#8209;&gt;</span> (int <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>init n f</code> makes the array <code>[| f 0; f 1; ... ; f (n-1) |]</code>.</p><dl><dt>raises Invalid_argument</dt><dd><p>if <code>n &lt; 0</code></p></dd></dl></dd></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>Access the element</p></dd></dl><dl><dt id="val-unsafe_get"><a href="#val-unsafe_get" class="anchor"></a><code><span class="keyword">val </span>unsafe_get : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>Unsafe access, not bound-checked. Use with caution</p></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Copy the array and modify its copy</p></dd></dl><dl><dt id="val-map"><a href="#val-map" class="anchor"></a><code><span class="keyword">val </span>map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-mapi"><a href="#val-mapi" class="anchor"></a><code><span class="keyword">val </span>mapi : (int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-append"><a href="#val-append" class="anchor"></a><code><span class="keyword">val </span>append : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-iteri"><a href="#val-iteri" class="anchor"></a><code><span class="keyword">val </span>iteri : (int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-foldi"><a href="#val-foldi" class="anchor"></a><code><span class="keyword">val </span>foldi : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-for_all"><a href="#val-for_all" class="anchor"></a><code><span class="keyword">val </span>for_all : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-exists"><a href="#val-exists" class="anchor"></a><code><span class="keyword">val </span>exists : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl><section><header><h2 id="conversions"><a href="#conversions" class="anchor"></a>Conversions</h2></header><dl><dt id="type-sequence"><a href="#type-sequence" class="anchor"></a><code><span class="keyword">type </span>'a sequence</code><code><span class="keyword"> = </span>(<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code><code></code></dt><dt id="type-gen"><a href="#type-gen" class="anchor"></a><code><span class="keyword">type </span>'a gen</code><code><span class="keyword"> = </span>unit <span>&#8209;&gt;</span> <span class="type-var">'a</span> option</code><code></code></dt></dl><dl><dt id="val-of_list"><a href="#val-of_list" class="anchor"></a><code><span class="keyword">val </span>of_list : <span class="type-var">'a</span> list <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list"><a href="#val-to_list" class="anchor"></a><code><span class="keyword">val </span>to_list : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dt id="val-of_list_map"><a href="#val-of_list_map" class="anchor"></a><code><span class="keyword">val </span>of_list_map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> list <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list_map"><a href="#val-to_list_map" class="anchor"></a><code><span class="keyword">val </span>to_list_map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> list</code></dt><dt id="val-of_array_map"><a href="#val-of_array_map" class="anchor"></a><code><span class="keyword">val </span>of_array_map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> array <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_array_map"><a href="#val-to_array_map" class="anchor"></a><code><span class="keyword">val </span>to_array_map : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> array</code></dt><dt id="val-of_array_unsafe"><a href="#val-of_array_unsafe" class="anchor"></a><code><span class="keyword">val </span>of_array_unsafe : <span class="type-var">'a</span> array <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Take ownership of the given array. Careful, the array must <b>NOT</b> be modified afterwards!</p></dd></dl><dl><dt id="val-to_seq"><a href="#val-to_seq" class="anchor"></a><code><span class="keyword">val </span>to_seq : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-sequence">sequence</a></code></dt><dt id="val-of_seq"><a href="#val-of_seq" class="anchor"></a><code><span class="keyword">val </span>of_seq : <span class="type-var">'a</span> <a href="index.html#type-sequence">sequence</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-of_gen"><a href="#val-of_gen" class="anchor"></a><code><span class="keyword">val </span>of_gen : <span class="type-var">'a</span> <a href="index.html#type-gen">gen</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_gen"><a href="#val-to_gen" class="anchor"></a><code><span class="keyword">val </span>to_gen : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-gen">gen</a></code></dt></dl></section><section><header><h2 id="io"><a href="#io" class="anchor"></a>IO</h2></header><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : ?&#8288;start:string <span>&#8209;&gt;</span> ?&#8288;stop:string <span>&#8209;&gt;</span> ?&#8288;sep:string <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-printer">printer</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <a href="index.html#type-printer">printer</a></code></dt></dl></section><section><header><h2 id="binary"><a href="#binary" class="anchor"></a>Binary</h2></header><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> int) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-for_all2"><a href="#val-for_all2" class="anchor"></a><code><span class="keyword">val </span>for_all2 : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-exists2"><a href="#val-exists2" class="anchor"></a><code><span class="keyword">val </span>exists2 : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-map2"><a href="#val-map2" class="anchor"></a><code><span class="keyword">val </span>map2 : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'c</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'c</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-fold2"><a href="#val-fold2" class="anchor"></a><code><span class="keyword">val </span>fold2 : (<span class="type-var">'acc</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'acc</span>) <span>&#8209;&gt;</span> <span class="type-var">'acc</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'acc</span></code></dt><dt id="val-iter2"><a href="#val-iter2" class="anchor"></a><code><span class="keyword">val </span>iter2 : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></section></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__ID/.jbuilder-keep b/sidekick/Sidekick_util__ID/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util__ID/B/index.html b/sidekick/Sidekick_util__ID/B/index.html
new file mode 100644
index 00000000..713415d9
--- /dev/null
+++ b/sidekick/Sidekick_util__ID/B/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>B (sidekick.Sidekick_util__ID.B)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__ID.B</code></h1></header><dl><dt id="val-rat"><a href="#val-rat" class="anchor"></a><code><span class="keyword">val </span>rat : <a href="../index.html#type-t">t</a></code></dt><dt id="val-int"><a href="#val-int" class="anchor"></a><code><span class="keyword">val </span>int : <a href="../index.html#type-t">t</a></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__ID/index.html b/sidekick/Sidekick_util__ID/index.html
new file mode 100644
index 00000000..9e996521
--- /dev/null
+++ b/sidekick/Sidekick_util__ID/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util__ID (sidekick.Sidekick_util__ID)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__ID</code></h1><h1 id="unique-identifiers"><a href="#unique-identifiers" class="anchor"></a>Unique Identifiers</h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : string <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-makef"><a href="#val-makef" class="anchor"></a><code><span class="keyword">val </span>makef : (<span class="type-var">'a</span>, Format.formatter, unit, <a href="index.html#type-t">t</a>) Pervasives.format4 <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-id"><a href="#val-id" class="anchor"></a><code><span class="keyword">val </span>id : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-to_string"><a href="#val-to_string" class="anchor"></a><code><span class="keyword">val </span>to_string : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt><dt id="val-to_string_full"><a href="#val-to_string_full" class="anchor"></a><code><span class="keyword">val </span>to_string_full : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> string</code></dt></dl><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../Sidekick_util/Intf/index.html#module-type-EQ">Sidekick_util.Intf.EQ</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_util/Intf/module-type-EQ/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></details></div></div></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../Sidekick_util/Intf/index.html#module-type-ORD">Sidekick_util.Intf.ORD</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_util/Intf/module-type-ORD/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></details></div></div></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../Sidekick_util/Intf/index.html#module-type-HASH">Sidekick_util.Intf.HASH</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_util/Intf/module-type-HASH/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></details></div></div></article><article><div class="spec include"><div class="doc"><details open="open"><summary><span class="def"><code><span class="keyword">include </span><a href="../Sidekick_util/Intf/index.html#module-type-PRINT">Sidekick_util.Intf.PRINT</a><span class="keyword"> with </span><span class="keyword">type </span><a href="../Sidekick_util/Intf/module-type-PRINT/index.html#type-t">t</a> := <a href="index.html#type-t">t</a></code></span></summary><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></details></div></div></article><dl><dt id="val-pp_name"><a href="#val-pp_name" class="anchor"></a><code><span class="keyword">val </span>pp_name : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl><article id="module-Map"><a href="#module-Map" class="anchor"></a><code><span class="keyword">module </span>Map : CCMap.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Map">Map</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-Set"><a href="#module-Set" class="anchor"></a><code><span class="keyword">module </span>Set : CCSet.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Set">Set</a>.elt<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-Tbl"><a href="#module-Tbl" class="anchor"></a><code><span class="keyword">module </span>Tbl : CCHashtbl.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Tbl">Tbl</a>.key<span class="keyword"> = </span><a href="index.html#type-t">t</a></code></article><article id="module-B"><a href="#module-B" class="anchor"></a><code><span class="keyword">module </span><a href="B/index.html">B</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Intf/.jbuilder-keep b/sidekick/Sidekick_util__Intf/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util__Intf/index.html b/sidekick/Sidekick_util__Intf/index.html
new file mode 100644
index 00000000..2eebbee2
--- /dev/null
+++ b/sidekick/Sidekick_util__Intf/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util__Intf (sidekick.Sidekick_util__Intf)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__Intf</code></h1></header><article id="module-type-EQ"><a href="#module-type-EQ" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-EQ/index.html">EQ</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-ORD"><a href="#module-type-ORD" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-ORD/index.html">ORD</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-HASH"><a href="#module-type-HASH" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-HASH/index.html">HASH</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><article id="module-type-PRINT"><a href="#module-type-PRINT" class="anchor"></a><code><span class="keyword">module type </span><a href="module-type-PRINT/index.html">PRINT</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></article><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span>Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code><code></code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Intf/module-type-EQ/index.html b/sidekick/Sidekick_util__Intf/module-type-EQ/index.html
new file mode 100644
index 00000000..46e80fca
--- /dev/null
+++ b/sidekick/Sidekick_util__Intf/module-type-EQ/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>EQ (sidekick.Sidekick_util__Intf.EQ)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util__Intf.EQ</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-equal"><a href="#val-equal" class="anchor"></a><code><span class="keyword">val </span>equal : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Intf/module-type-HASH/index.html b/sidekick/Sidekick_util__Intf/module-type-HASH/index.html
new file mode 100644
index 00000000..451bdc56
--- /dev/null
+++ b/sidekick/Sidekick_util__Intf/module-type-HASH/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>HASH (sidekick.Sidekick_util__Intf.HASH)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util__Intf.HASH</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-hash"><a href="#val-hash" class="anchor"></a><code><span class="keyword">val </span>hash : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Intf/module-type-ORD/index.html b/sidekick/Sidekick_util__Intf/module-type-ORD/index.html
new file mode 100644
index 00000000..54e0230e
--- /dev/null
+++ b/sidekick/Sidekick_util__Intf/module-type-ORD/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>ORD (sidekick.Sidekick_util__Intf.ORD)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util__Intf.ORD</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-compare"><a href="#val-compare" class="anchor"></a><code><span class="keyword">val </span>compare : <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Intf/module-type-PRINT/index.html b/sidekick/Sidekick_util__Intf/module-type-PRINT/index.html
new file mode 100644
index 00000000..b5c79efc
--- /dev/null
+++ b/sidekick/Sidekick_util__Intf/module-type-PRINT/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>PRINT (sidekick.Sidekick_util__Intf.PRINT)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../../index.html">sidekick</a></nav><h1>Module type <code>Sidekick_util__Intf.PRINT</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>t</code><code></code><code></code></dt></dl><dl><dt id="val-pp"><a href="#val-pp" class="anchor"></a><code><span class="keyword">val </span>pp : <a href="index.html#type-t">t</a> CCFormat.printer</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Log/.jbuilder-keep b/sidekick/Sidekick_util__Log/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util__Log/index.html b/sidekick/Sidekick_util__Log/index.html
new file mode 100644
index 00000000..34e45be9
--- /dev/null
+++ b/sidekick/Sidekick_util__Log/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util__Log (sidekick.Sidekick_util__Log)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__Log</code></h1><h1 id="logging-function,-for-debugging"><a href="#logging-function,-for-debugging" class="anchor"></a>Logging function, for debugging</h1></header><dl><dt id="val-enabled"><a href="#val-enabled" class="anchor"></a><code><span class="keyword">val </span>enabled : bool</code></dt><dt id="val-set_debug"><a href="#val-set_debug" class="anchor"></a><code><span class="keyword">val </span>set_debug : int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Set debug level</p></dd></dl><dl><dt id="val-get_debug"><a href="#val-get_debug" class="anchor"></a><code><span class="keyword">val </span>get_debug : unit <span>&#8209;&gt;</span> int</code></dt><dd><p>Set debug level</p><p>Current debug level</p></dd></dl><dl><dt id="val-debugf"><a href="#val-debugf" class="anchor"></a><code><span class="keyword">val </span>debugf : int <span>&#8209;&gt;</span> (((<span class="type-var">'a</span>, Format.formatter, unit, unit) Pervasives.format4 <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Emit a debug message at the given level. If the level is lower than <code>get_debug ()</code>, the message will indeed be emitted</p></dd></dl><dl><dt id="val-debug"><a href="#val-debug" class="anchor"></a><code><span class="keyword">val </span>debug : int <span>&#8209;&gt;</span> string <span>&#8209;&gt;</span> unit</code></dt><dd><p>Simpler version of <a href="index.html#val-debug"><code>debug</code></a>, without formatting</p></dd></dl><dl><dt id="val-set_debug_out"><a href="#val-set_debug_out" class="anchor"></a><code><span class="keyword">val </span>set_debug_out : Format.formatter <span>&#8209;&gt;</span> unit</code></dt><dd><p>Change the output formatter.</p></dd></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Util/.jbuilder-keep b/sidekick/Sidekick_util__Util/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util__Util/index.html b/sidekick/Sidekick_util__Util/index.html
new file mode 100644
index 00000000..46dc84c6
--- /dev/null
+++ b/sidekick/Sidekick_util__Util/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util__Util (sidekick.Sidekick_util__Util)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__Util</code></h1><h1 id="utils"><a href="#utils" class="anchor"></a>Utils</h1></header><dl><dt id="type-printer"><a href="#type-printer" class="anchor"></a><code><span class="keyword">type </span>'a printer</code><code><span class="keyword"> = </span><span class="type-var">'a</span> CCFormat.printer</code><code></code></dt></dl><dl><dt id="val-pp_list"><a href="#val-pp_list" class="anchor"></a><code><span class="keyword">val </span>pp_list : ?&#8288;sep:string <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-printer">printer</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list <a href="index.html#type-printer">printer</a></code></dt><dt id="val-pp_seq"><a href="#val-pp_seq" class="anchor"></a><code><span class="keyword">val </span>pp_seq : ?&#8288;sep:string <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-printer">printer</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> Sequence.t <a href="index.html#type-printer">printer</a></code></dt><dt id="val-pp_array"><a href="#val-pp_array" class="anchor"></a><code><span class="keyword">val </span>pp_array : ?&#8288;sep:string <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-printer">printer</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> array <a href="index.html#type-printer">printer</a></code></dt><dt id="val-pp_pair"><a href="#val-pp_pair" class="anchor"></a><code><span class="keyword">val </span>pp_pair : ?&#8288;sep:string <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-printer">printer</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span> <a href="index.html#type-printer">printer</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span><span class="keyword"> * </span><span class="type-var">'b</span>) <a href="index.html#type-printer">printer</a></code></dt><dt id="val-pp_iarray"><a href="#val-pp_iarray" class="anchor"></a><code><span class="keyword">val </span>pp_iarray : ?&#8288;sep:string <span>&#8209;&gt;</span> <span class="type-var">'a</span> CCFormat.printer <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="../Sidekick_util/IArray/index.html#type-t">Sidekick_util.IArray.t</a> CCFormat.printer</code></dt></dl><dl><dt id="exception-Error"><a href="#exception-Error" class="anchor"></a><code><span class="keyword">exception </span></code><code><span class="exception">Error</span><span class="keyword"> of </span>string</code></dt></dl><dl><dt id="val-errorf"><a href="#val-errorf" class="anchor"></a><code><span class="keyword">val </span>errorf : (<span class="type-var">'a</span>, Format.formatter, unit, <span class="type-var">'b</span>) Pervasives.format4 <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><dl><dt>raises Error</dt><dd><p>when called</p></dd></dl></dd></dl><dl><dt id="val-setup_gc"><a href="#val-setup_gc" class="anchor"></a><code><span class="keyword">val </span>setup_gc : unit <span>&#8209;&gt;</span> unit</code></dt><dd><p>Change parameters of the GC</p></dd></dl><article id="module-Int_set"><a href="#module-Int_set" class="anchor"></a><code><span class="keyword">module </span>Int_set : CCSet.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Int_set">Int_set</a>.elt<span class="keyword"> = </span>int</code></article><article id="module-Int_map"><a href="#module-Int_map" class="anchor"></a><code><span class="keyword">module </span>Int_map : CCMap.S<span class="keyword"> with </span><span class="keyword">type </span><a href="index.html#module-Int_map">Int_map</a>.key<span class="keyword"> = </span>int</code></article></body></html>
\ No newline at end of file
diff --git a/sidekick/Sidekick_util__Vec/.jbuilder-keep b/sidekick/Sidekick_util__Vec/.jbuilder-keep
new file mode 100644
index 00000000..e69de29b
diff --git a/sidekick/Sidekick_util__Vec/index.html b/sidekick/Sidekick_util__Vec/index.html
new file mode 100644
index 00000000..6750319e
--- /dev/null
+++ b/sidekick/Sidekick_util__Vec/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Sidekick_util__Vec (sidekick.Sidekick_util__Vec)</title><link rel="stylesheet" href="../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="../index.html">sidekick</a></nav><h1>Module <code>Sidekick_util__Vec</code></h1></header><dl><dt id="type-t"><a href="#type-t" class="anchor"></a><code><span class="keyword">type </span>'a t</code><code></code><code></code></dt><dd><p>Abstract type of vectors of 'a</p></dd></dl><dl><dt id="val-make"><a href="#val-make" class="anchor"></a><code><span class="keyword">val </span>make : int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>make cap dummy</code> creates a new vector filled with <code>dummy</code>. The vector is initially empty but its underlying array has capacity <code>cap</code>. <code>dummy</code> will stay alive as long as the vector</p></dd></dl><dl><dt id="val-make_empty"><a href="#val-make_empty" class="anchor"></a><code><span class="keyword">val </span>make_empty : <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Vector with an empty capacity. The only argument is the dummy.</p></dd></dl><dl><dt id="val-init"><a href="#val-init" class="anchor"></a><code><span class="keyword">val </span>init : int <span>&#8209;&gt;</span> (int <span>&#8209;&gt;</span> <span class="type-var">'a</span>) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Same as <span class="xref-unresolved" title="unresolved reference to &quot;Array.init&quot;"><code>Array</code>.init</span>, but also with a dummy element</p></dd></dl><dl><dt id="val-from_array"><a href="#val-from_array" class="anchor"></a><code><span class="keyword">val </span>from_array : <span class="type-var">'a</span> array <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p><code>from_array arr size dummy</code> takes ownership of <code>data</code> (no copy) to create a vector. <code>size</code> is the length of the slice of <code>data</code> that is used (<code>size &lt;= Array.length data</code> must hold)</p></dd></dl><dl><dt id="val-from_list"><a href="#val-from_list" class="anchor"></a><code><span class="keyword">val </span>from_list : <span class="type-var">'a</span> list <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dt id="val-to_list"><a href="#val-to_list" class="anchor"></a><code><span class="keyword">val </span>to_list : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> list</code></dt><dd><p>Returns the list of elements of the vector</p></dd></dl><dl><dt id="val-clear"><a href="#val-clear" class="anchor"></a><code><span class="keyword">val </span>clear : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Set size to 0, doesn't free elements</p></dd></dl><dl><dt id="val-shrink"><a href="#val-shrink" class="anchor"></a><code><span class="keyword">val </span>shrink : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>shrink vec sz</code> resets size of <code>vec</code> to <code>sz</code>. Assumes <code>sz &gt;=0 &amp;&amp; sz &lt;= size vec</code></p></dd></dl><dl><dt id="val-pop"><a href="#val-pop" class="anchor"></a><code><span class="keyword">val </span>pop : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Pop last element</p><dl><dt>raises Invalid_argument</dt><dd><p>if the vector is empty</p></dd></dl></dd></dl><dl><dt id="val-size"><a href="#val-size" class="anchor"></a><code><span class="keyword">val </span>size : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int</code></dt><dt id="val-is_empty"><a href="#val-is_empty" class="anchor"></a><code><span class="keyword">val </span>is_empty : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dt id="val-grow_to_exact"><a href="#val-grow_to_exact" class="anchor"></a><code><span class="keyword">val </span>grow_to_exact : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dt id="val-grow_to_double_size"><a href="#val-grow_to_double_size" class="anchor"></a><code><span class="keyword">val </span>grow_to_double_size : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-grow_to_at_least"><a href="#val-grow_to_at_least" class="anchor"></a><code><span class="keyword">val </span>grow_to_at_least : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>grow_to_at_least vec n</code> ensures that <code>capacity vec &gt;= n</code> in the most efficient way</p></dd></dl><dl><dt id="val-is_full"><a href="#val-is_full" class="anchor"></a><code><span class="keyword">val </span>is_full : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Is the capacity of the vector equal to the number of its elements?</p></dd></dl><dl><dt id="val-push"><a href="#val-push" class="anchor"></a><code><span class="keyword">val </span>push : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dt id="val-append"><a href="#val-append" class="anchor"></a><code><span class="keyword">val </span>append : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>append v1 v2</code> pushes all elements of <code>v2</code> into <code>v1</code></p></dd></dl><dl><dt id="val-last"><a href="#val-last" class="anchor"></a><code><span class="keyword">val </span>last : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>Last element, or</p><dl><dt>raises Invalid_argument</dt><dd><p>if the vector is empty</p></dd></dl></dd></dl><dl><dt id="val-pop_last"><a href="#val-pop_last" class="anchor"></a><code><span class="keyword">val </span>pop_last : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>Combine <a href="index.html#val-last"><code>last</code></a> and <a href="index.html#val-pop"><code>pop</code></a>: remove last element and return it</p><dl><dt>raises Invalid_argument</dt><dd><p>if empty</p></dd></dl></dd></dl><dl><dt id="val-get"><a href="#val-get" class="anchor"></a><code><span class="keyword">val </span>get : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span></code></dt><dd><p>get the element at the given index, or</p><dl><dt>raises Invalid_argument</dt><dd><p>if the index is not valid</p></dd></dl></dd></dl><dl><dt id="val-set"><a href="#val-set" class="anchor"></a><code><span class="keyword">val </span>set : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit</code></dt><dd><p>set the element at the given index, either already set or the first free slot if <code>not (is_full vec)</code>, or</p><dl><dt>raises Invalid_argument</dt><dd><p>if the index is not valid</p></dd></dl></dd></dl><dl><dt id="val-copy"><a href="#val-copy" class="anchor"></a><code><span class="keyword">val </span>copy : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a></code></dt><dd><p>Fresh copy</p></dd></dl><dl><dt id="val-move_to"><a href="#val-move_to" class="anchor"></a><code><span class="keyword">val </span>move_to : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>move_to a b</code> copies the content of <code>a</code> to <code>b</code>, discarding <code>b</code>'s old content</p></dd></dl><dl><dt id="val-fast_remove"><a href="#val-fast_remove" class="anchor"></a><code><span class="keyword">val </span>fast_remove : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> int <span>&#8209;&gt;</span> unit</code></dt><dd><p>Remove element at index <code>i</code> without preserving order (swap with last element)</p></dd></dl><dl><dt id="val-filter_in_place"><a href="#val-filter_in_place" class="anchor"></a><code><span class="keyword">val </span>filter_in_place : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p><code>filter_in_place f v</code> removes from <code>v</code> the elements that do not satisfy <code>f</code></p></dd></dl><dl><dt id="val-sort"><a href="#val-sort" class="anchor"></a><code><span class="keyword">val </span>sort : <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> (<span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> int) <span>&#8209;&gt;</span> unit</code></dt><dd><p>Sort in place the array</p></dd></dl><dl><dt id="val-iter"><a href="#val-iter" class="anchor"></a><code><span class="keyword">val </span>iter : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt><dd><p>Iterate on elements</p></dd></dl><dl><dt id="val-fold"><a href="#val-fold" class="anchor"></a><code><span class="keyword">val </span>fold : (<span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> <span class="type-var">'b</span>) <span>&#8209;&gt;</span> <span class="type-var">'b</span> <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> <span class="type-var">'b</span></code></dt><dd><p>Fold over elements</p></dd></dl><dl><dt id="val-exists"><a href="#val-exists" class="anchor"></a><code><span class="keyword">val </span>exists : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Does there exist an element that satisfies the predicate?</p></dd></dl><dl><dt id="val-for_all"><a href="#val-for_all" class="anchor"></a><code><span class="keyword">val </span>for_all : (<span class="type-var">'a</span> <span>&#8209;&gt;</span> bool) <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> bool</code></dt><dd><p>Do all elements satisfy the predicate?</p></dd></dl><dl><dt id="val-print"><a href="#val-print" class="anchor"></a><code><span class="keyword">val </span>print : ?&#8288;sep:string <span>&#8209;&gt;</span> (Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <span>&#8209;&gt;</span> unit) <span>&#8209;&gt;</span> Format.formatter <span>&#8209;&gt;</span> <span class="type-var">'a</span> <a href="index.html#type-t">t</a> <span>&#8209;&gt;</span> unit</code></dt></dl></body></html>
\ No newline at end of file
diff --git a/sidekick/index.html b/sidekick/index.html
new file mode 100644
index 00000000..7aebb89c
--- /dev/null
+++ b/sidekick/index.html
@@ -0,0 +1,2 @@
+<!DOCTYPE html>
+<html xmlns="http://www.w3.org/1999/xhtml"><head><title>index (sidekick.index)</title><link rel="stylesheet" href="../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><header><nav><a href="../index.html">Up</a> – package <a href="index.html">sidekick</a></nav></header></body></html>
\ No newline at end of file